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

Re: [Boost-users] Undefined reference
by Carl Wainwright 08 May '07

08 May '07

Hi there, Surely if that was the case I would have received a compilation error. As it is my code compiles without any errors/warnings which makes me think it's a linker error or something else. Additionally the headers for boost are in /usr/include/boost so I don't believe I need to specify this include directive in my makefile Cheers Carl |-----Original Message----- |From: boost-users-bounces(a)lists.boost.org |[mailto:boost-users-bounces@lists.boost.org] On Behalf Of Xu, Peng |Sent: 08 May 2007 18:01 |To: boost-users(a)lists.boost.org |Subject: Re: [Boost-users] Undefined reference | |You need to specify where boost headers are located, |-I/path-to-boost-headers. | |-----Original Message----- |From: boost-users-bounces(a)lists.boost.org |[mailto:boost-users-bounces@lists.boost.org] On Behalf Of Carl |Wainwright |Sent: Tuesday, May 08, 2007 11:56 AM |To: boost-users(a)lists.boost.org |Subject: [Boost-users] Undefined reference | |Hi all, | |I've started just recently to use boost in my C++ application |to manage some threads. However, when I link my application I |get strange undefined references | |g++ -g -O -o test_exe -lcppunit -ldl -lpthread -lboost_thread Main.o |test.o |test.o(.text+0x874): In function `threadTestCases::spawnThread()': |: undefined reference to `boost::thread::thread(boost::function0<void, |std::allocator<boost::function_base> > const&)' |test.o(.text+0x8b7): In function `threadTestCases::spawnThread()': |: undefined reference to `boost::thread::join()' |test.o(.text+0x8ce): In function `threadTestCases::spawnThread()': |: undefined reference to `boost::thread::~thread()' |test.o(.text+0x8eb): In function `threadTestCases::spawnThread()': |: undefined reference to `boost::thread::~thread()' |collect2: ld returned 1 exit status |make: *** [test_exe] Error 1 | |As you can see I have linked in the boost_thread and pthread |but still I get the problem. My LD_LIBRARY_PATH is correctly |setup to define the path where boost is installed (/usr/lib/) | |The code is as follows and is used in a CPPUNIT framework. The |boost code is in the spawnThread member function. | |//--------------------------------------------------------------------- |#include "test.h" |#include <ostream> |#include <pthread.h> | |#include <boost/thread/thread.hpp> |#include <boost/bind.hpp> | |using namespace std; |using namespace boost; | |CPPUNIT_TEST_SUITE_REGISTRATION( threadTestCases ); | |void threadTestCases::setUp() |{ | cout << "\nthreadTestCases::setUp\n" << endl ; } | |void threadTestCases::tearDown() |{ | cout << "\nthreadTestCases::tearDown\n" << endl ; } | |void threadTestCases::testThread() |{ | cout << "Thread [testThread] spawned\n" << endl; | | try | { | CPPUNIT_ASSERT(1 == 2); | cout << "Thread end" << endl; | } | catch(...) | { | cout << "Exception caught in testThread, continue\n" << endl; | } | | pthread_exit(0); |} | |void *my_thread(void *) |{ | cout << "Thread [my_thread] spawned\n" << endl ; | | try | { | CPPUNIT_ASSERT(1 == 2); | } | catch(...) | { | cout << "Exception caught in my_thread, continue\n" << endl; | } | | pthread_exit(0); |} | |void threadTestCases::spawnThread() |{ |pthread_t thread[2]; |int ret; | | cout << "\nSpawning new thread\n" << endl; | | // Create thread via boost | boost::thread mfThread(boost::bind(&threadTestCases::testThread, |this)); | | // Start execution of thread | mfThread.join(); |} | | |Is there anything I have done wrong in the code or perhaps in |the build environment which is using Boost library v1.32.0-1 |for Linux RedHat with |g++ (GCC 3.4.6) | |Any help would be appreciated as this has been bugging me for |several hours today. | |Cheers |Carl |_______________________________________________ |Boost-users mailing list |Boost-users(a)lists.boost.org |http://lists.boost.org/mailman/listinfo.cgi/boost-users |_______________________________________________ |Boost-users mailing list |Boost-users(a)lists.boost.org |http://lists.boost.org/mailman/listinfo.cgi/boost-users |

1 0

filtering ostream problem... pushing zlib_compressor works in 1_33, dies in 1_34_0
by Jeff 08 May '07

08 May '07

Hello, The code below works fine in 1_33, but throws a bad_alloc exception after some 10-20K iterations in 1_34_0. Am I doing something wrong? Did the API or usage requirements change? Thanks, Jeff --------------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <fstream> #include <sstream> #include <string> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/zlib.hpp> #include <boost/iostreams/device/array.hpp> #include <boost/iostreams/stream.hpp> #include <boost/iostreams/filtering_streambuf.hpp> bool binaryFile2String(const std::string& filename, std::string& out) { std::ifstream is(filename.c_str(), std::ios_base::in|std::ios_base::binary); if ( is.bad() || is.fail() ) return false; is.seekg(0,std::ios::end); const std::ios::pos_type len(is.tellg()); if ( len > out.max_size() ) return false; out.reserve(len); is.seekg(0, std::ios::beg); std::ostringstream os; os << is.rdbuf(); if ( ! is && ! is.eof() ) return false; out = os.str(); is.close(); return true; } int main(int argc, char** argv) { const char* inFileName = "/tmp/car.xml"; // put your data file here int loops(20000); if ( argc > 1 ) loops = atoi(argv[1]); std::string stringData; if ( ! binaryFile2String(inFileName,stringData) ) { std::cerr<<"Failed reading file "<<inFileName<<" into string"<<std::endl; exit(1); } register int i(0); try { for (i=loops; i > 0; --i) { if ( 0 == (i % 1000) ) std::cerr<<' '<<i; std::istringstream ifs(stringData); std::ostringstream toFS; boost::iostreams::filtering_ostream ofs; // this line causing the bad_alloc exception ofs.push(boost::iostreams::zlib_compressor()); ofs.push(toFS); boost::iostreams::copy(ifs,ofs); ofs.reset(); } } catch(const std::exception& e) { std::cerr<<"\nCaught std::exception on iteration "<<i<<": "<<e.what()<<std::endl; } if ( 0 == i ) { std::cerr<<"\nTEST OK on "<<loops<<" iterations"<<std::endl; } else { std::cerr<<"\nTEST FAILED on iteration "<<i<<std::endl; } return 0; }

2 1

Pointer in function parameter?
by Meryl Silverburgh 08 May '07

08 May '07

Hi, I have a vector <A*> and I want to switch boost's ref count pointer like this: vector< boost::shared_ptr<A> > aVector; aFunc(aVector[0]) ; // just call a My question is should I change the function parameter of aFuncion from this: void aFunc(A* aPtr) { // access aPtr } to this: void aFunc(shared_ptr<A> aPtr) { // access aPtr } Thank you.

3 7

Question about a vector of boost shared_ptr
by Meryl Silverburgh 08 May '07

08 May '07

If I have an attribute of a vector of boost shared_ptr in a class, like this: class A; class B { public : ~B() { ...} private: std::vector< boost::shared_ptr<A> > aVector; }; What do I need to do in the destructor of B so that all the memory used by a vector of shared_ptr of A ('aVector') will be freed correctly? Thank you.

2 1

Boost 1.34.0 Beta released
by Thomas Witt 08 May '07

08 May '07

The first beta of what will become version 1.34.0 is now available from http://www.boost.org. New Libraries * Foreach Library: BOOST_FOREACH macro for easily iterating over the elements of a sequence, from Eric Niebler. * Statechart Library: Arbitrarily complex finite state machines can be implemented in easily readable and maintainable C++ code, from Andreas Huber. * TR1 Library: An implementation of the C++ Technical Report on Standard Library Extensions, from John Maddock. This library does not itself implement the TR1 components, rather it's a thin wrapper that will include your standard library's TR1 implementation (if it has one), otherwise it will include the Boost Library equivalents, and import them into namespace std::tr1. Highlights include: Reference Wrappers, Smart Pointers, result_of, Function Object Binders, Polymorphic function wrappers, Type Traits, Random Number Generators and Distributions, Tuples, Fixed Size Array, Hash Function Objects, Regular Expressions and Complex Number Additional Algorithms. * Typeof Library: Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt. * Xpressive Library: Regular expressions that can be written as strings or as expression templates, and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler. Updated Libraries * Assign Library: o Support for ptr_map<key,T> via the new function ptr_map_insert() o Support for initialization of Pointer Containers when the containers hold pointers to an abstract base class. * Date_time library: o Support for new US/Canada timezone rules and other bug fixes. See Change History for details. * Filesystem Library: Major upgrade in preparation for submission to the C++ Standards Committee for TR2. Changes include: o Internationalization, provided by class templates basic_path, basic_filesystem_error, basic_directory_iterator and basic_directory_entry. o Simplification of the path interface by eliminating special constructors to identify native formats. o Rationalization of predicate function design, including the addition of several new functions. o Clearer specification by reference to POSIX, the ISO/ IEEE Single Unix Standard, with provisions for Windows and other operating systems. o Preservation of existing user code whenever possible. o More efficient directory iteration. o Addition of a recursive directory iterator. * Function Library: Boost.Function now implements a small buffer optimization, which can drastically improve the performance when copying or constructing Boost.Function objects storing small function objects. For instance, bind(&X:foo, &x, _1, _2) requires no heap allocation when placed into a Boost.Function object. * Functional/Hash Library o Use declarations for standard classes, so that the library doesn't need to include all of their headers o Deprecated the <boost/functional/hash/*.hpp> headers. o Add support for the BOOST_HASH_NO_EXTENSIONS macro, which disables the extensions to TR1 o Minor improvements to the hash functions for floating point numbers. * Graph Library: o edmonds_maximum_cardinality_matching, from Aaron Windsor. o lengauer_tarjan_dominator_tree, from JongSoo Park. o compressed_sparse_row_graph, from Jeremiah Willcock and Douglas Gregor of Indiana University. o sorted_erdos_renyi_iterator, from Jeremiah Willcock of Indiana University. o biconnected_components now supports a visitor and named parameters, from Janusz Piwowarski. o adjacency_matrix now models the Bidirectional Graph concept. o dijkstra_shortest_paths now calls vis.initialize_vertex for each vertex during initialization. o Note: the name of the compiled library for the GraphViz reader has changed to boost_graph (from bgl-viz) to match Boost conventions. o See the complete revision history for more information. * MultiArray Library: Boost.MultiArray now by default provides range-checking for operator[]. Range checking can be disabled by defining the macro BOOST_DISABLE_ASSERTS before including multi_array.hpp. A bug in multi_array::resize() related to storage orders was fixed. * Multi-index Containers Library: o New random access indices. o Non key-based indices feature new rearrange facilities. o This version also includes a number of optimizations and usage improvements. For a complete list of changes, see the library release notes. * Optional Library: o boost::none_t and boost::none now added to Optional's documentation o Relational operators now directly support arguments of type 'T' and 'none_t' o operator->() now also works with reference types. o Helper functions make_optional(val), make_optional (cond,val) and get_optional_value_or(opt,alternative_value) added. o Constructor taking a boolean condition (as well as a value) added. o Member function get_value_or(alternative_value) added. o Incompatbility bug with mpl::apply<> fixed. o Converting assignment bug with uninitialized lvalues fixed. * Parameter Library: o Every ArgumentPack is now a valid MPL Forward Sequence. o Support for unnamed arguments (those whose keyword is deduced from their types) is added. o Support for named and unnamed template arguments is added. o New overload generation macros solve the forwarding problem directly. o See also the Python library changes, below. * Pointer Container Library: o Support for serialization via Boost.Serialization. o Exceptions can be disabled by defining the macro BOOST_PTR_CONTAINER_NO_EXCEPTIONS before including any header. This macro is defined by default if BOOST_NO_EXCEPTIONS is defined. o Additional std::auto_ptr<T> overloads added s.t. one can also pass std::auto_ptr<T> instead of only T* arguments to member functions. o transfer() now has weaker requirements s.t. one can transfer objects from ptr_container<Derived> to ptr_container<Base>, * Python Library: o Boost.Python now automatically appends C++ signatures to docstrings. The new docstring_options.hpp header is available to control the content of docstrings. o stl_input_iterator, for turning a Python iterable object into an STL input iterator, from Eric Niebler. o Support for void* conversions is added. o Integrated support for wrapping C++ functions built with the parameter library; keyword names are automatically known to docsstrings. * Signals Library: More improvements to signal invocation performance from Robert Zeh. * Smart Pointers Library: o Allocator support as proposed in N1851 (162 Kb PDF). o pointer_cast and pointer_to_other utilities to allow pointer-independent code, from Ion Gaztanaga. * String Algorithm Library: o lexicographical_compare o join o New comparison predicates is_less, is_not_greater. o Negative indexes support (like Perl) in various algorihtms (*_head/tail, *_nth). * Wave Library: o Wave now correctly recognizes pp-number tokens as mandated by the C++ Standard, which are converted to C++ tokens right before they are returned from the library. o Several new preprocessing hooks have been added. For a complete description please refer to the related documentation page: The Context Policy. o Shared library (dll) support has been added for the generated Wave libraries. o The overall error handling has been improved. It is now possible to recover and continue after an error or a warning was issued. o Support for optional comment and/or full whitespace preservation in the generated output stream has been added. o The Wave library now performs automatic include guard detection to avoid accessing header files more than once, if appropriate. o Full interactive mode has been added to the Wave tool. Now the Wave tool can be used just like Python or Perl for instance to interactively try out your BOOST_PP macros. Additionally it is now possible to load and save the current state of an interactive session (macro tables et.al.). o The overall performance has been improved by upto 40-60%, depending on the concrete files to process. o Support for new pragmas has been added allowing to control certain library features from inside the preprocessed sources (partial output redirection, control of generated whitespace and #line directives). o Optional support for #pragma message "..." has been added. o This version also includes a number of bug fixes and usage improvements. For a complete list of changes, see the libraries change log. Supported Compilers Boost is tested on a wide range of compilers and platforms. Since Boost libraries rely on modern C++ features not available in all compilers, not all Boost libraries will work with every compiler. The following compilers and platforms have been extensively tested with Boost, although many other compilers and platforms will work as well. For more information, see the regression test results. * Apple GCC 4.0.1 on Mac OS X. * Borland C++ 5.8.2 on Windows. * GNU C++ o 3.2.x., 3.3.x, 3.4.x, 4.0.x, 4.1.x on Linux o 4.1.x on Solaris o 3.4.x on Windows * HP aC++ A.06.14. * Intel C++ 9.1 on Windows, 9.0 on Linux. * Metrowerks CodeWarrior 9.4 on Windows. * Microsoft Visual C++ 6.0 (sp5, with and without STLport), 7.0, 7.1, 8.0. Note: Boost does not support the non-standard "Safe" C++ Library shipping with Visual C++ 8.0, which may result in many spurious warnings from Boost headers and other standards-conforming C++ code. To suppress these warnings, define the macro _SCL_SECURE_NO_DEPRECATE. * Sun Studio 11 on Solaris. Acknowledgements A great number of people contributed their time and expertise to make this release possible. Special thanks go to Vladimir Prus for making Boost.Build version 2 a reality, David Abrahams for authoring a new getting started guide and Greg D. for answering countless questions. -- Thomas Witt witt(a)acm.org

8 10

Build/install problems: BOOST 1_34 using VS.net
by dhruva 07 May '07

07 May '07

Hi, I am building BOOST using VS.net as follows (build goes fine): on the command prompt: cmd>bjam --toolset=msvc cmd>bjam --toolset=msvc --prefix=e:\boost install The installed libraries have "vc" instead of "vc71". The auto_link.hpp tries to link to libraries with "vc71". Is this a known issue? I try to build using the --layout=system as: cmd>bjam --toolset=msvc --layout=system cmd>bjam --toolset=msvc --layout=system install The copied libraries have libname-mt.lib (ex: boost_thread-mt.lib). To link with non-versioned plain libraries, I define BOOST_AUTO_LINK_NOMANGLE in the user.hpp. This tries to link with libname.lib (ex: boost_thread.lib) and that file will not be there. Is there something else I need to do or is it a known problem with this BETA? with best regards, dhruva -- Dhruva Krishnamurthy Contents reflect my personal views only!

5 5

[1.34] autolink doesn't work when not specifying toolset version
by Yuval Ronen 07 May '07

07 May '07

I downloaded 1.34.0 beta, compiled it using bjam --toolset=msvc --without-python stage then wrote a small program that uses Boost.Thread. It didn't link. The linker was looking for libboost_thread-vc80-mt-gd-1_34.lib, but couldn't find it. Rightfully enough, because there was no such file. The bjam command created libboost_thread-vc-mt-gd-1_34.lib - almost the same, just "vc" instead of "vc80". So I ran bjam again, this time with bjam --toolset=msvc-8.0 --without-python stage and then everything worked fine. This can a be a bug either in Boost.Build, or in the autolink feature, or in the documentation (getting_started.html) that suggests that specifying the toolset version is optional, or in my brain... Which is it?

6 9

Comparing boost::function<void()>
by Rennie deGraaf 07 May '07

07 May '07

Hello, Could anyone please tell me why the following code fails to compile: > inline void rmfunc(std::list<boost::function<void()> >& funcs, boost::function<void()> f) > { > for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) > { > if (boost::function_equal(*i, *f)) > i = funcs.erase(i); > } > } while the following does compile: > template <typename T> > inline void rmfunc(std::list<boost::function<void()> >& funcs, const T& f) > { > for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) > { > if (boost::function_equal(*i, f)) > i = funcs.erase(i); > } > } and seemingly equivalent code, placed in-line in the calling function, also compiles? > for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) > { > if (boost::function_equal(*i, boost::ref(bar))) > i = funcs.erase(i); > } The full code for my test program (with the non-compiling function commented out) is attached. My compiler is gcc 4.1.1; I'm using the boost 1.33.1 package from Fedora Core 5. Thanks, Rennie deGraaf #include <list> #include <algorithm> #include <boost/ref.hpp> #include <boost/function.hpp> #include <iostream> struct Foo { void operator()() {} }; /*inline void rmfunc(std::list<boost::function<void()> >& funcs, boost::function<void()> f) { for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) { if (boost::function_equal(*i, f)) i = funcs.erase(i); } }*/ template <typename T> inline void rmfunc(std::list<boost::function<void()> >& funcs, const T& f) { for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) { if (boost::function_equal(*i, f)) i = funcs.erase(i); } } int main() { std::list<boost::function<void()> > funcs; Foo foo; Foo bar; funcs.push_back(boost::ref(foo)); funcs.push_back(boost::ref(bar)); std::cout << funcs.size() << std::endl; // should be 2 rmfunc(funcs, boost::ref(foo)); std::cout << funcs.size() << std::endl; // should be 1 for (std::list<boost::function<void()> >::iterator i=funcs.begin(); i!=funcs.end(); ++i) { if (boost::function_equal(*i, boost::ref(bar))) i = funcs.erase(i); } std::cout << funcs.size() << std::endl; // should be 0 return 0; }

2 2

boost::bind, C++ member function and C callback function
by Li, PingShan (Kansas City) 07 May '07

07 May '07

I have a question related to setting a C++ member function as a callback function for C library's API. I searched the boost mailing list and Google, but I could not find a clear answer. The function I need to call is OpenSSL's CRYPTO_set_id_callback function. It accepts a function pointer as its parameter. The following code works fine: unsigned long IdCallBack( ) { return ( ( unsigned long )GetCurrentThreadId( ) ); } CRYPTO_set_id_callback( (unsigned long (*)())IdCallBack ); I have a C++ class and I want to set the call back function to be the member function of my class, I tried to use boost::bind: class Test { public: Test( unsigned long a ) : m_long( a ) { } virtual ~Test( ) { } unsigned long GetId() { return m_long; } void SetCallBack() { CRYPTO_set_id_callback( boost::bind( &Test::GetId, this ) ); } private: unsigned long m_long; }; I got the following error under VC++ 7.1: error C2664: 'CRYPTO_set_id_callback' : cannot convert parameter 1 from 'boost::_bi::bind_t<R,F,L>' to 'unsigned long (__cdecl *)(void)' with [ R=unsigned long, F=boost::_mfi::mf0<unsigned long,Test>, L=boost::_bi::list1<boost::_bi::list_av_1<Test *>::B1> ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called Is it possible to use boost::bind to bind a C++ member function as a callback function for C interface? Thank you

2 1

[BoostCon07][testing] Session reminder.
by Rene Rivera 07 May '07

07 May '07

Boost Community, The Boost Conference will be here in very short order! And I need to get feedback for the "Testing Boost" sprint we'll be doing <http://boostcon.com/program/sessions#rivera-testing-sprint>. If you have any ideas, concerns, off the wall comments, etc. at *minimum* send them directly to me at "rrivera/acm.org". Why that account? Well because that will be the one account I can guarantee I will access to during the conference, and hence people can send me stuff up to the last minute. Not that I'm encouraging lateness, but I know how busy we all are ;-) If you are going to send it to the Boost dev list you will also want to eventually send me a summary follow up, if needed, from the ensuing discussions. Looking forward to seeing some of you at Aspen! -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

5 10

Example of using a mutex a lock
by Stephen Torri 07 May '07

07 May '07

I am trying to create a class for performing log tracing. While my present program is single threaded as far as my code is concerned this may not always be the case. Below is the code that I am proposing to use. What I am weak on is concurrent programming. I know that I need to use a mutex but I am not sure how to use the boost thread mutex library and locks. Can someone comment on how I can modify the Trace_State class to use locking? Stephen ---------------- #include <boost/cstdint.hpp> #include <boost/shared_ptr.hpp> #include <fstream> #include <boost/date_time/posix_time/posix_time.hpp> #include <sstream> #include <boost/format.hpp> namespace libreverse { namespace trace { /* Idea taken from http://www.codeproject.com/debug/xytrace.asp * (28 Jan 2002 - Xiangyang Liu) * * I have modified this so that we don't use varargs and use constant types */ class TraceLevel { public: static boost::uint32_t TraceNone; // No trace static boost::uint32_t TraceError; // Only trace error static boost::uint32_t TraceInfo; // Some extra information static boost::uint32_t TraceDebug; // Debugging information static boost::uint32_t TraceDetail; // Detailed debugging information }; boost::uint32_t TraceLevel::TraceNone = 0; boost::uint32_t TraceLevel::TraceError = 10; boost::uint32_t TraceLevel::TraceInfo = 20; boost::uint32_t TraceLevel::TraceDebug = 30; boost::uint32_t TraceLevel::TraceDetail = 40; class Trace_State { public: typedef boost::shared_ptr<Trace_State> ptr_t; static Trace_State::ptr_t Instance() { // Lock the resource? if ( m_instance.get() == 0 ) { m_instance = Trace_State::ptr_t ( new Trace_State() ); } // Unlock the resource? return m_instance; } void set_Trace_File_Prefix ( std::string name ) { assert ( ! name.empty() ); // Lock the resource // Close the present file m_file_prefix = name; // Unlock the resource } void set_Trace_Level ( boost::uint32_t level ) { // Lock the resource // Change level m_trace_level = level; // Unlock the resource } void open_Trace_File ( void ) { // Create file name std::stringstream name; // Get current time boost::posix_time::ptime now = boost::posix_time::second_clock::local_time(); std::tm tm_ref = boost::posix_time::to_tm ( now ); boost::gregorian::date today = now.date(); name << boost::format ( "%s_%s_%02d:%02d:%02d.txt" ) % m_file_prefix % boost::gregorian::to_iso_extended_string ( today ) % tm_ref.tm_hour % tm_ref.tm_min % tm_ref.tm_sec; m_log_stream.open ( (name.str()).c_str() ); } void close_Trace_File ( void ) { m_log_stream.close(); } boost::uint32_t get_Trace_Level ( void ) const { boost::uint32_t level = 0; // Lock the resource // get the level level = m_trace_level; // unlock the resource // return the level return level; } void write_Message ( std::string msg ) { // Lock the resource // Write to the file m_log_stream << msg; // Unlock the resource } private: Trace_State() : m_file_prefix ( "Trace" ), m_trace_level ( TraceLevel::TraceNone ) {} static Trace_State::ptr_t m_instance; std::string m_file_prefix; boost::uint32_t m_trace_level; //boost::recursive_mutex m_mutex; std::ofstream m_log_stream; }; Trace_State::ptr_t Trace_State::m_instance; class Trace { public: static void write_Trace ( boost::uint32_t level, std::string message ) { Trace_State::ptr_t state_ptr = Trace_State::Instance(); // If the level is equal to or greater than the present // level we record out message. if ( level >= state_ptr->get_Trace_Level() ) { state_ptr->write_Message ( message ); } } }; } /* namespace trace */ } /* namespace trace */ int main (int, char**) { libreverse::trace::Trace_State::ptr_t state_ptr = libreverse::trace::Trace_State::Instance(); state_ptr->set_Trace_File_Prefix ("Funky"); state_ptr->open_Trace_File(); state_ptr->close_Trace_File(); return 0; }

2 1

[serialization] throwing exceptions in load_construct_data
by Johan Råde 07 May '07

07 May '07

Hi Robert, A long time ago (in the fall of 2005 I think) I reported a bug to you: If you throw an exception in a load_construct_data function (before you have completed the construction of the object) then the serialization library crashes. It calls a destructor on the object that never was constructed. It seems this bug has not been fixed in 1.34 beta. Do you plan to fix this bug? --Johan

2 2

FW: Having trouble including my static library (which uses regex) in my MFC app
by Martin Zeng 07 May '07

07 May '07

Further to this, I have noticed that the linking error only happens when I use: boost::wregex expr(L"[\\s]"); instead of: boost::regex expr("[\\s]"); so now why can't I use the wide regex type in the static library? ________________________________ From: Martin Zeng Sent: Monday, 7 May 2007 2:14 PM To: 'boost-users(a)lists.boost.org' Subject: Having trouble including my static library (which uses regex) in my MFC app Hi guys, I have a static library in which I have included the boost regex header. This static library compiles fine with no errors. But then I want to use this static library in an MFC application I made. I keep getting the following linking error: error LNK2005: "public: static unsigned int __cdecl std::char_traits<unsigned short>::length(unsigned short const *)" (?length@?$char_traits@G@std@@SAIPBG@Z) already defined in msvcprtd.lib(MSVCP71D.dll) What is the problem and how can I solve it? Thanks -- This email is from Civica Pty Limited and it, together with any attachments, is confidential to the intended recipient(s) and the contents may be legally privileged or contain proprietary and private information. It is intended solely for the person to whom it is addressed. If you are not an intended recipient, you may not review, copy or distribute this email. If received in error, please notify the sender and delete the message from your system immediately. Any views or opinions expressed in this email and any files transmitted with it are those of the author only and may not necessarily reflect the views of Civica and do not create any legally binding rights or obligations whatsoever. Unless otherwise pre-agreed by exchange of hard copy documents signed by duly authorised representatives, contracts may not be concluded on behalf of Civica by email. Please note that neither Civica nor the sender accepts any responsibility for any viruses and it is your responsibility to scan the email and the attachments (if any). All email received and sent by Civica may be monitored to protect the business interests of Civica.

1 0

how to link boost libraries
by Marc Glenn 07 May '07

07 May '07

Hello all, I am new to using Boost Libraries... I am wondering how I can indicate that the compiler links the specific boost libraries... For example.. *"gcc -o thread_example thread.cpp -lpthread*" uses -lpthread option which is the posix threads library I can't find the list of the options to link the specific boost libraries. I have scanned the documentation of the libraries but they have not provided any sample on compiling programs using boost libraries. Thanks for the help.. Marc Glenn

2 2

Re: [Boost-users] [BoostCon07][testing] Session reminder.
by David Abrahams 06 May '07

06 May '07

on Thu May 03 2007, "Gennadiy Rozental" <gennadiy.rozental-AT-thomson.com> wrote: > Hi, > > I do plan to attend this session. I've got some ideas on the subject. I > pitched them while ago once. And I still believe that the synchronization is > the root of all evils. The only real solution to break this deadloop is > independent libraries versioning. This should resolve both out release and > testing issues (which are closely connected IMO) > > INDEPENDENT LIBRARY VERTIONING I just want to point out that the BoostCon "Testing Boost" sprint is about our testing processes and infrastructure, not about the structure of Boost itself and its release process. I agree that the latter is an important topic and I hope we'll discuss it at BoostCon, but it's a much tougher issue (to form consensus on, and to solve) than is the topic of the sprint. In order to ensure that the sprint is successful, I strongly request that in Rene's session, we concentrate on the topic at hand. Thank you, -- Dave Abrahams Boost Consulting www.boost-consulting.com Don't Miss BoostCon 2007! ==> http://www.boostcon.com

2 7

serialization of boost::array
by Andreas Willich 06 May '07

06 May '07

I want to serialize a boost::array<unsigned char, 4> to a xml archive, but I did not find the include file of the serialization implementation. Is there a serialization implementation for boost::array at all? I am using RC_1_34. BR Andreas

2 1

Tokenizer reset
by Umut Tabak 06 May '07

06 May '07

Dear all, I am new to boost and tried to use the Tokenizer lib. But I have a problem. When I initialize a tokenizer object in a loop and tokenize that, it is ok on the first iteration. But on the second and subsequent iterations, even if I try to initialize the object with some different string, the object always tokenizes the first initialization. So I see that I have to reset the tokenizer object at each iteration. But I could not understand how to do this from the tokenizer man pages. Here is some code : // define tokenizer and separator typedef boost::tokenizer<boost::char_separator<char> > tokenizer; boost::char_separator<char> sep(" = "); .. . . //initialize and use in a loop while(getline(inFile,readLine)){ //skip empty lines for count operation if(!readLine.empty()){ // each line is tokenized tokenizer tokens(readLine, sep); !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!<====== // tokens are pushed on a vector for (tokenizer::iterator tok_iter = tokens.begin(); tok_iter != tokens.end(); ++tok_iter) lineTokens.push_back(*tok_iter); // lineTokens hold the tokens // check if the configuration file is valid by the count // function of the set if(configVars.count(lineTokens[0])==1){ // means existent so this is valid // assign the read value to the right class data member switch(line_count){ // switch can be extended depending on the configuration file // decide on the line number of the configuration file case 0:// line 1 vlInputFileName=lineTokens[1]; break; case 1:// line 2 vlProjectFileName=lineTokens[1]; break; case 2:// line 3 vlcatvbsFileName=lineTokens[1]; break; case 3:// line 4 vlVbModuleName=lineTokens[1]; break; case 4:// line 5 pathToVLProjectFile=lineTokens[1]; break; // case lines can be added here // ... default: ; break; } } else throw std::runtime_error("The configuration file variable(s) are not valid!"); // clear the line for the next operation readLine.clear(); line_count+=1; // I should reset tokenizer object but I could not do <========================= Reset tokenizer after each iteration Your help is very much appreciated Best regards, Umut

1 0

[patch] compile errors in jam
by Bernhard Fischer 06 May '07

06 May '07

[Please keep me CC'ed on replies] Hi, I got several compile-errors due to implicit decls of some functions in tools/jam/src/* The attached patch makes jam compile for me with gcc trunk. I noticed that building jam with everything -O > 1 produces a binary that segfaults e.g. in rules.c::args_free() for the if clause with gcc-trunk. I did not try to track these segfaults down, fwiw. Please consider applying. TIA and cheers,

2 2

Re: [Boost-users] [regex] ECMAScript support?
by Armel Asselin 05 May '07

05 May '07

"John Maddock" <john(a)johnmaddock.co.uk> a écrit dans le message de news: 016901c78cde$b1fa7cc0$fe500252@fuji... > Armel Asselin wrote: >> So my questions: >> - is boost.regex totally compliant with ECMAScript RE? or at least >> more than >> Perl engine? [1.33.1 vs. 1.34 ?] > > I believe so, if there's anything missing from 1.34 let me know. > >> - did I understand well that I can use iterators and have both UTF8 >> (char*) >> and wchar_t searches in the same executable build? (thanks to their >> template nature?) > > Iterators yes, no problem. As for character types you can use: > > boost::regex with narrow characters, but not really with multibyte > sequences. > > boost::wregex with wchar_t sequences. > > boost::u32regex with any of UTF8, UTF16 or UTF32 sequences (they all get > converted to 32-bit code points on the fly), but you will need ICU to > provide the Unicode character database. See > http://www.boost.org/libs/regex/doc/icu_strings.html for the docs. > > HTH, John. ok so i'll try the 1.34, any idea of the size of the binary (.lib/.a) for that feature (just the necessary part of ICU+boost::regex?). i'd be really happy if it could take a few dozen KB :-) Armel

2 2

[boost][math toolkit] Review results
by Matthias Schabel 05 May '07

05 May '07

I'd like to congratulate John Maddock, Paul Bristow, and their contributors on putting together an outstanding submission to Boost. It is rare to have complete unanimity among votes, but in this case there were no dissenters to accepting either the special functions or the statistical distributions portions of the library, so I'm glad to announce that it has been accepted for inclusion in Boost. Thanks to the many participants in the review : Gottlob Frege, Guillaume Melquiond, Johan Råde, Arnaldur Gylfason, John Phillips, Mark Van De Vyver, Stephan Tolksdorf, Hubert Holin, Seweryn Habdank-Wojewodski, Kevin Lynch, Leonaldo Peralta, Jeff Garland, and Stefan Seefeld (apologies for anyone I might have missed in this list). Here is a brief summary of the relatively few major issues that were raised during the course of the review : 1) Error handling is an issue that arises because this library is at the frontier between traditional numerical libraries and a (hopefully) new breed of such libraries that utilize modern programming techniques and facilities. Jeff Garland suggested that the default behavior should be to throw an exception, with errno being an option enabled by macro. It would also be nice to have more granular control over which instances throw exceptions and which do not (so, for example, a user could choose to ignore denormals). It was also suggested that additional, more transparent exceptions be provided for cases such as failure to converge rather than reusing tools::logic_error. 2) Jeff Garland also pointed out, rightly in my opinion, that attempts to use statistical functions that do not exist for a distribution should fail to compile rather than leading to a runtime error (e.g. mean of a Cauchy distribution). A reasonable method of implementing this should be devised or a strong argument for why it is not feasible/desirable provided. 3) Arnaldur Gylfason did some nice accuracy and performance testing vs. R. It was noted that the performance of quantile functions in this library was significantly worse than R, unlike non-quantile functions. He also pointed out that, for discrete distributions, the current behavior of returning fractional results for quantiles may not be the expected one. These issues should be addressed and documented. 4) Hubert Holin suggested the possibility of use of a policy parameter to choose between speed and accuracy. Another interesting possibility would be to allow the user to specify the desired precision either at compile or runtime. 5) It appears that this library will actually become two "sublibraries" within the Boost.Math library. Currently all code lives in the boost::math namespace; I would like to at least see a discussion of the possibility of having boost::math::special_functions, boost::math::statistics, and, perhaps, boost::math::statistics::distributions namespaces - as more functionality gets added to boost::math, collisions will become more likely, so some thought given now to logical partitioning may save pain later. During the review a number of typos and minor issues of documentation were raised, which the authors will need to address if they haven't already. In particular, John Phillips noted that the rationale behind using rational (vs. polynomial) approximations be clarified, the derivation of coefficients be documented, and the list of special functions in the documentation be expanded to encompass all functions actually implemented in the library. Stephan Tolksdorf requested a table listing standard statistical tests and the corresponding library implementations and enumerated a number of other documentation issues. Overall, the library was very well received, and the authors are to be commended on the tremendous amount of care and effort devoted to its preparation. Matthias Schabel Review Manager

2 1

[build] how to add a define
by Yuval Ronen 05 May '07

05 May '07

In BBv1 I could call bjam "-sBUILD=<define>_CRT_SECURE_NO_DEPRECATE <define>_SCL_SECURE_NO_DEPRECATE" to add those defines to the build. How can I do it in v2? Thanks.

1 0

Re: [Boost-users] [BoostCon07][testing] Session reminder.
by Gennadiy Rozental 05 May '07

05 May '07

"Robert Ramey" <ramey(a)rrsd.com> wrote in message news:f1gnvf$bv8$1@sea.gmane.org... > Gennadiy Rozental wrote: >> "Robert Ramey" <ramey(a)rrsd.com> wrote in message >> This doesn't address neither testing against new version of your >> library by developers of other libraies > > Sure it does - they can either test against the HEAD as they do now > or they update their local installation Who is going to do this? Regression testers? >> nor dealing with testing >> agains updates of component your library depends on. > > This amounts to using the tests for one library as tests of the > dependent library. There are two problems with this. First > its very inefficient and arbitrary as the tests in my library aren't > presume that the rest of boost works so they aren't designed > to test the rest of boost. And if an error occurs then it has to > be determined which of the components, libraries, build > system, etc which are simultaneously changing is the cause > of the failure. This wastes huge amount of time. > > That being said. If the rest of boost things that the serialization > library is a good way test the other libraries - fine with me. Its > not an issue for me at all. I am not sure how your reply relates to my comment. What I meant is: How can YOU test that your library works with the next version of let's say Boost.Test I am planning to include into next release. Let's say I do my development in branch new_dev. How could you test your lib against this branch, but allow all other libraries still to be tested against HEAD? >>Formalization of >> independent versioning should allow us deal with it. > > I think boost as a concept has to change from tightly > coupled group of "standard" libraries to a loosely > coupled group of "interoperable" libraries. At its core > I think this is the issue. Good news is that its not something > that we have to agree upon. Its happening now as it > must as boost get beyond the scale where it can be > digested as a whole. This comment I completely agree with. I just porpose how add some formalization to this process. > Robert Ramey

1 0

[gil] channel_convert question
by Christian Henning 05 May '07

05 May '07

Hi there, what's the difference between the following two lines? float red_1 = channel_convert< bits32f >( 1.f ); float red_2 = channel_convert< bits32f >( (bits32f) 1.f ); The first gives me garbage whereas the second gives the correct result. Regards, Christian

1 1

[gil][bind] How to bind gil::at_c ?
by Christian Henning 05 May '07

05 May '07

Hi there my compiler doesn't like binding the gil::at_c function. I'm using MSVC 7.1 SP1. Please correct if I'm wrong but I think you need to supply a function pointer cast for overloaded function when using this compiler. But for some reasons I cannot make it happen. template < typename CHANNEL > void set_zero( CHANNEL c ) { c = 0; } int main() { rgb8_image_t src; bmp_read_image( ".\\flower.bmp", src ); typedef channel_type<rgb8_pixel_t>::type return_t; add_reference<return_t>::type (*AA)( rgb8_pixel_t& ) = &gil::at_c<0>; for_each( view( src ).begin() , view( src ).end() , bind( &set_zero, bind( AA, _1 ))); return 0; } compiler error is: \gil\repos\gil_2\libs\gil\toolbox\test.cpp(74) : error C2440: 'initializing' : cannot convert from 'overloaded-function' to 'boost::add_reference<T>::type (__cdecl *)(boost::gil::rgb8_pixel_t &)' with [ T=boost::gil::bits8 ] None of the functions with this name in scope match the target type Thanks ahead, Christian

1 1

Re: [Boost-users] [BoostCon07][testing] Session reminder.
by David Abrahams 04 May '07

04 May '07

on Fri May 04 2007, Stefan Seefeld <seefeld-AT-sympatico.ca> wrote: > David Abrahams wrote: > >> Okay, here are some issues I think ought to be solved, in no >> particular order, some (much) more important than others: > > David, > > I'm happy to see you bring up much the same points I mentioned. > Here is one I haven't yet got to, and would like to explore a bit > further: > >> * generating XML by parsing the jam log is fragile and prevents the >> use of multiple build processes (-jN). This one should be almost >> embarassingly easy to fix. > > I think there is more to this than only the ability to run tests in > parallel. For example, it would help to robustify the testing > harness if the 'test database' could be inspected without actually > executing any test. By that I mean the ability to: > > * See all tests, as part of the test database structure (i.e. their > organization into test suites) > > * See meta data associated with tests, such as > > - what kind of test > - expected outcome, per platform > - dependencies, prerequisites, etc. How would that help with robustness? -- Dave Abrahams Boost Consulting www.boost-consulting.com Don't Miss BoostCon 2007! ==> http://www.boostcon.com

1 0

Boost serialization w/gcc 3.2.3 on CentOS 4.4?
by matthew.garman＠gmail.com 04 May '07

04 May '07

We've got an in-house infrastructure that uses the boost::serialization library (from boost 1.33). Thus far, all our development has been done using gcc 3.4.5 and 3.4.6 on CentOS 4.3 and 4.4 (respectively). (Note that CentOS is practically the same as Red Hat Enterprise Linux.) Now we are forced to integrate with a 3rd party proprietary library that was built with gcc 3.2. So I installed the gcc32 package: % gcc32 --version gcc32 (GCC) 3.2.3 20030502 (Red Hat Linux 3.2.3-47.3) Copyright (C) 2002 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. If I build my program with gcc 3.2 and link against boost built with gcc 3.4, my program segfaults as soon as the first boot::serialization method is called. So I tried to rebuild boost using gcc 3.2. I did this by running the configure script, then modifying the "BJAM_CONFIG" variable of the top-level Makefile: BJAM_CONFIG= -sPYTHON_ROOT=/usr -sPYTHON_VERSION=2.3 \ -sGXX=g++32 -sGCC=gcc32 Then I ran make. First thing I noticed is that there were a *lot* of warnings, although the library did build. Same thing when building my own program: lots of warnings surrounding the boost stuff, but it does build. Also, when linking, I get this warning: /usr/bin/ld: warning: libstdc++.so.6, needed by /usr/local/lib/libboost_serialization-gcc.so, may conflict with libstdc++.so.5 Unfortunately, the program still crashes when it gets to the boost::serialization stuff. I looked at the Boost compatibility matrix, and as far as I can tell, gcc 3.2 is supported (though I definitely could have misread something!). So my hunch is that I've got a problem with my build process... but I'm not sure where. I know I've left out some details; please let me know what other info I need to provide. Suggestions or general "things to try" are welcome as well! Thanks, Matt

5 12

xml serialization : compilation fails
by Cyril 04 May '07

04 May '07

Hello all, I have a problem while attempting to serialize a simple object using xml (text works fine !). This is my code : // SomeData.h #include <boost/serialization/utility.hpp> #include <boost/serialization/base_object.hpp> class OBJECTS_API InternalData { public: InternalData(); virtual ~InternalData(); virtual int getInternals() const = 0; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { } }; class OBJECTS_API RealData : public InternalData { public: RealData(int internals=0); int getInternals() const; private: int _internals; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(InternalData) & BOOST_SERIALIZATION_NVP(_internals); } }; class OBJECTS_API SomeData { public: SomeData(int internals=0); ~SomeData(); InternalData* getInternals() const; private: InternalData* _data; static InternalData* createData(int internals); friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { //ar.register_type(static_cast<RealData*>(0)); ar & BOOST_SERIALIZATION_NVP(_data); } }; ////////////////// // somewhere else const SomeData data(4); boost::archive::xml_oarchive xoa(archive); //archive is a file stream xoa << data; //////////////////// This fails to compile because : // basic_xml_oarchive.hpp // Anything not an attribute and not a name-value pair is an // error and should be trapped here. template<class T> void save_override(T & t, BOOST_PFTO int) { // If your program fails to compile here, its most likely due to // not specifying an nvp wrapper around the variable to // be serialized. BOOST_STATIC_ASSERT(0 == sizeof(T)); } I can't see why my code isn't correct according to that constraint. Any help ? Thanks in advance.

2 4

spirit and gcc-3.3 and 64 bit
by Jörg Becker 04 May '07

04 May '07

Hi there, I have a problem compiling the following parser with gcc-3.3 in a 64 bit environment: the compiler consumes a lot of cpu time, but never returns. On my old 32 bit box I could compile a similar parser without problems. Also I can compile this parser with gcc-3.3 -m32. With gcc-4.1 I can build a 64 bit version but due to company restrictions I have to use the gcc-3.3. Thanks for any suggestions. Jörg ----------------------- parser definition my_parser.h ----------------------- #ifndef my_parser_h #define my_parser_h #include <boost/spirit/core.hpp> #include <boost/spirit/attribute.hpp> // closure struct my_closure : boost::spirit::closure< my_closure, bool > { member1 match; }; struct my_parser : public boost::spirit::grammar < my_parser, my_closure::context_t > { my_parser () {} template <typename ScannerT> struct definition { definition ( my_parser const& self ) { top = boost::spirit::str_p( "a" )[ self.match = phoenix::arg1 ]; } typedef boost::spirit::rule< ScannerT, my_closure::context_t > rule_t; boost::spirit::rule< ScannerT > top; boost::spirit::rule< ScannerT > const& start () const { return top; } }; }; #endif // my_parser_h ------------------ test program ------------------ #include "my_parser.h" int main () { my_parser parser; bool match = false; boost::spirit::parse_info<> info = parse( "a and b or c", parser[ phoenix::var( match ) = phoenix::arg1 ], boost::spirit::space_p ); if ( info.full ) { return match; } else { return -1; } }

1 0

Re: [Boost-users] [Serialisation] One last GUID question - I hope.
by Pavlo Korzhyk 04 May '07

04 May '07

.... > "The macro BOOST_CLASS_EXPORT_GUID associates a string literal with a > class. In the above example we've used a string rendering of the class > name. If a object of such an "exported" class is serialized through a > pointer and is otherwise unregistered, the "export" string is included > in the archive. When the archive is later read, the string literal is > used to find the class which should be created by the serialization > library. ****This permits each class to be in a separate header file > along with its string identifier****. There is no need to maintain a .... > Is the document misleading here, or have I missed something?? It says that the class declaration may be placed in a separate header, but that doesn't mean BOOST_CLASS_EXPORT_GUID must be placed to that header too :) When you create a separate header for the class, usually you also create a separate .cpp for it. Place BOOST_CLASS_EXPORT there and everything will work fine. WBR, Pavlo Korzhyk ICQ#155870780

2 1

[fusion][bind] How to bind a fusion sequence?
by Christian Henning 03 May '07

03 May '07

Hi there, I have a problem ( compilation error ) using a fusion map with boost bind. Not sure if that is the intended usage. So, please show some mercy when I'm doing something totally stupid. Basically, I have a std::vector of a fusion::map instances. And I would like to find a fusion::map instance with a special value. Here is the code: #include <vector> #include <algorithm> #include <functional> #include <boost/bind.hpp> #include <boost/fusion/algorithm.hpp> #include <boost/fusion/sequence.hpp> #include <boost/fusion/iterator.hpp> using namespace std; using namespace boost; namespace fields { struct _id_; struct _name_; struct _birthday_; struct _address_id_; } typedef fusion::map< fusion::pair< fields::_id_ , string > , fusion::pair< fields::_name_ , string > , fusion::pair< fields::_birthday_ , string > , fusion::pair< fields::_address_id_, string > > table_type; int main() { table_type table; vector< table_type > vec; find_if( vec.begin() , vec.end() , bind( equal_to< string >() , bind( &fusion::at_key< fields::_id_ >, _1 ) , string( "Hallo" ))); return 0; } Does that makes sense? If yes, how would I do it? I'm using MSVC 7.1 and the first couple of compiler errors are: Compiling... test.cpp test.cpp(43) : error C2783: 'result_of::at_key<const Sequence,Key>::type boost::fusion::at_key(const Sequence &)' : could not deduce template argument for 'Sequence' c:\boost\boost\fusion\sequence\intrinsic\at_key.hpp(50) : see declaration of 'boost::fusion::at_key' test.cpp(43) : error C2783: 'lazy_disable_if<boost::is_const<Sequence>,boost::fusion::result_of::at_key<Sequence,Key>>::type boost::fusion::at_key(Sequence &)' : could not deduce template argument for 'Sequence' c:\boost\boost\fusion\sequence\intrinsic\at_key.hpp(43) : see declaration of 'boost::fusion::at_key' test.cpp(43) : error C2784: 'boost::_bi::bind_t<R,boost::_mfi::dm<R,T>,_bi::list_av_1<A1>::type> boost::bind(R T::* ,A1)' : could not deduce template argument for 'overloaded function type' from 'overloaded function type' c:\boost\boost\bind.hpp(1616) : see declaration of 'boost::bind' [snip] Thanks for your patients, Christian

2 3

Re: [Boost-users] [BoostCon07][testing] Session reminder.
by Anthony Williams 03 May '07

03 May '07

"Gennadiy Rozental" <gennadiy.rozental(a)thomson.com> writes: [snipped lots of sensible stuff] > VI Boost release > > The boost release is done automatically every predefined period of time > (like three month). It requires NO testing, NO branching and NO > merging/reverting. It's done by single script (a bit oversimplification, but > close) that does these tasks: > > 1. It iterates through all components and check any component that was > released since previous boost release. > Very important: The component should NOT depend on older version of > component that is being released. For example if library A depends on > version 1.23 of library B and version 1.24 of library B was released, > library A won't become part of the next boost release. Here I don't understand. Suppose Boost release X contains library A version 1.4, and library B version 1.23, and library A depends on library B. The developer of library B then releases a new version (1.24), and the author of library A doesn't. The next Boost release (Y) comes along, and now library A is no longer part of the Boost release? That strikes me as a bad plan --- the contents of Boost will vary from release to release as developers update their libraries at different rates. As an alternative, how about this: if library A depends on version xyz of library B, then library B is pinned at version xyz for Boost releases until library A is updated. If library A is not updated for n consecutive Boost releases, library A is dropped from Boost as unmaintained. How about this, also: a library developer can only release their library if it is built against the latest released version of all its dependent libraries. That way if a core library is updated, all other libraries will have to use the new version before they can release. Anthony -- Anthony Williams Just Software Solutions Ltd - http://www.justsoftwaresolutions.co.uk Registered in England, Company Number 5478976. Registered Office: 15 Carrallack Mews, St Just, Cornwall, TR19 7UL

1 0

Boost Sandbox has moved to Subversion
by Doug Gregor 03 May '07

03 May '07

The Boost Sandbox has now moved from Sourceforge CVS to Subversion hosted at OSL. The Boost Sandbox CVS at Sourceforge is now closed and should no longer be used. The Subversion URL for the Sandbox is: http://svn.boost.org/svn/boost/sandbox/ For anyone requiring write access to the sandbox, please read http:// svn.boost.org/trac/boost/wiki/BoostSubversion and follow the directions there. The Subversion URL for read/write access to the sandbox is: https://svn.boost.org/svn/boost/sandbox/ More information about the Boost Subversion repository is available at http://svn.boost.org - Doug

1 0

[Serialisation] One last GUID question - I hope.
by Hughes, James 03 May '07

03 May '07

It appears that when I put BOOST_CLASS_EXPORT_GUID in class header files, sometimes I get a Multiple definition error for the instance of the guid_initializer, if the header file is included more than once in various bits of code. If the GUID is place in the cpp file there are no problems. I can see why this happens, but the docs appear to imply I should be able to put the definition in the header files, this paragraph below (http://www.boost.org/libs/serialization/doc/serialization.html#pointero perators) "The macro BOOST_CLASS_EXPORT_GUID associates a string literal with a class. In the above example we've used a string rendering of the class name. If a object of such an "exported" class is serialized through a pointer and is otherwise unregistered, the "export" string is included in the archive. When the archive is later read, the string literal is used to find the class which should be created by the serialization library. ****This permits each class to be in a separate header file along with its string identifier****. There is no need to maintain a separate "pre-registration" of derived classes that might be serialized. This method of registration is referred to as "key export". More information on this topic is found in the section Class Traits - Export Key." Is the document misleading here, or have I missed something?? James 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

Regex failure when matching with a POSIX extended regexp
by Roger Leigh 03 May '07

03 May '07

Hi folks, The following code demonstrates the problem I'm having. I'm using Boost 1.33.1 (Debian), but IIRC this worked last year with the same version because I tested it; possibly a Debian-specific regression? I expect both regular expressions here to match with the value string. They certainly to with egrep. However, I only get the second to match: % g++ -c regex.cc -o regex.o && g++ -o regex regex.o -lboost_regex % ./regex It didn't match the first It matched the second Am I correct in my expectation that expression1 will match? If not, what should I be doing to make it match? Many thanks, Roger -- .''`. Roger Leigh : :' : Debian GNU/Linux http://people.debian.org/~rleigh/ `. `' Printing on GNU/Linux? http://gutenprint.sourceforge.net/ `- GPG Public Key: 0x25BFB848 Please GPG sign your mail.

3 5

[Serialisation] Question on shared_ptr's and base/derived classes
by Hughes, James 03 May '07

03 May '07

Hi All, I am trying to serialise a vector of shared_ptr's which point to a base class which may be one of a number of derived class (Not polymorphic in that the base class has no virtual functions - its just supplies base functionality to derived classes) In very pseudo code Class A Class B : public A Class C : public A vector<shared_ptr<A> > list; list.insert(shared_ptr<A> (new B)); list.insert(shared_ptr<A> (new C)); In serialise Ar & boost::serialization::make_nvp("ListofStuff", list); Reading the documentation, I believe this should work, but I am getting a bus error on our embedded system when it tries to serialise the vector (all the other bits have serialised ok which implies it's all compiled OK) - it managed "<px" into the XML archive then failed (see below for file). Bus error can mean a number of things on our board, but usually an alignment problem. Anyone any idea where I should look to sort this out? XML output (starts to serialise pointer on last line): <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <temp class_id="0" tracking_level="0" version="0"> <Name>Message1</Name> <Filename class_id="1" tracking_level="0" version="0"> <path>/home/jhughes/msg.xml</path> </Filename> <Panels class_id="2" tracking_level="0" version="0"> <count>1</count> <item class_id="3" tracking_level="0" version="1"> <px</boost_serialization> James 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.

4 6

[serialisation] XML Archives and BOOST_CLASS_EXPORT_GUID
by Hughes, James 03 May '07

03 May '07

Hello all, This is a corollary to my recent question on serialisation of shred_ptrs and polymorphic classes - I noted it in that thread but it may be lost in the debris. In an effort to get them to work, I have put in a BOOST_CLASS_EXPORT_GUID in my base and derived classes. However, this brings up a compilation error... >>whole load of template faults then... (see below for full error list) ../boost_1_33_1/boost/archive/basic_xml_archive.hpp:66: error : incomplete type 'boost::STATIC_ASSERTION_FAILURE< false>' used in nested name specifier ../boost_1_33_1/boost/archive/basic_xml_archive.hpp:66: error : size of array has non-integral type '<type error>' Now looking at the code where the final error occurs, it says this is usually down to an unspecified NVP - i.e. a serialisation of a data item not in an nvp statements. However, all the classes involved do have this correctly set up. I have one question on it though.. Should I do this in my derived class to include the base class serialisation ar & base_object<A>(*this) Or should I do this ar & base_object<A>(make_nvp("base", *this) ) Both give the same compile error Or is there simply a problem with BOOST_CLASS_EXPORT_GUID that means that it is emitting something that needs nvp wrapping but this isn't being done? James Complete compile error dump for masochists iwmmxt_le-g++ -c -o TextPanel.o TextPanel.cpp -O0 -Iinclude -I../Renderer/include -I../GI/include -I../boost_1_33_1 -I../common/include -fPIC ../boost_1_33_1/boost/archive/basic_xml_oarchive.hpp: In member function `void boost::archive::basic_xml_oarchive<Archive>::save_override(T&, int) [with T = const LCPanel, Archive = boost::archive::xml_oarchive]': ../boost_1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from `Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = const LCPanel, Archive = boost::archive::xml_oarchive]' ../boost_1_33_1/boost/archive/detail/interface_oarchive.hpp:86: instantiated from `Archive& boost::archive::detail::interface_oarchive<Archive>::operator&(T&) [with T = LCPanel, Archive = boost::archive::xml_oarchive]' include/TextPanel.hpp:115: instantiated from `void LCTextPanel::serialize(Archive&, unsigned int) [with Archive = boost::archive::xml_oarchive]' ../boost_1_33_1/boost/serialization/access.hpp:109: instantiated from `static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/serialization.hpp:81: instantiated from `void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/serialization.hpp:140: instantiated from `void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/archive/detail/oserializer.hpp:233: instantiated from `boost::archive::detail::pointer_oserializer<T, Archive>::pointer_oserializer() [with T = LCTextPanel, Archive = boost::archive::xml_oarchive]' ../boost_1_33_1/boost/archive/detail/oserializer.hpp:198: instantiated from `const boost::archive::detail::pointer_oserializer<LCTextPanel, boost::archive::xml_oarchive> boost::archive::detail::pointer_oserializer<LCTextPanel, boost::archive::xml_oarchive>::instance' ../boost_1_33_1/boost/archive/detail/oserializer.hpp:190: instantiated from `static const boost::archive::detail::pointer_oserializer<T, Archive>& boost::archive::detail::pointer_oserializer<T, Archive>::instantiate() [with T = LCTextPanel, Archive = boost::archive::xml_oarchive]' ../boost_1_33_1/boost/archive/detail/oserializer.hpp:515: instantiated from `const boost::archive::detail::basic_pointer_oserializer& boost::archive::detail::instantiate_pointer_oserializer(Archive*, T*) [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:83: instantiated from `static void boost::archive::detail::export_impl::archive<Archive, T>::o::invoke() [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:105: instantiated from `static void boost::archive::detail::export_impl::archive<Archive, T>::instantiate() [with Archive = boost::archive::xml_oarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:116: instantiated from `static void boost::archive::detail::export_impl::for_each_archive<ASeq, T>::instantiate() [with ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:132: instantiated from `boost::archive::detail::export_generator<T, ASeq>::export_generator() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:139: instantiated from `const boost::archive::detail::export_generator<LCTextPanel, boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive> > boost::archive::detail::export_generator<LCTextPanel, boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive> >::instance' ../boost_1_33_1/boost/serialization/export.hpp:177: instantiated from `static const boost::archive::detail::export_generator<T, ASeq>* boost::archive::detail::export_instance<T, ASeq>::not_abstract::invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:191: instantiated from `std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_instance_invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:211: instantiated from `static std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_archives<T, ASeq>::non_empty_archive_list::invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:225: instantiated from `std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_archives_invoke(T&, ASeq&) [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' include/TextPanel.hpp:124: instantiated from here ../boost_1_33_1/boost/archive/basic_xml_oarchive.hpp:86: error: incomplete type `boost::STATIC_ASSERTION_FAILURE< false>' used in nested name specifier ../boost_1_33_1/boost/archive/basic_xml_oarchive.hpp:86: error: size of array has non-integral type `<type error>' ../boost_1_33_1/boost/archive/basic_xml_iarchive.hpp: In member function `void boost::archive::basic_xml_iarchive<Archive>::load_override(T&, int) [with T = LCPanel, Archive = boost::archive::xml_iarchive]': ../boost_1_33_1/boost/archive/xml_iarchive.hpp:74: instantiated from `void boost::archive::xml_iarchive_impl<Archive>::load_override(T&, int) [with T = LCPanel, Archive = boost::archive::xml_iarchive]' ../boost_1_33_1/boost/archive/detail/interface_iarchive.hpp:76: instantiated from `Archive& boost::archive::detail::interface_iarchive<Archive>::operator>>(T&) [with T = LCPanel, Archive = boost::archive::xml_iarchive]' ../boost_1_33_1/boost/archive/detail/interface_iarchive.hpp:83: instantiated from `Archive& boost::archive::detail::interface_iarchive<Archive>::operator&(T&) [with T = LCPanel, Archive = boost::archive::xml_iarchive]' include/TextPanel.hpp:115: instantiated from `void LCTextPanel::serialize(Archive&, unsigned int) [with Archive = boost::archive::xml_iarchive]' ../boost_1_33_1/boost/serialization/access.hpp:109: instantiated from `static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/serialization.hpp:81: instantiated from `void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/serialization.hpp:140: instantiated from `void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/archive/detail/iserializer.hpp:339: instantiated from `boost::archive::detail::pointer_iserializer<T, Archive>::pointer_iserializer() [with T = LCTextPanel, Archive = boost::archive::xml_iarchive]' ../boost_1_33_1/boost/archive/detail/iserializer.hpp:211: instantiated from `const boost::archive::detail::pointer_iserializer<LCTextPanel, boost::archive::xml_iarchive> boost::archive::detail::pointer_iserializer<LCTextPanel, boost::archive::xml_iarchive>::instance' ../boost_1_33_1/boost/archive/detail/iserializer.hpp:203: instantiated from `static const boost::archive::detail::pointer_iserializer<T, Archive>& boost::archive::detail::pointer_iserializer<T, Archive>::instantiate() [with T = LCTextPanel, Archive = boost::archive::xml_iarchive]' ../boost_1_33_1/boost/archive/detail/iserializer.hpp:546: instantiated from `const boost::archive::detail::basic_pointer_iserializer& boost::archive::detail::instantiate_pointer_iserializer(Archive*, T*) [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:75: instantiated from `static void boost::archive::detail::export_impl::archive<Archive, T>::i::invoke() [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:105: instantiated from `static void boost::archive::detail::export_impl::archive<Archive, T>::instantiate() [with Archive = boost::archive::xml_iarchive, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:116: instantiated from `static void boost::archive::detail::export_impl::for_each_archive<ASeq, T>::instantiate() [with ASeq = boost::mpl::list1<boost::archive::xml_iarchive>, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:122: instantiated from `static void boost::archive::detail::export_impl::for_each_archive<ASeq, T>::instantiate() [with ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>, T = LCTextPanel]' ../boost_1_33_1/boost/serialization/export.hpp:132: instantiated from `boost::archive::detail::export_generator<T, ASeq>::export_generator() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:139: instantiated from `const boost::archive::detail::export_generator<LCTextPanel, boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive> > boost::archive::detail::export_generator<LCTextPanel, boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive> >::instance' ../boost_1_33_1/boost/serialization/export.hpp:177: instantiated from `static const boost::archive::detail::export_generator<T, ASeq>* boost::archive::detail::export_instance<T, ASeq>::not_abstract::invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:191: instantiated from `std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_instance_invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:211: instantiated from `static std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_archives<T, ASeq>::non_empty_archive_list::invoke() [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' ../boost_1_33_1/boost/serialization/export.hpp:225: instantiated from `std::pair<const boost::archive::detail::export_generator<T, ASeq>*, const boost::archive::detail::guid_initializer<T>*> boost::archive::detail::export_archives_invoke(T&, ASeq&) [with T = LCTextPanel, ASeq = boost::mpl::list2<boost::archive::xml_oarchive, boost::archive::xml_iarchive>]' include/TextPanel.hpp:124: instantiated from here ../boost_1_33_1/boost/archive/basic_xml_iarchive.hpp:66: error: incomplete type `boost::STATIC_ASSERTION_FAILURE< false>' used in nested name specifier ../boost_1_33_1/boost/archive/basic_xml_iarchive.hpp:66: error: size of array has non-integral type `<type error>' 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.

2 2

Re: [Boost-users] [Probability] interest in probability/likelihood library
by Thorsten Ottosen 03 May '07

03 May '07

Brook Milligan skrev: > This note is to announce the release of a library for handling > probability and likelihood quantities, together with their logarithms, > in a consistent and (when desired) transparent manner. > If a native floating point type is used for probabilities and > likelihoods, You should probably define those terms in the documentation. > The purpose of this library is to encapsulate both probability and > likelihood quantities within an appropriate set of types, while > simultaneously achieving the following design goals. > - Incur no runtime cost. That is, all type manipulations should be > performed at compile time. That does not strike me as quite the same. > - Ensure that the layout of arrays and structures of probability and > likelihood quantities is identical to the corresponding layout for > the underlying value type. Good. But It still needs to be testet if the performance equals that of normal arrays or matrices of floats. > Thanks for your input. I hope this library is close to Boost > standards and can be improved to the point of being a worthwhile > inclusion within the set of libraries. It seems like a good start. I can only say, that if the runtime performance cost is zero, then I would find the library very interesting, and I would not hessitate to use it in my work on Bayesian Networks. best regards -Thorsten

1 0

Reminder: Sandbox CVS going DOWN tomorrow
by Doug Gregor 02 May '07

02 May '07

In about 13 hours, the Boost Sandbox CVS will be going offline for the conversion to Subversion. If you have any outstanding changes, please commit them to the sandbox CVS *immediately*. - Doug

1 0

Echoing commands in bjam v2
by Richard Hadsell 02 May '07

02 May '07

I'm building the Boost 1.34.0 beta libraries with g++ on Linux, and I want to see the actual command that bjam uses to compile source files. How can I make it echo the command line? -- Dick Hadsell 914-259-6320 Fax: 914-259-6499 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studios http://www.blueskystudios.com 44 South Broadway, White Plains, NY 10601

3 5

[regex] ECMAScript support?
by Armel Asselin 02 May '07

02 May '07

[sorry if this mail comes twice, I think my first mail was eaten...] Hello, from what I read it seems that boost.regex supports ECMAScript style regular expression. I already use a RE engine (that of Perl built inside wxWidgets), but i'm not really happy with it because it is not ECMA compliant and prevents me from searching in both UTF8 and wchar_t strings and it does not have iterator oriented searches. So my questions: - is boost.regex totally compliant with ECMAScript RE? or at least more than Perl engine? [1.33.1 vs. 1.34 ?] - did I understand well that I can use iterators and have both UTF8 (char*) and wchar_t searches in the same executable build? (thanks to their template nature?) Best regards Armel

2 1

Re: [Boost-users] [serialisation] XML Archives and BOOST_CLASS_EXPORT_GUID
by Pavlo Korzhyk 02 May '07

02 May '07

> Should I do this in my derived class to include the base class > serialisation > > ar & base_object<A>(*this) > > Or should I do this > > ar & base_object<A>(make_nvp("base", *this) ) > > Both give the same compile error I use ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(DBObject); where DBObject is the name of the base class. Does this suit your needs? WBR, Pavlo Korzhyk ICQ#155870780

1 0

Use of Boost C++ Libraries - Academic Environment
by Deisch, Deanna 02 May '07

02 May '07

Good Morning, Does the Boost license cover installation on multiple stations in a Computer Lab for Academic use? Thank you for any assistance I you can provide.

3 2

[1.33.1][test][vc80] new user question concerning 1_33_1\libs\test\doc\examples\unit_test_example1.html & unit_test_example1.cpp/
by John McMahon 02 May '07

02 May '07

Hi, I've built and run this with libboost_unit_test_framework-vc80-mt-gd-1_33_1.lib in my Linker->Input->Additional Dependencies. The single test looks like this: void free_test_function() { // reports 'error in "free_test_function": test 2 == 1 failed' BOOST_CHECK(2 == 1); // non-critical test => continue after failure int* p = (int*)0; *p = 0; } When I run it, I see the falied message (2!=1), but I don't get the final 'No errors found' message since '*p=0' causes an unhandlled exception. But when I run it with #include <boost/test/included/unit_test_framework.hpp> and no library instead, it runs to completion as expected. Any idea what I'm doing wrong. thanks in advance, John McMahon

3 9

BGL python bindings: write_graphviz never returns
by John Reid 02 May '07

02 May '07

Hi, I've recently run into a problem where I build a boost.graph in python and then call write_graphviz() which never returns. I haven't managed to generate a reproducible test case yet. All I can say is that the problem disappears if I remove all the edge and vertex properties. Has any one seen anything like this before? When I manage to make a small test case I shall post it. Best, John.

1 0

[serialisation] Yet another problem with non default constructors
by Loïc Joly 02 May '07

02 May '07

I know from the doc that the way to deal with non default constuctors for deserialization is the load_construct_data function. However, I'm in a case where the parameters of the non default constructor are not serializable, but can be provided at runtime. How can I pass those values to load_construct_data ? One example to be clearer: class Data { public: Data(Mutex &m) : myMutex (m) {} private: friend class boost::serialization::access; Mutex &myMutex; // Mutex is intrinsically a non serializable info template<class Archive> void serialize(Archive &ar, const unsigned int file_version){ } }; int main() { vector<Data> v; Mutex mutexForData = createMutex(); std::ifstream ifs("filename", std::ios::binary); boost::archive::text_iarchive ia(ifs); ia >> v; // I'd like Data in the vector to use my mutexForData mutex }

1 0

Serialize map/vector for VC7.0
by Ng Pan 02 May '07

02 May '07

Dear all I am using vc7.0 and learning how to use Boost.Serialization. I face to a problem about serializing the member std::vector<int *> m_vpInt; let me state more. vc7.0 can support rtti, so I use no_rtti. I found an example to use no_rtti (test_no_rtti.cpp). std::vector<std::string> m_vsStr; std::vector<polymorphic_derived1 *> m_vpD1; Both m_vsStr and m_vpD1 can be serialized, but m_vpInt can't what should I do to serialize the member, m_vpInt? I found from the web serialization document : http://www.boost.org/libs/serialization/doc/index.html Is it related to my modification, especially the following last point ? Visual C++ 7.0 * The "pimpl" demo fails to link. Cause and workaround for this is unknown * XML serialization only works with version 1.6x of spirit. In order to build and use this library with this compiler, one must use version 1.6x rather than the latest version shipped with boost. See Release Notes. * This compiler does not support partial template specialization. The implementation of the new shared_ptr serialization depends upon compiler support for partial template specialization. This compiler doesn't implement this feature. In order to serialize shared_ptr<A>, invoke the macro BOOST_SERIALIZATION_SHARED_PTR(A) in the header code. * Lack of support for partial template specialization also creates problems for serialization of std::map. In order to serialize instances of this type include the invocation of BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION for the key type of the map. Best Regards Barr Ng _________________________________________________________________ No masks required! Use MSN Messenger to chat with friends and family. http://go.msnserver.com/HK/25382.asp

1 0

[xpressive] wchar_t and Unicode troubles.
by Eoin 01 May '07

01 May '07

Hello, I've been playing around with Xpressive and have hit a stumbling block when working with Unicode. I really am not sure if what I am trying to do is possible and that I'm just doing something silly wrong. Here is a very small example- wstring in = L"A ЏиϊсoδΣ Hello //World"; wsregex comments = wsregex::compile(L"(//[^\\n]*|/\\*.*?\\*/)"); wstring clear(L""); wstring out = regex_replace(in, comments, clear); (Note if the wstring 'in' gets scrambled in email I have attached a tiny UTF-8 encoded file of what it should contain.) This code compiles but after executing the wstring 'out' only contains "A ". If there are no Unicode characters in 'in' then the regex replacement works as expected. Kind regards, Eóin. "A ЏиϊсoδΣ Hello //World"

3 2

[Attention] Boost sandbox is moving to Subversion
by Doug Gregor 01 May '07

01 May '07

Boost is moving from SourceForge CVS to Subversion, hosted by the Open Systems Laboratory at Indiana University. This process will occur in stages, and will not be complete until after Boost 1.34.0 has been released. On Thursday, May 3rd at 9:00am EDT, the Boost Sandbox will move from its current location in SourceForge CVS into the Boost Subversion repository. The conversion should take less than 8 hours, and I will post a note to the Boost developers and users lists as soon as the sandbox is available under Subversion. If you have any outstanding changes to the sandbox, please commit them to CVS before 9:00am EDT on Thursday, May 3rd. Changes to the sandbox CVS at SourceForge after this time *will not* be reflected in the Subversion repository. Information about the Boost Subversion repository is available at http://svn.boost.org, including information about the Subversion layout and how to get write access to the Subversion repository. The sandbox itself will live at: http(s)://svn.boost.org/svn/boost/sandbox For more information about the migration to Subversion, see http:// svn.boost.org/trac/boost/wiki/MigrationToSubversion. - Doug

1 0

[multi_index] 2D/3D range seaching
by Chris Fairles 01 May '07

01 May '07

At first glance, it looked like the multi_index lib (perhaps combined with the range lib) might provide a convenient way to search for ranges of two+ indicies. For example, points. You have a grid of random points and you want a pair of iterators that contain all points within the cube (x1,y1,z1) and (x2,y2,z2) . I made a multi_index container with a composite key containing all three coords contained within a point class. struct point { int x, y ,z; }; struct coords_key : composite_key< point, member<point,int,x>, member<point,int,y>, member<point,int,z> >{}; struct coords{}; typedef multi_index_container< point, indexed_by< ordered_non_unique<tag<coords>, coords_key> > > point_set; int main() { point_set p; p.insert(point(1,2,2)); p.insert(point(2,3,1)); p.insert(point(1,2,3)); p.insert(point(10,3,2)); point_set::iterator it = p.lower_bound(make_tuple(1,1,1)); point_set::iterator it2 = p.upper_bound(make_tuple(3,3,3)); return 0; } it would be great if [it, it2] contained the first four points, but this is not the case. If I run this code, it == it2 == the first point. Am i barking up the wrong tree? Or is this doable. Cheers, Chris

2 3

[boost-users] [multi_index] print object data member in gdb
by Jeffrey Chang 01 May '07

01 May '07

Hi, I've been compiling & using multi_index without problem for a while; but when I use gdb to print multi_index_container objects, I couldn't find a way to easily traverse through its internal data structure. Here' s my multi_index_container object declaration: class MyClass { .... //define a multi_index_container with a list-like index and an ordered index struct SEQ {}; // Sequence struct TID {}; // TypeID typedef boost::multi_index::multi_index_container< HtvValueBasePtr, // element type boost::multi_index::indexed_by< boost::multi_index::sequenced< // list-like index boost::multi_index::tag<SEQ> >, // sequenced<> boost::multi_index::ordered_unique< // map-lik index boost::multi_index::tag<TID>, boost::multi_index::const_mem_fun< // key extractor HtvValueBase, // class name const HtvTypeBase::TypeID, // return type &HtvValueBase::getTypeId // const mem fun name > // const_mem_fun<> > // ordered_unique<> > // indexed_by<> > TLVListMapType; typedef TLVListMapType::index<SEQ>::type TLV_by_SEQ; typedef TLVListMapType::index<TID>::type TLV_by_TID; TLVListMapType mTLVs; //< indexed on both physical layout & TypeID. .... }; // class MyClass The program is running fine without problem; and I wanna use gdb to check its runtime status by printing out the object. Here's the gdb output when I print the object (I've manully indexed the gdb output & add '//' comment after closing-bracket '{' s.t. it's easier for the eyes): (gdb) p pMyClassObj->mTLVs $5 = { <boost::base_from_member<std::allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >,0>> = { member = { <__gnu_cxx::new_allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >> = { <No data fields> }, <No data fields> } }, <boost::multi_index::detail::header_holder<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > >,boost::multi_index::multi_index_container<boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > > >> = { <boost::base_from_member<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > >*,0>> = { member = 0x85cf7a8 }, <boost::noncopyable_::noncopyable> = { <No data fields> }, <No data fields> }, // header_holder <boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >,boost::mpl::v_item<hipeer::HipPacket::SEQ, boost::mpl::vector0<mpl_::na>, 0> >> = { <boost::multi_index::detail::ordered_index<boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>,std::less<const hipeer::HtvTypeBase::TypeID>,boost::multi_index::detail::nth_layer<2, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >,boost::mpl::v_item<hipeer::HipPacket::TID, boost::mpl::vector0<mpl_::na>, 0>,boost::multi_index::detail::ordered_unique_tag>> = { <boost::multi_index::detail::index_base<boost::shared_ptr<hipeer::HtvValueBase>,boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_---Type <return> to continue, or q <return> to quit--- ::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>,std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >> = { <No data fields> }, // index_base <boost::multi_index::detail::safe_container<boost::multi_index::detail::ordered_index<boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, std::less<const hipeer::HtvTypeBase::TypeID>, boost::multi_index::detail::nth_layer<2, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >, boost::mpl::v_item<hipeer::HipPacket::TID, boost::mpl::vector0<mpl_::na>, 0>, boost::multi_index::detail::ordered_unique_tag> >> = { <boost::multi_index::detail::safe_container_base> = { <boost::noncopyable_::noncopyable> = { <No data fields> }, header = { cont = 0x0, next = 0x0, unchecked_ = false }, mutex = { m_ = { __m_reserved = 0, __m_count = 0, __m_owner = 0x0, __m_kind = 0, __m_lock = { __status = 0, __spinlock = 0 } } } }, <No data fields> }, // safe_container (for ordered_index?) key = { <No data fields> }, comp = { <> = { <No data fields> }, <No data fields> } }, // ordered_index <boost::multi_index::detail::safe_container<boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, boost::shared_ptr<hipeer::HtvValueBase>, boost::multi_index::indexed_by<boost::multi_index::sequenced<boost::multi_index::tag<hipeer::HipPacket::SEQ, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na> >, boost::multi_index::ordered_unique<boost::multi_index::tag<hipeer::HipPacket::TID, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::const_mem_fun<hipeer::HtvValueBase, const hipeer::HtvTypeBase::TypeID, &hipeer::HtvValueBase::getTypeId>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<boost::shared_ptr<hipeer::HtvValueBase> > >, boost::mpl::v_item<hipeer::HipPacket::SEQ, boost::mpl::vector0<mpl_::na>, 0> > >> = { <boost::multi_index::detail::safe_container_base> = { <boost::noncopyable_::noncopyable> = { <No data fields> }, header = { cont = 0x0, next = 0x0, unchecked_ = false }, mutex = { m_ = { __m_reserved = 0, __m_count = 0, __m_owner = 0x0, __m_kind = 0, __m_lock = { __status = 0, __spinlock = 0 } } } }, <No data fields> }, // safe_container (for sequenced_index?) <No data fields> }, // sequenced_index node_count = 3 } // $5... (gdb) p pMyClassObj->mTLVs.header $12 = {cont = 0x0, next = 0x0, unchecked_ = false} (gdb) p pMyClassObj->mTLVs.member $13 = {<__gnu_cxx::new_allocator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::shared_ptr<hipeer::HtvValueBase> > > > >> = {<No data fields>}, <No data fields>} (gdb) p rqInbPkt.px->mTLVs.node_count $14 = 3 According to the 'node_count', there're 3 objects stored in the multi_index_container of '*pMyClassObj'. But I couldn't find a way to traverse all 3 objects in gdb: I see there're two 'member' data fields inside MyClass container, the first one doesn't contain any data, while the second one (at address 0x85cf7a8 inside the header_holder class???) seems to be the right place to start traversing... but I don't know if there's any convenient way to traverse it at the symbolic level via container's data members. Any hint? Thanks, --- Jeffrey

2 1

[Shared_ptrs] As I doing this right
by Hughes, James 01 May '07

01 May '07

Although I have been using shared_ptr's for a while, I still get a bit confused with polymorphic stuff ...no change there. An pseudocode example: Class A { }; Class B : public A { DoStuff1(); DoStuff2(); DoStuff3(); DoStuff4() }; // MyFunction handles A and classes derived from A MyFunction(shared_ptr<A>) { }; Main() { shared_ptr<A> poly<new B); // OK so far MyFunction(poly); // Still OK - // OK, done this, but now if I want to call a load of stuff in an instance of B // I either have to make a load of pointer casts (because poly is an A) dynamic_pointer_cast(poly)->DoStuff1(); dynamic_pointer_cast(poly)->DoStuff2(); dynamic_pointer_cast(poly)->DoStuff3(); dynamic_pointer_cast(poly)->DoStuff4(); // Or this? shared_ptr tmp = dynamic_pointer_cast(poly); // is this right? // I have to create a new pointer? tmp->DoStuff1(); tmp->DoStuff2(); tmp->DoStuff3(); tmp->DoStuff4(); } So, the quesiton is one of efficiency - if I was using pointers, I would just new a B and assign to a B* variable, then pass in to the function which would use it as an A - no temp required. With above a new tmp pointer seems to be required - am I right or have I missed something blindingly obvious. James 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.

3 3

BGL python: dijkstra_shortest_paths
by John Reid 01 May '07

01 May '07

Hi, I can't seem to use dijkstra_shortest_paths as I think I should via the python bindings. It works fine when I pass a weight_map and predecessor_map. What I want to do is to pass a predecessor_map and a distance_map. Unfortunately boost.python can't convert the arguments. I'm using a bgl that says bgl.__version__ = '1.0' although I haven't updated it from SVN recently. This works: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) weights = graph.add_edge_property('integer') weights[e] = 5 predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, weight_map = weights ) This doesn't work: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) distances = graph.add_edge_property('float') predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, distance_map = distances ) This is the error I get: <class 'Boost.Python.ArgumentError'>: Python argument types in boost.graph._graph.dijkstra_shortest_paths(Graph, Vertex) did not match C++ signature: dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::bidirectionalS> graph, struct boost::graph::python::basic_descriptor<void *,st ruct boost::bidirectionalS> root_vertex, class boost::vector_property_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bidirectionalS>,str uct boost::graph::python::basic_index_map<struct boost::graph::python::basic_des criptor<void *,struct boost::bidirectionalS>,struct boost::adj_list_vertex_prope rty_map<class boost::adjacency_list<struct boost::listS,struct boost::listS,stru ct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsig ned int,struct boost::no_property>,struct boost::property<enum boost::edge_index _t,unsigned int,struct boost::no_property>,struct boost::no_property,struct boos t::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * pr edecessor_map=None, class boost::vector_property_map<float,struct boost::graph:: python::basic_index_map<struct boost::graph::python::basic_descriptor<void *,str uct boost::bidirectionalS>,struct boost::adj_list_vertex_property_map<class boos t::adjacency_list<struct boost::listS,struct boost::listS,struct boost::bidirect ionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boo st::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int,st ruct boost::no_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * distance_map=None, c lass boost::vector_property_map<float,struct boost::graph::python::basic_index_m ap<struct boost::graph::python::basic_descriptor<class boost::detail::edge_desc_ impl<struct boost::bidirectional_tag,void *>,struct boost::bidirectionalS>,struc t boost::adj_list_edge_property_map<struct boost::bidirectional_tag,unsigned int ,unsigned int const &,void *,struct boost::property<enum boost::edge_index_t,uns igned int,struct boost::no_property> const ,enum boost::edge_index_t> > > {lvalu e} weight_map, class boost::python::api::object visitor=None, class boost::vecto r_property_map<enum boost::default_color_type,struct boost::graph::python::basic _index_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bi directionalS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_ list<struct boost::listS,struct boost::listS,struct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_proper ty>,struct boost::property<enum boost::edge_index_t,unsigned int,struct boost::n o_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * color_map=None) dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::undirectedS> graph, struct boost::graph::python::basic_descriptor<void *,struc t boost::undirectedS> root_vertex, class boost::vector_property_map<struct boost ::graph::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost ::graph::python::basic_index_map<struct boost::graph::python::basic_descriptor<v oid *,struct boost::undirectedS>,struct boost::adj_list_vertex_property_map<clas s boost::adjacency_list<struct boost::listS,struct boost::listS,struct boost::un directedS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int ,struct boost::no_property>,struct boost::no_property,struct boost::listS>,unsig ned int,unsigned int const &,enum boost::vertex_index_t> > > * predecessor_map=N one, class boost::vector_property_map<float,struct boost::graph::python::basic_i ndex_map<struct boost::graph::python::basic_descriptor<void *,struct boost::undi rectedS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_list< struct boost::listS,struct boost::listS,struct boost::undirectedS,struct boost:: property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,stru ct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_proper ty>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int con st &,enum boost::vertex_index_t> > > * distance_map=None, class boost::vector_pr operty_map<float,struct boost::graph::python::basic_index_map<struct boost::grap h::python::basic_descriptor<class boost::detail::edge_desc_impl<struct boost::un directed_tag,void *>,struct boost::undirectedS>,struct boost::adj_list_edge_prop erty_map<struct boost::undirected_tag,unsigned int,unsigned int const &,void *,s truct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_pro perty> const ,enum boost::edge_index_t> > > {lvalue} weight_map, class boost::py thon::api::object visitor=None, class boost::vector_property_map<enum boost::def ault_color_type,struct boost::graph::python::basic_index_map<struct boost::graph ::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost::adj_l ist_vertex_property_map<class boost::adjacency_list<struct boost::listS,struct b oost::listS,struct boost::undirectedS,struct boost::property<enum boost::vertex_ index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boos t::edge_index_t,unsigned int,struct boost::no_property>,struct boost::no_propert y,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_inde x_t> > > * color_map=None) For reference here is the docstring bgl gives me: Type: function Base Class: <type 'builtin_function_or_method'> String Form: <Boost.Python.function object at 0x04AEE940> Namespace: Interactive Docstring: dijkstra_shortest_paths(graph, root_vertex, predecessor_map = None, distance_map = None, weight_map = None, visitor = None) Computes the shortest paths from the root vertex to every other vertex in a graph. Parameters: graph the graph on which to compute shortest paths will run. It may be either a directed or undirected graph. root_vertex the starting vertex for the shortest-path search. predecessor_map a vertex -> vertex map that stores the predecessor of each vertex in the shortest paths tree. From a given vertex, one can follow the predecessor_map back to the root_vertex to reconstruct the shortest path. distance_map a vertex -> float map that stores the distance from the root_vertex to each vertex in the tree. A distance of infinity in this property map indicates that the vertex is unreachable from the root_vertex. weight_map an edge -> float map that stores the weight of each edge in the graph. Negative edge weights are not permitted. If no weight map is provided, each edge will be assumed to have a weight of 1.0. visitor a visitor that will receive events as the shortest-paths computation progresses. Typically this visitor should be derived from boost.graph.dijkstra_visitor. See also: bellman_ford_shortest_paths dag_shortest_paths dijkstra_visitor Complete C++ documentation is available at: http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html Any help appreciated, John.

4 9

[1.33.1][Iostreams][compression] Jamfile does not copy compression libraries into target destination, on Windows platform.
by Peter Dulimov 01 May '07

01 May '07

Hello, I built boost 1.33.1 on my PC with the source for the bzip2 and zlib libraries in order to enable the Iostreams compression filters. While doing this, I discovered that "-sNO_COMPRESSION=0" in the bjam options, (in order to override the defaults that are selected for building on the PC platform), causes the build process to stop. Just leave it out. Also, the bzip2 and zlib libraries aren't copied with the rest of the libraries. You need to find them and copy them into place manually. I suspect this to be a bug in the Jamfile. This is the command that I issued to build Boost and the compression libraries: bjam "-sTOOLS=vc-7_1" "--prefix=c:\Boost" "--exec-prefix=c:\Boost\MSVC71" "--builddir=c:\temp\boostbuild" "--with-python-root=c:\Python" "--with-python-version=2.5" "-sBZIP2_SOURCE=c:\Downloads\Boost\bzip2-1.0.4" "-sZLIB_SOURCE=c:\Downloads\Boost\zlib-1.2.3" install Regards, Peter. Warning: Copyright ResMed. Where the contents of this email and/or attachment includes materials prepared by ResMed, the use of those materials is subject exclusively to the conditions of engagement between ResMed and the intended recipient. This communication is confidential and may contain legally privileged information. By the use of email over the Internet or other communication systems, ResMed is not waiving either confidentiality of, or legal privilege in,the content of the email and of any attachments. If the recipient of this message is not the intended addressee, please call ResMed immediately on +61 2 8884 1000 Sydney, Australia.

1 0

[Multi_index] Performance like sequenced.cpp example
by Manuel Jung 30 Apr '07

30 Apr '07

Hi, I have to count a lot of words. Up to now i did it with MySQL, because it was easy. The result is safed there anyway. Now i thought i could speed up this a little if i would use internally a Multi_index list to store the words, so i have only to insert all different words. The words are stored in a UnicodeString from the ICU library. My code is really near to the one from the example "sequenced.cpp". Im using the following definition: typedef multi_index_container< UnicodeString, indexed_by< sequenced<>, ordered_non_unique<identity<UnicodeString> > > > text_container; typedef nth_index<text_container,1>::type ordered_text; text_container tc; Im inserting new words with "tc.push_back(UnicodeString(NewWord));" And count them exactly like in the example. I thought this should be fast, but it isnt. It eats up all my CPU, but isnt fast. It is a lot slower than my old solution. I have still hope i could speed this up, before i have to switch back MySQL. The profile of a run says that "boost::multi_index::safe_mode::check_same_owner<..." eats most CPU time. Some suggesting how to speed it up with Multi_index? Or some ideas which other way would be faster than MySQL inserts? Thanks Manu

3 6

An easy to use grid like random access/dynamic container?
by Jeff 30 Apr '07

30 Apr '07

I have been using STL containers to store structures of data but I would like to know if there is an easier solution such as a dynamically sized container that stores data in a spreadsheet like fashion. For example, I would like to store rows of columns of different data types. Here is a sample of data I would like to store, also, I would like fast random access to the elements to read and modify existing data: Name, Age, HomeOwner John 42 true Mark 24 false Mary 29 true If anyone can suggest such a container please let me know. Thank you

3 3

[unit test framework] undef ref to main() when dyn linking unit_test_framework lib, boost 1.34, linux
by Chris Fairles 30 Apr '07

30 Apr '07

Testing out boost beta 1.34. I built the whole she-bang with the gcc toolset. I tried compling my unit tests and they all get: /usr/lib/gcc/x86_64-redhat-linux/4.1.1/../../../../lib64/crt1.o: In function `_start': (.text+0x20): undefined reference to `main' collect2: ld returned 1 exit status I don't use the auto test case mechanism. My tests suites look like: #include "boost/test/unit_test.hpp" using boost::unit_test::test_suite; void free_test_function() { BOOST_CHECK(1 == 1); } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Unit test example 1" ); test->add( BOOST_TEST_CASE( &free_test_function ) ); return test; } I compile using g++ -Wall -I/usr/local/include/boost-1.34 -o unit_test unit_test_test.cpp -L/usr/local/lib64 -lboost_unit_test_framework-gcc41-mt-d If i define BOOST_TEST_DYN_LINK either in the cpp file before or after the unit_test.hpp include, or specifify it using -D on the command line I get the same results. I tried to look through the headers responsible for defining BOOST_TEST_DYN_LINK but theres a lot of references to "msvc auto-linking" which I of course do not use. Should I be defining BOOST_ALL_DYN_LINK ? I recall it not being set somewhere because boost.build v2 doesn't like it or something. Really i can't make heads or tails of what I should be defining, whether I shouldve defined something when building the unit test libs, or whether I should be defining something building my own. The docs say something about defining BOOST_TEST_DYN_LINK but as stated above, it doesn't seem to make a difference. Chris

2 3

Boost.Test and mpatrol
by KLINIK Markus SDI2-G (AREVA NP GmbH) 30 Apr '07

30 Apr '07

Hi, there seems to be a problem if Boost.Test and mpatrol are used together. The following program hangs and constantly uses more and more memory. How to reproduce the behaviour: System: Windows XP Prof. SP2 MS Visual Studio 7 mpatrol-1.4.8 boost-1.33.1 <code> #define BOOST_AUTO_TEST_MAIN #include <boost/test/auto_unit_test.hpp> BOOST_AUTO_TEST_CASE(testA) { int* a = new int[100]; } </code> After "sourcing" vsvars32.bat the following command was used to compile & link the sample. cl -Zi -EHsc -ML -Ic:\boost\include\boost-1_33_1 test.cpp -link -libpath:c:\local\lib mpatrol.lib -libpath:c:\boost\lib libboost_unit_test_framework-vc7-s.lib Static linkage of mpatrol results in the same behaviour: cl -Zi -EHsc -ML -Ic:\boost\include\boost-1_33_1 test.cpp -link -libpath:c:\local\lib libmpatrol.lib imagehlp.lib -libpath:c:\boost\lib libboost_unit_test_framework-vc7-s.lib Same with -MT, mpatrolmt.lib and libboost_unit_test_framework-vc7-mt-s.lib The combinations -MLd, mpatrol.lib and libboost_unit_test_framework-vc7-sgd.lib -MTd, mpatrolmt.lib and libboost_unit_test_framework-vc7-mt-sgd.lib do not result in the erroneous behaviour, but memory debugging is buggy because mpatrol and the M$ debug malloc implementation are incompatible (according to the mpatrol documentation/mailing list). I've posted the bug description here because I don't know where to start. Even "it is their fault" pointers would be helpful. Thanks in advance, Markus Appendix: real quick howto install mpatrol (to make it work for this example): - download from http://www.cbmamiga.demon.co.uk/mpatrol/files/mpatrol_1.4.8.tar.gz - unpack to c:\src - cmd prompt to C:\src\mpatrol\build\windows - "source" vsvars32.bat (YMMV): $ "c:\Programme\Microsoft Visual Studio .NET\Common7\Tools\vsvars32.bat" - $ nmake -f NMakefile all - copy mpatrolmt.lib to c:\local\lib - copy libmpatrolmt.lib to c:\local\lib - copy mpatrolmt.dll to a directory in $PATH (or local directory)

2 1

[SPAM:## 74%] [boost] [Review] The review of the Boost.Guid library starts today (April 30th)
by Hartmut Kaiser 30 Apr '07

30 Apr '07

Hi all, The review of the proposed Boost Guid library written by Andy Tompkins starts today (April 30th, 2007) and ends May 10th, 2007. You can download the library here: http://www.boost-consulting.com/ vault/ (file guid_v7.zip). --------------------------------------------------- About the library: Guid is a library providing an implementation of Globally Unique Identifiers. Guid's are used in many facets of programming, including databases, networks, remote procedures, serializations, transactions, identifying documents, and identifying classes. This library is efficient and is able to create name-based and random-based guids. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards Hartmut Review Manager _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/ listinfo.cgi/boost

1 0

[-s- lib versions][vc80] new user Q: what's the difference between lib*vc80-mt-1_33_1.lib and lib*vc80-mt-s-1_33_1.lib
by John McMahon 30 Apr '07

30 Apr '07

Hi I'm a new boost user. I downloaded the pre-built Visual Studio 2005/vc80 version of boost from http://www.boost-consulting.com/products/free and read the instructions at http://www.boost.org/more/getting_started.html , specifically the section on library runtimes. I have a question; In the context of vc80, and for components which have libraries, what's the difference between -s- and non-s static libs, e.g. for 'thread' -rw-r--r-- 1 John None 516994 Mar 25 2006 libboost_thread-vc80-mt-1_33_1.lib -rw-r--r-- 1 John None 845330 Mar 25 2006 libboost_thread-vc80-mt-s-1_33_1.lib thanks in advance John McMahon

2 1

[filesystem] Can't create absolute paths from strings on windows
by Ken Klose 29 Apr '07

29 Apr '07

cout << "init path " << initial_path().string() << endl; cout << "init path exists " << exists(initial_path()) << endl; prints: init path C:/Documents and Settings/me/workspace/3.2/DciApiTest init path exists 1 But if I try to construct the same path from a string: I get: path init_path2(initial_path().string(), no_check); // I've also tried 'native' checker cout << "init path 2 " << init_path2.string() << endl; cout << "init path 2 exists " << exists(init_path2) << endl; I get: init path 2 C:Documents and Settings/ken.klose/workspace/3.2/DciApiTest init path 2 exists 0 The / after the : gets lost and therefore the file isn't found. Thanks in advance! BTW: Using MinGW.

1 2

iostreams and compression
by Aljaz 29 Apr '07

29 Apr '07

Hello I've been trying to figure out another way to compress data from/to std::stringstream. Here is the source how I do it now: std::stringstream decompressed; decompressed << "somestring....."; std::stringstream compressed; { boost::iostreams::filtering_streambuf<boost::iostreams::input> out; out.push(boost::iostreams::zlib_compressor()); out.push(decompressed); boost::iostreams::copy(out, compressed); } Is there any way around this? I want to avoid boost::iostreams::copy because it takes 40% of this source execution time. How can I compress data directly to stringstream (to compressed in this example) without copying it? Thank you very much for help Regards Aljaz

1 0

Re: [Boost-users] [thread] Segfault constructing a thread
by Ken Klose 28 Apr '07

28 Apr '07

Peter, Thank you very much. Your suggestions have fixed it. Ken "Peter Dimov" <pdimov(a)mmltd.net> wrote in message news:<008b01c789b2$21b0fe20$6607a8c0@pdimov2>... > Ken Klose wrote: > > I've got a singleton object that is trying to run its operator() > > method in a separate thread, but I'm getting a segfault when I > > construct the thread object: > > > > PublishedListener::PublishedListener(string directory) > > { > > _thread = new thread(*this); // segfault here > > } > > This line makes a copy of *this. It's very likely that this isn't what you > want. Use ref(*this) to store a reference, and consider disabling the copy > constructor and the assignment operator of the class.

1 0

Re: [Boost-users] [thread] Segfault constructing a thread
by Ken Klose 28 Apr '07

28 Apr '07

Thanks for replying! The operator()() method is just a stub at the moment: void PublishedListener::operator()() { this->run(); } void PublishedListener::run() { cout << "Hooray! My thread is running" << endl; } I tried stepping through the construction of the thread and it looks like the problem is occurring somewhere in the construction of the function0<void>. As a test I changed the constructor to this: PublishedListener::PublishedListener(string directory) { cout << "1" << endl; function0<void> runnable(*this); cout << "2" << endl; _thread = new thread(runnable); cout << "3" << endl; } And I get the problem between 1 and 2. Thanks, Ken PS - I see Peter Dimov suggested I use ref. I'm going to try that now and reply to his post. "Digvijoy Chatterjee" <digvijoy.c(a)gmail.com> wrote in message news:<2f7228250704271831y58640424ld32d3cfe0c1bbc50(a)mail.gmail.com>... > On 4/27/07, Ken Klose <ken.klose(a)future-skies.com> wrote: > > > > I've got a singleton object that is trying to run its operator() method in > > a > > separate thread, but I'm getting a segfault when I construct the thread > > object: > > > > PublishedListener::PublishedListener(string directory) > > { > > _thread = new thread(*this); // segfault here > > } > > > > PublishedListener.h: > > class PublishedListener > > { > > public: > > static PublishedListener &getInstance(); > > void run(); > > void operator()(); > > boost::filesystem::path getItemDirectory(); > > virtual ~PublishedListener(); > > private: > > PublishedListener(std::string directory); > > static PublishedListener *_instance; > > boost::thread *_thread; > > boost::filesystem::path *itemDirectory; > > }; > > > > Thanks in advance! > > > Are you sure the implementation of operator()() isnt seg faulting, the > thread should be able to invoke it properly and i dont see any reason for > the thread instantiation to segfault.. > HTH > Digz >

1 0

[Serialization] Multiple BOOST_CLASS_EXPORT
by Sohail Somani 28 Apr '07

28 Apr '07

Hi, Is there any danger in having multiple BOOST_CLASS_EXPORTs within a shared library or executable? I have a template child class that is always serialized by base class pointer and to keep myself sane I figure I can just blindly add BOOST_CLASS_EXPORT(ChildClass<T>); at the end of the .cpp file that uses it. Thanks, Sohail

2 4

[boost] [math toolkit] Review Ends
by Matthias Schabel 28 Apr '07

28 Apr '07

The review period for the proposed Math Toolkit by John Maddock and Paul Bristow is now over. I will be assembling responses and put together a synopsis over then next few days. Thanks to everyone who participated and submitted reviews. Matthias

3 2

very simple shared_ptr and copy constructor question
by Robert Marion 28 Apr '07

28 Apr '07

So, I've been using std::auto_ptr for some time, and have always been careful to either create a copy constructor or make it private (same for assignment). But now that I am becoming a boost::shared_ptr convert, I think that is no longer necessary. Is that so? Thanks, Robert

3 2

[thread] Segfault constructing a thread
by Ken Klose 28 Apr '07

28 Apr '07

I've got a singleton object that is trying to run its operator() method in a separate thread, but I'm getting a segfault when I construct the thread object: PublishedListener::PublishedListener(string directory) { _thread = new thread(*this); // segfault here } PublishedListener.h: class PublishedListener { public: static PublishedListener &getInstance(); void run(); void operator()(); boost::filesystem::path getItemDirectory(); virtual ~PublishedListener(); private: PublishedListener(std::string directory); static PublishedListener *_instance; boost::thread *_thread; boost::filesystem::path *itemDirectory; }; Thanks in advance!

3 2

Question on Boost::statechart library orthogonal regions
by Serena Fritsch 28 Apr '07

28 Apr '07

Hi All, Apologies if there are multiple psoting of this message. I want to use the boost::statechart library. However i encountered a small problem with using the orthogonal regions. In the statechart tutorial, every class declaration is put into one file, however i would like to put each class declaration into separate files. An example ( boost specific headers are omitted for readability reasons, also .cpp files which contain only test functions): A.h #include "Machine.h" class C; class B; class A: public sc::simple_state< A, Machine, mpl::list< C, B > > {}; C.h #include "A.H" class C: public sc::simple_state<C, A::orthogonal <0> > {}; B.h #include "A.H" class B: public sc::simple_state<B, A::orthogonal <1> > {}; Machine.h class A; class B; class Machine : public sc::state_machine<Machine, A> {}; Makefile CXX = g++-3.4 CFLAG = -c -g -w -O0 OBJECTS = Main.o A.o B.o C.o Machine.o all: $(OBJECTS) $(CXX) $(OBJECTS) -o $@ Main.o: Main.cpp $(CXX) $(CFLAG) $< A.o: A.cpp A.h $(CXX) $(CFLAG) $< B.o: B.cpp B.h $(CXX) $(CFLAG) $< C.o : C.cpp C.h $(CXX) $(CFLAG) $< Machine.o: Machine.cpp Machine.h $(CXX) $(CFLAG) $< clean: rm -f *.o a.out .PHONY: clean .PHONY: all Compiling this program fails, containing the following error messages (we only list an excerpt here): /usr/include/boost/statechart/simple_state.hpp: In static member function `static void boost::statechart::simple_state<MostDerived, Context, InnerInitial, historyMode>::deep_construct_inner_impl_non_empty::deep_construct_inner_impl(const boost::intrusive_ptr<T>&, typename Context::inner_context_type::outermost_context_base_type&) [with InnerList = boost::mpl::list1, MostDerived = A, Context = Machine, InnerInitial = boost::mpl::list<C, B, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::statechart::history_mode historyMode = has_no_history]': When putting all class declarations into one file, it works perfectly. So my question now is, is it possible to modularise the different state declarations into external files? Thanks very much for any insights on this Cheers Serena

2 4

FileSystem - Test if file exists without opening the file?
by Jeff 28 Apr '07

28 Apr '07

Hello, I can see from a FileSystem example how to check for the existence of a directory. What I would like to be able to do is to check for the existence of a file but I couldn't figure out how to do it using exists(). The way that I currently check for a file's existence is by opening the file. I wonder if boost::filesystem can test for a file's existence more efficiently than having to open it like I do in the snippet below. // checking for file existence by opening the file ifstream source(fileName); if (source) ... The reason for my concern is that I am going to be reading a text document containing a list of files, and all that I need to know is if the files exist on disk or not. If there is a way to check without opening each one, that would be ideal. Thanks in Advance

5 7

[Serialization] xml_archive + templates = :-(
by Sohail Somani 28 Apr '07

28 Apr '07

Hi, Quite sensibly, xml_archive seems to fail with archive errors when class_name contains xml characters (like <) which are quite common in templates. For example, in my tests: BOOST_EXPORT_CLASS(Something<T>); // fails when deserializing because of parse error. I fix it by doing: BOOST_EXPORT_CLASS_GUID(Something<T>,"Something_T"); // works \o/ Now, do you suppose xml_archive could be smart enough to convert < to < and similarly for other prohibited characters when serializing? Even if not, is there something I can do in 1.33.1 that would make it not so redundant? Thanks, Sohail

2 2

[program_options] assertion failed on very logn option description
by Dmitriy Chumack 27 Apr '07

27 Apr '07

hi * Win32 VisualStudio 2005 boost_1_33_1 When I supply option description, which length exceeded value of options_description::m_default_line_length, to the options_description, then I have an assertion failure when I want to get help from my command line program: prog --help Assertion failure: file: xstring line: 173 and them comes very long assert expression. This seems to be a compiler specific issue, because the same code, compiled on Linux Slackware 11.0 with gcc 3.4.6 and the same version of boost, works nice. thanks in advance -- Best regards, Dmitriy Chumack mailto:saint.d.a@gmail.com

2 1

[gil] top/bottom N% value
by Christian Henning 27 Apr '07

27 Apr '07

Hi guys, here is my first implementation of the bottom N% problem. The algorithm is my own invention so please let me know when there is a better way. Also, the current implementation only works for homogeneous pixel types. Any comments are more than welcome. Christian

1 0

read_graphviz question
by Jeffrey Holle 26 Apr '07

26 Apr '07

I'm using the post 1.31.1 version of boost, which has a much nicer read_graphviz function. I'm wondering if there is a way to "ignore" unwanted properties, something akin to sending them to /dev/null. My present experience is that if an unexpected property is found, an exception is thrown. Is there a way to express that a given property is to be ignored? Better yet, is there a way to say that all unexpected properties are to be ignored?

3 3

[multi_index] REVISITED: hash_unique with differently produced hash codes
by Ovanes Markarian 26 Apr '07

26 Apr '07

Hello Joaquín, now I found the failure, to the problem described in message http://lists.boost.org/boost-users/2007/04/27211.php with std::string as a key not being found. The problem in my case was that I use Xalan to parse XML and have to convert string to single byte characters. Since std::string has some build in caching to improve performance and I decode double byte string (XalanDOMString) as follows: std::string get_string(XalanDOMString const& str) { XalanDOMString::CharVectorType v; str.transcode(v); return std::string(v.begin(), v.end()); } this code produces a string which still points to the double byte buffer and therefore this results in a different hash value for the returned string as the value would be for the basic_string<char> or C-String: An example: XalanDOMString str("Sint8"); std::string char_str(get_string(str)); Calling find in the multi-index results in a hash value 40. Calling find in the multi-index for const char* str="Sint8"; results in a hash value 13 The same result (13) can be achieved when calling on char_str.c_str(); c_str() cause the strings internal buffer to be rebuild. Since boost::hash is on the way to become a part of STL it should ensure to work with the correctly intended copy of string. What is your opinion on this issue? With Kind Regards, Ovanes

3 3

[BGL] Basic graph construction
by Alejandro Marcos Aragón 26 Apr '07

26 Apr '07

I was wondering if someone could give me a tip on how to construct the following graph. The problem is that the queue type definition does not know what "edge" is until the type definition for the graph is created. Is there a way to get around this? Thank you #include <boost/graph/adjacency_list.hpp> #include <queue> // Type definition for a priority queue of (double,edge) pairs typedef std::priority_queue<std::pair<double,int> > edge_queue; struct vertex_edge_priority_t { typedef vertex_property_tag kind; }; // Vertex properties: typedef property < vertex_edge_priority_t, edge_queue > domainVertexProperty; // Edge propeties: typedef property < edge_index_t, int, property < edge_weight_t, double > > domainEdgeProperty; // Graph used to represent possible vertices and edges within the domain. typedef adjacency_list< setS, vecS, undirectedS, domainVertexProperty, domainEdgeProperty > domainGraph; typedef graph_traits<domainGraph>::edge_descriptor edge;

2 2

[smart_ptr] Conflict with Maya?
by Paul Giaccone 26 Apr '07

26 Apr '07

Does anyone know of any evidence that the memory management in smart_ptr might be incompatible with Maya, in particular, in gcc 3.2.3? My supervisor, who is unfamiliar with Boost's smart_ptr library, but is familiar with Maya, tells me that Maya has its own memory management, and that Boost's smart pointers might somehow interfere with this. I've used Boost's smart pointers for long enough that I really, really, really don't want to go back to the horrors of having to delete memory that I allocate on the heap and spending hours tracking down memory leaks if I get it wrong. I'd really rather not do that, especially as it's a potential memory leak that I'm trying to fix (Maya plug-ins are created using a bare "new" which doesn't seem to require a corresponding delete, according to the examples I have seen). So someone please tell me that is couldn't possibly be true. Thanks.

5 16

[scoped_array] "optimization"
by Michael Marcin 26 Apr '07

26 Apr '07

Hello, I have a new programmer on my team who has been brought on as an optimization engineer. She has a lot more experience than I do but I fear some of that experience may have left impressions that have stuck with her for too long. On the first check in labeled spot optimizations there were many things changed that disturbed me. One of them was changing a class from essentially. #include <boost/scoped_array.hpp> class Context { public: Context( unsigned int width, unsigned int height ) : m_buffer( new unsigned int[width*height] ) { } unsigned int* GetBuffer() { return m_buffer.get(); } private: boost::scoped_array<unsigned int> m_buffer; }; to class Context { public: Context( unsigned int width, unsigned int height ) : m_buffer( new unsigned int[width*height] ) { } ~Context() { delete m_buffer; } inline unsigned int* GetBuffer() { return m_buffer; } private: unsigned int* m_buffer; }; First of all there is the defect of delete being called instead of delete[]. Other than that I was under the impression that there should be no difference between the two other than the former being more descriptive (it instantly tells me this is an array and the memory is owned by the instance of this class). Is this really an optimization? Thanks, Michael Marcin

9 11

[multi-index] hashed_unique and sequenced question
by Ovanes Markarian 26 Apr '07

26 Apr '07

Hello, Is there any way to find an element in the multi-index container by it's hash and proceed with all elements which were added later on in the sequence after it? With Kind Regards, Ovanes Markarian

2 1

[BLL] Right usage of he placeholder _1 ?
by pheres 26 Apr '07

26 Apr '07

Hello, I've two problems so far with a simple for_each: 1. vector<string*> v2(10); fill(v2.begin(), v2.end(), new string("hehe")); for_each(v2.begin(), v2.end(), cout << *_1 << " "); // works for_each(v2.begin(), v2.end(), delete _1 ); // error // error: type ‘const struct // boost::lambda::lambda_functor<boost::lambda::placeholder<1> // >’ argument given to ‘delete’, expected pointer Shouldn't the placeholder _1 actually become a (string-)pointer as it obviously does in the expression above ( cout << *_1 << " " )? 2. Is it possible to call member functions from an placeholder of a boost-like lambda expression? vector<string> v3(10); fill(v3.begin(), v3.end(), "hoho"); for_each(v3.begin(), v3.end(), cout << _1->c_str() << " "); // error // error: base operand of ‘->’ has non-pointer type ‘const // boost::lambda::lambda_functor<boost::lambda::placeholder<1> >’ Thank you for any input!

2 1

[program_options] Problem with custom parser and boolean options
by Tarjei Knapstad 26 Apr '07

26 Apr '07

I'm trying to support non-conventional syntax on the form "option=value", where boolean options are given as "option=on" or "option=off". For this I've implemented a custom parser that splits a string on the '=' character and returns a std::pair<std::string, std::string> containing the option and it's value. This works fine for most things except I can't figure out how to handle boolean options. I've tried the following which just makes the option "disappear" if it's set to "off" and returns a pair with the option and an empty string as value if it's set to "on". It works for "off", but for "on" I get an exception stating "extra parameter in 'option'". Is there any way to get around this? Here's my custom parser: //---------------- START: code std::pair<std::string, std::string> custom_parser(std::string const & s) { std::pair<std::string, std::string> option; if (s.find("=") != std::string::npos) { std::vector<std::string> slist; boost::split(slist, s, boost::is_any_of("=")); if (slist[1] == "on") { option.first = slist[0]; } else if (slist[1] == "off") { // Return an empty option if the feature is turned off } else { option.first = slist[0]; option.second = slist[1]; } } return option; } //-------------- END: code Any help appreciated! Regards, -- Tarjei

1 0

[multi_index] inherit from a multi_index
by Guillaume Lazzara 26 Apr '07

26 Apr '07

Hi, I would like to know if it is safe to create a struct and make it inherit from a multi_index. Actually I already tried but I got this error: /usr/include/boost/multi_index_container.hpp:204: warning: base class 'struct boost::multi_index::detail::header_holder<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<vcsn::InitialValue<vcsn::rat::exp<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, float> > > >, boost::multi_index::multi_index_container< [...] >, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::member<vcsn::InitialValue<vcsn::rat::exp<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, float> >, [...] >' should be explicitly initialized in the copy constructor Is it an issue due to Boost or because I'm doing something really bad? Thanks, -- Guillaume Lazzara Epita CSI 2008

2 2

regex_replace -- format_default
by ivan＠0x4849.net 26 Apr '07

26 Apr '07

Hi I am trying to use boost::regex_replace but I am having trouble understanding the format to use for the the format string. The Ecma-262.pdf rules for how to create a format string seem quite terse. Does anyone know of a reference that has some more examples? Here is the code I am trying to write: #include <boost/regex.hpp> #include <string> #include <iostream> int main(int argc, char** argv) { std::string str; boost::regex expression("abc"); std::string fmt(""); // WHAT GOES HERE? fn = "abcabcabc"; boost::regex_replace(str, expression, fmt); std::cout << str << std::endl; return 0; } Thank you, Ivan Novick http://www.0x4849.net

2 1

boost::random::normal_distribution
by Jeffrey Brent McBeth 26 Apr '07

26 Apr '07

#include <boost/random.hpp> #include <iostream> int main(int argc, char *argv[]) { boost::mt19937 eng; boost::normal_distribution<> norm(0,1); std::cout << norm(eng) << std::endl; } Gives me a NaN everytime. Looking at the code, it doesn't really surprise me, as _r1 = eng(); _r2 = eng(); _cached_rho = sqrt(-result_type(2)*log(result_type(1)-_r2)); would only work if eng were in the range (0,1) with 0 being degenerate, and 1 being undefined. Looking through the mt19937, that is returning a full UInt32. Perhaps those two eng() should be replaced by uniform_01? Jeffrey McBeth -- ---------------------------------------------------------------------------- Hofstadter's Law states: It always takes longer than you expect, even when you take into account Hofstadter's Law. ----------------------------------------------------------------------------

2 1

newbie problem with Boost.Serialization
by John Pye 26 Apr '07

26 Apr '07

Hi all, I have some trouble with the Boost.Serialization library. I have compiled the 'demo.cpp' example, and now I am trying to distill it a little, so that I can understand how to apply it to my own polymorphic class hierarchy. However I keep seeing the same error message, and can't work out what it means. In /usr/include/boost/archive/detail/oserializer.hpp:567 there are some comments about the error message I'm seeing but I don't understand what those comments mean. I'm using Boost 1.33.1-7ubuntu1 on Ubuntu 6.10. Any help would be much appreciated! Cheers JP Here is the error message: --------------8<--------------- jpye@john:~/boosttest$ scons scons: Reading SConscript files ... scons: done reading SConscript files. scons: Building targets ... g++ -o ser1.o -c ser1.cpp /usr/include/boost/archive/detail/oserializer.hpp: In function 'void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = dd]': /usr/include/boost/archive/basic_text_oarchive.hpp:78: instantiated from 'void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = dd, Archive = boost::archive::text_oarchive]' /usr/include/boost/archive/detail/interface_oarchive.hpp:78: instantiated from 'Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = dd, Archive = boost::archive::text_oarchive]' ser1.cpp:43: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:567: error: invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' scons: *** [ser1.o] Error 1 scons: building terminated because of errors. jpye@john:~/boosttest$ -------------------------------------- Here is the code that was being compiled: -----------------8<--------------- jpye@john:~/boosttest$ cat ser1.cpp #include <iomanip> #include <iostream> #include <fstream> #include <string> #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> class dd{ friend std::ostream&operator<<(std::ostream&,const dd&); friend class boost::serialization::access; double x,y; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & y & x; } public: // every serializable class needs a constructor dd(){}; dd(double x, double y) : x(x), y(y) {} }; std::ostream & operator<<(std::ostream &os, const dd &d) { return os << d.x << ' ' << d.y; } int main(int argc, char *argv[]){ dd D(10,20); int x = 5; std::cerr << D << std::endl; std::ofstream ofs("test.txt"); boost::archive::text_oarchive oa(ofs); oa << x; oa << D; return 0; } -------------------------------------- And, just for completeness, my build file: --------------8<---------------- jpye@ascendserver:~/boosttest$ cat SConstruct Program("test",["ser1.cpp"], LIBS=['boost_serialization']) ------------------------------------

2 3

Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)?
by Frank Bergemann 26 Apr '07

26 Apr '07

Hi Gary, you made my day - many thanks! Seems we have done similar things :-) Just a final question: Could you tell me, what these defines are about? I didn't adopt them and the modules seems to be ok without. > > #define BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES datastore::ConfigIArchive > #define BOOST_ARCHIVE_CUSTOM_OARCHIVE_TYPES datastore::ConfigOArchive > Cheers! \Frank _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

4 5

BOOST_CLASS_EXPORT conflicts with xml_iarchive.hpp
by Oleg V. Zhylin 26 Apr '07

26 Apr '07

Hello All, Could someone please help me to understand why code below fails to compile with STATIC_ASSERTION_FAILURE in basic_xml_iarchive.hpp // If your program fails to compile here, its most likely due to // not specifying an nvp wrapper around the variable to // be serialized. BOOST_STATIC_ASSERT(0 == sizeof(T)); Code does compile if BOOST_CLASS_EXPORT line is commeted out. #include <boost/archive/xml_iarchive.hpp> class A { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & i; } int i; }; #include <boost/serialization/export.hpp> BOOST_CLASS_EXPORT(A) int main() { } WBR Oleg V. Zhylin ovz(a)yahoo.com __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 5

Filesystem - Recurse directories function?
by Jeff 25 Apr '07

25 Apr '07

I am wondering if someone would possibly post a recursive function that prints out all files and sub-directories. I've never created a recursive function before and I'm having problems getting all files and directories to print. Thank You

3 2

Boost topological_sort attempts to advance a dereferencable iterator 20 steps outside the valid range
by Stephen Torri 25 Apr '07

25 Apr '07

I am still trying to understand why boost graph's topological_sort fails for a test program I have made to sort five vertexes. Originally I compiled this program against boost 1.33.1 on a Fedora Core 6 system using gcc-4.1.1. After receiving no response from the boost-users list that could solve this problem I read the Reporting Bug document on the boost website. I followed the CVS instructions and checked out a copy from the HEAD (reported as boost-1.35) and built it. I used the following flags: bjam -sHAVE_ICU=1 -d2 -sTOOLS=gcc -sBUILD=release -sEXPAT_INCLUDE=/usr/include -sEXPAT_LIBPATH=/usr/lib stage Afterwards I installed it and rebuilt the test program. It is still failing inside the topological_sort. The output of the program is below along with the test program source code. Stephen --------- OUTPUT ------------ [storri@localhost infrastructure]$ ./test_dag Added edge: 1 -> 20 Number of edges is 1 Added edge: 1 -> 30 Number of edges is 2 Added edge: 1 -> 40 Number of edges is 3 Added edge: 1 -> 5 Number of edges is 4 Added edge: 20 -> 5 Number of edges is 5 Added edge: 30 -> 5 Number of edges is 6 Added edge: 40 -> 5 Number of edges is 7 /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c ++/4.1.1/debug/safe_iterator.h:277: error: attempt to advance a dereferenceable (start-of-sequence) iterator 20 steps, which falls outside its valid range. Objects involved in the operation: iterator @ 0x0xbfead0fc { type = N11__gnu_debug14_Safe_iteratorIN9__gnu_cxx17__normal_iteratorIPN5boost18default_color_typeEN10__gnu_norm6vectorIS4_SaIS4_EEEEEN15__gnu_debug_def6vectorIS4_S8_EEEE (mutable iterator); state = dereferenceable (start-of-sequence); references sequence with type `N15__gnu_debug_def6vectorIN5boost18default_color_typeESaIS2_EEE' @ 0x0xbfead0fc } Aborted ----------- CODE --------------- #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/cstdint.hpp> #include <boost/format.hpp> #include <boost/graph/topological_sort.hpp> #include <iostream> #include <map> class Component; class Graph_Base { public: typedef boost::property< boost::vertex_index_t, boost::uint32_t, boost::property< boost::vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef boost::adjacency_list< boost::setS, // OutEdgeList boost::setS, // VertexList boost::directedS, // Directed VertexProperty_t > // VertexProperties Graph_t; typedef boost::adj_list_vertex_property_map<Graph_Base::Graph_t, boost::shared_ptr<Component>, const boost::shared_ptr<Component>&, boost::vertex_name_t> Property_Map_const_t; }; class Component { public: typedef boost::shared_ptr<Component> ptr_t; Component ( boost::uint32_t id ) : m_id ( id ) {} ~Component () { m_source_list.clear(); } // Now part of Component_Data void set_Data_Source ( uint32_t id ) { if ( ! m_source_list.insert ( std::make_pair ( id, false ) ).second ) { std::cerr << "WARNING: Attempted to add a duplicate component id."; std::cerr << std::endl; std::cerr << "Ignoring component id." << std::endl; } } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_Begin() const { return m_source_list.begin(); } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_End() const { return m_source_list.end(); } boost::uint32_t get_ID (void) const { return m_id; } private: boost::uint32_t m_id; std::map<boost::uint32_t, bool> m_source_list; }; class Component_Graph { public: typedef boost::graph_traits<Graph_Base::Graph_t>::vertex_descriptor Vertex_t; typedef boost::graph_traits<Graph_Base::Graph_t>::edge_descriptor Edge_t; typedef std::map<uint32_t, Vertex_t> IdVertexMap_t; Component_Graph () {} void add_Component ( Component::ptr_t obj_ptr ) { bool no_duplicate; IdVertexMap_t::iterator pos; Vertex_t node; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } boost::tie (pos, no_duplicate) = m_index.insert (std::make_pair(obj_ptr->get_ID(), node)); if ( no_duplicate ) { // Insertion was successful // Make a new vertex and return handle to 'node' node = add_vertex(m_graph); // Get list of Components boost::property_map<Graph_Base::Graph_t, boost::vertex_name_t>::type clist = boost::get(boost::vertex_name, m_graph); // Assign component to vertex position clist[node] = obj_ptr; // Add vertex handle to map position pos->second = node; // Get list of indexes boost::property_map<Graph_Base::Graph_t, boost::vertex_index_t>::type ilist = get(boost::vertex_index, m_graph); ilist[node] = obj_ptr->get_ID(); for ( std::map<boost::uint32_t,bool>::const_iterator cpos = obj_ptr->get_Source_List_Begin(); cpos != obj_ptr->get_Source_List_End(); ++cpos ) { this->add_Child ( (*cpos).first, obj_ptr ); } } else { std::cerr << "ERROR: Duplicate source found. Skipping Component" << std::endl; return; } } void add_Child ( uint32_t parent_id, Component::ptr_t obj_ptr ) { IdVertexMap_t::iterator pos; IdVertexMap_t::iterator cpos; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } pos = m_index.find (parent_id); cpos = m_index.find ( obj_ptr->get_ID() ); if (pos == m_index.end()) { std::cerr << "ERROR: Cannot find parent. Skipping adding component #" << obj_ptr->get_ID() << std::endl; return; } // Add edge from parent to child Edge_t link; if (! (add_edge ( pos->second, cpos->second, m_graph).second)) { std::cerr << "ERROR: Duplicate edge exists from " << parent_id << " to " << obj_ptr->get_ID() << std::endl; } else { std::cout << boost::format("Added edge: %d -> %d") % parent_id % obj_ptr->get_ID() << std::endl; std::cout << "Number of edges is " << num_edges ( m_graph ) << std::endl; } } Graph_Base::Graph_t const& get_Graph () const { return m_graph; } Component::ptr_t get_Component (const Vertex_t& node) const { Graph_Base::Property_Map_const_t clist = get(boost::vertex_name, m_graph); return clist[node]; } private: Graph_Base::Graph_t m_graph; IdVertexMap_t m_index; }; int main (int, char**) { // CREATE Component_Graph Component_Graph m_graph; // Create Components Component::ptr_t node_one ( new Component ( 1 ) ); Component::ptr_t node_twenty ( new Component ( 20 ) ); node_twenty->set_Data_Source ( 1 ); Component::ptr_t node_thirty ( new Component ( 30 ) ); node_thirty->set_Data_Source ( 1 ); Component::ptr_t node_forty ( new Component ( 40 ) ); node_forty->set_Data_Source ( 1 ); Component::ptr_t node_five ( new Component ( 5 ) ); node_five->set_Data_Source ( 1 ); node_five->set_Data_Source ( 20 ); node_five->set_Data_Source ( 30 ); node_five->set_Data_Source ( 40 ); // Add Components to Graph m_graph.add_Component ( node_one ); m_graph.add_Component ( node_twenty ); m_graph.add_Component ( node_thirty ); m_graph.add_Component ( node_forty ); m_graph.add_Component ( node_five ); // Call topological_sort on graph typedef std::vector<Component_Graph::Vertex_t> m_container; m_container comp_list; boost::topological_sort ( m_graph.get_Graph(), std::back_inserter ( comp_list ) ); std::cout << "A topological ordering: "; for ( m_container::reverse_iterator ii = comp_list.rbegin(); ii != comp_list.rend(); ++ii ) { Component::ptr_t comp_ptr = m_graph.get_Component ( *ii ); std::cout << comp_ptr->get_ID() << " "; } std::cout << std::endl; return 0; }

1 0

math toolkit review
by Arnaldur Gylfason 25 Apr '07

25 Apr '07

Hi, This is my contribution to the boost::math review. This is a partial review of components 1) and 2) mentioned in the formal review announcement, i.e. 1) the statistical distributions and 2) special functions. ? What is your evaluation of the design? Very good in my opinion. I think using global functions is very appropriate in libraries such as this one. ? What is your evaluation of the implementation? I did not look at the implementation but I compared it with another implementation and it compares favorably. More on this below. ? What is your evaluation of the documentation? Very clear. I only browsed it, but that was enough to get the feel for the library and start using it right away. ? What is your evaluation of the potential usefulness of the library? Very useful in applications that deal with anything related to statistics or probability. ? Did you try to use the library? With what compiler? Did you have any problems? Yes I used it on a Linux box using g++ 4.0.2. No problems, except I was using version 1.33.0 of boost so I had to change all use of tuple to be in namespace tuples. Took a short time though. ? How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? I guess a quick reading plus I wrote 2 small test programs that compare accuracy and speed with implementations from the R-project. ? Are you knowledgeable about the problem domain? I have been working in a development group in a Statistics department of a genetics company for several years so I guess I'm fairly knowledgeable. ? Do you think the library should be accepted as a Boost library? Yes, definitely. The test programs are compareAccuracy.cc and compareSpeed.cc. The programs were compiled with g++ 4.0.2 using -O3 and run on a Linux box with Intel Xeon 2.4 GHz. I can give more info on this if anyone needs more info. comparAccuracy calls several statistical distribution functions over a range of values, comparing results with what similar routines from the R-project give. The output gives the maximum abs difference and maximum of relative absolute difference between boost::math and R. The results were: norm pdf max diff: 5.55112e-17 norm pdf max rel diff: 2.20594e-16 t pdf max diff: 1.11022e-16 t pdf max rel diff: 1.17145e-15 norm cdf max diff: 1.11022e-16 norm cdf max rel diff: 2.55269e-15 t cdf max diff: 1.59317e-14 t cdf max rel diff: 3.18634e-14 F pdf max diff: 1.77636e-15 F pdf max rel diff: 7.05565e-14 F cdf max diff: 5.55112e-16 F cdf max rel diff: 1.56512e-14 chi2 pdf max diff: 5.55112e-17 chi2 pdf max rel diff: 4.26471e-14 chi2 cdf max diff: 3.46945e-16 chi2 cdf max rel diff: 6.27547e-14 exp pdf max diff: 0 exp pdf max rel diff: 0 exp cdf max diff: 0 exp cdf max rel diff: 0 gamma pdf max diff: 2.77556e-17 gamma pdf max rel diff: 3.84987e-15 gamma cdf max diff: 1.11022e-16 gamma cdf max rel diff: 1.85721e-15 lognorm pdf max diff: 1.11022e-16 lognorm pdf max rel diff: 2.21914e-16 lognorm cdf max diff: 1.11022e-16 lognorm cdf max rel diff: 1.43305e-15 cauchy pdf max diff: 0 cauchy pdf max rel diff: 0 cauchy cdf max diff: 1.11022e-16 cauchy cdf max rel diff: 2.2064e-16 weibull pdf max diff: 1.11022e-16 weibull pdf max rel diff: 2.22042e-16 weibull cdf max diff: 0 weibull cdf max rel diff: 0 norm quantile max diff: 8.88178e-16 norm quantile max rel diff: 4.00185e-16 t quantile max diff: 4.07907e-14 t quantile max rel diff: inf F quantile max diff: 1.11022e-15 F quantile max rel diff: 1.08231e-15 F quantile max diff: 1.11022e-15 F quantile max rel diff: 1.08231e-15 chi2 quantile max diff: 4.26326e-14 chi2 quantile max rel diff: 3.92646e-16 exp quantile max diff: 5.55112e-17 exp quantile max rel diff: 2.11093e-16 gamma quantile max diff: 3.55271e-15 gamma quantile max rel diff: 3.56265e-16 lognorm quantile max diff: 1.42109e-14 lognorm quantile max rel diff: 9.10487e-16 cauchy quantile max diff: 2.17426e-12 cauchy quantile max rel diff: 0.104537 weibull quantile max diff: 1.11022e-16 weibull quantile max rel diff: 2.0992e-16 uniform pdf max diff: 0 uniform pdf max rel diff: 0 uniform cdf max diff: 0 uniform cdf max rel diff: 0 uniform quantile max diff: 0 uniform quantile max rel diff: 0 beta pdf max diff: 1.11022e-15 beta pdf max rel diff: 3.14562e-15 beta cdf max diff: 4.44089e-16 beta cdf max rel diff: 2.9679e-15 beta quantile max diff: 2.22045e-16 beta quantile max rel diff: 8.38281e-16 binom pdf max diff: 2.08167e-17 binom pdf max rel diff: 0.00011212 binom cdf max diff: 9.4369e-16 binom cdf max rel diff: 3.46145e-14 poisson pdf max diff: 1.04083e-17 poisson pdf max rel diff: 1.05393e-13 poisson cdf max diff: 0 poisson cdf max rel diff: 0 nbinom pdf max diff: 1.38778e-17 nbinom pdf max rel diff: 1.16396e-13 nbinom cdf max diff: 8.88178e-16 nbinom cdf max rel diff: 2.37872e-15 lgamma max diff: 1.13687e-13 lgamma max rel diff: 0.211576 tgamma max diff: 7.43092e+142 tgamma max rel diff: 9.15759e-14 A few results need comment. ->t quantile max diff: 4.07907e-14 ->t quantile max rel diff: inf Here division by 0 gives inf. max diff is quite acceptable though. Some guards should be placed to handle 0 or near 0 but I haven't done it. I'm not worried about the accuracy but anyone may feel free to remedy this. ->cauchy quantile max diff: 2.17426e-12 ->cauchy quantile max rel diff: 0.104537 Here we are almost surely again dividing by something near 0. Similar comments as above apply. ->lgamma max diff: 1.13687e-13 ->lgamma max rel diff: 0.211576 Same old story ->tgamma max diff: 7.43092e+142 ->tgamma max rel diff: 9.15759e-14 At the higher end of the range tgamma gives such high numbers, that max diff doesn't tell us much. max rel diff gives acceptable results though. No quantile comparisons are given for the discrete distributions since R always returns integers but boost::math gives fractional values. It depends on application what you want obviously but giving results within the range (discrete in this case) is in some sense more natural. All in all I am quite happy with the results. Obviously R could be wrong but it's use is widespread in the Statistics community so it should be very well tested. comparSpeed calls a few statistical distribution functions repeatedly (see code), timing the loop, repeating the same thing for the R version. The output is the time in second: N repeats = 5000000 R norm pdf: 1.31 boost::math norm pdf: 1.1 R norm cdf: 1.49 boost::math norm cdf: 0.27 R norm quantile: 0.75 boost::math norm quantile: 1.83 R lgamma: 4.02 boost::math lgamma: 7.4 N repeats = 1000000 R t pdf: 0.91 boost::math t pdf: 4.85 R t cdf: 0.17 boost::math t cdf: 0.03 R t quantile: 12.88 boost::math t quantile: 56.15 R F pdf: 0.06 boost::math F pdf: 0.05 R F cdf: 0.07 boost::math F cdf: 0.85 R F quantile: 18.59 boost::math F quantile: 54.54 The results vary somewhat but this would be acceptable for my applications. quantile functions seem to be somewhat slower in boost::math than in R. Maybe they're more accurate. More detailed analysis would be called for if people are concerned about this. The 2 test programs are attached to this message. If they're somehow scrambled, anyone can write to me and ask for them. Last but certainly not the least, my compliments to the authors of boost::math ;-) cheers Arnaldur Gylfason, deCODE genetics

2 1

Regex match problem
by Kalin Nakov 25 Apr '07

25 Apr '07

Hi, I experience big troubles with regex matching. The code below should obviously match 'abc', but does not, because it tries to match the whole string. If r='abcdefg', then match is successfull, but if it is only 'abc' and input is 'abcdef', the match always fails as described below. boost::match_results<std::string::const_iterator> m; std::string inp = "abcdefg"; boost::regex r = "abc"; if (!boost::regex_match(inp, m, r, boost::match_default)) // always fails, don't know why How can I successfully match 'abc' agains input 'abcdefg'? Thank you very much in advance, Kalin

2 1

Re: [Boost-users] Regex match problem
by KLINIK Markus SDI2-G (AREVA NP GmbH) 25 Apr '07

25 Apr '07

You are right, regex_match tries to match the whole input string. What you want is regex_search. Best Regards Markus

1 0

Serialization and filesystem::path
by Hughes, James 25 Apr '07

25 Apr '07

Hello all, Am I right in thinking that I need to provide serialization support for filesystem::path myself because it is not built in to the serialization libraries? If that is the case, what is the best way to go about it? I had thought it was built in originally, but not been able to get things to compile - have I missed something? James 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.

2 1

[std][msvc++][vs2005sp1] unable to open iostream with greek letters in path name
by TOL Tsagarakis Manos 25 Apr '07

25 Apr '07

Hello everyone, I know this is not a boost related issue, but I hope someone has a solution. The question is very simple and should not even be asked: “How can I open a file using std::iostreams, if the files full path, contains Greek letters (or probably any other language except English)?” The test case below shows part of the problem as it successfully opens the file using std::oftream and writes some Greek in it. Then I can read back its contents using std::ifstream. Now the file name in windows explorer or command line should be "ελληνικό όνομα αρχείου.txt" (in case you can't read this, it is "greek file name.txt"). But instead it becomes "åëëçíéêü üíïìá áñ÷åßïõ.txt" Actually when this is done by a full MFC application it is impossible to open the file! I get assertion failure! I use MS Visual Studio 2005 sp1 and std lib and CRT that comes with it. Has anyone faced this problem before? Do I have to do something special in order to be able to use standard iostreams library with Greek file names? Thank you in advanced, Emmanuil Tsagarakis // test_greek_filenames.cpp compile with: /EHsc #include <iostream> #include <fstream> #include <iterator> #include <algorithm> #include <string> #include <vector> #include <assert.h> using namespace std; namespace { struct string_by_line : std::string { }; std::istream & operator >> (std::istream & is, string_by_line & strLine) { getline(is, strLine); return is; } const string s_strFileName("ελληνικό όνομα αρχείου.txt"); } int main(int argc, char **argv) { ofstream ofs; ofs.open(s_strFileName.c_str()); assert(ofs.good()); ofs << "Writing to file ..." << endl; ofs << "Ελληνικά περιεχόμενα στο αρχείο (greek file contents) ..." << endl; ofs.close(); ifstream ifs; ifs.open(s_strFileName.c_str()); assert(ifs.good()); std::vector<std::string> vecContents; std::copy(std::istream_iterator<string_by_line>(ifs ), std::istream_iterator<string_by_line>(), std::back_inserter(vecContents)); for (size_t i=0; i<vecContents.size(); ++i) cout << vecContents.at(i) << endl; ifs.close(); }

2 2

Re: [Boost-users] [SPAM] - Re: [bind, regex] strange MSVC 7.1 compiler effect: Members ofunnamednamespace are put in boost::re_detail when stdafx.hincludesbind.hpp and regex.hpp - E-Mail-Adresse wurde in Betreff-Zeile gefunden.
by Stefan Felkel 25 Apr '07

25 Apr '07

> -----Ursprüngliche Nachricht----- > Von: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]Im Auftrag von > John Maddock > Gesendet: Mittwoch, 25. April 2007 11:38 > An: boost-users(a)lists.boost.org > Betreff: [SPAM] - Re: [Boost-users] [bind,regex] strange MSVC 7.1 > compiler effect: Members ofunnamednamespace are put in > boost::re_detail > when stdafx.hincludesbind.hpp and regex.hpp - E-Mail-Adresse wurde in > Betreff-Zeile gefunden. > > > Stefan Felkel wrote: > > Hi there, > > > > I have a strange compiler effect with Microsoft Visual Studio.NET > > 2003 and boost 1.33.1 in a project that uses bind and regex. All > > Symbols defined in an unnamed namespace are part of the namespace > > boost::re_detail::'anonymous-namespace'. The effect occurres when I > > use precompiled headers and bind.hpp is included before regex.hpp. > > > > This is my stdafx.h which is used to generate the > precompiled header: > > > > #pragma once > > > > #include <boost/bind.hpp> > > #include <boost/regex.hpp> > > > > This is the main source file: > > > > #include "stdafx.h" > > #include "boost/current_function.hpp" > > > > namespace { > > void foo( void ) > > { > > printf( "%s\n", BOOST_CURRENT_FUNCTION ); > > } > > } > > > > int main( int argc, char * argv[] ) > > { > > foo(); > > return 1; > > } > > > > The program generates this output: > > > > void __cdecl boost::re_detail::`anonymous-namespace'::foo(void) > > > > instead of the expected output: > > > > void __cdecl `anonymous-namespace'::foo(void) > > > > When I change the include order in stdafx.h so that regex.hpp is > > included before bind.hpp the output is as expected. > > Has someone else came across such a problem? Is it a compiler bug? > > Weird indeed, I don't believe it's our problem as such: > except that both > regex and bind use unnamed namespaces. Looks like the poor > compiler is > getting confused :-( > > John. > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > I think you're right - Microsoft Visual Studio.NET 2005 doesn't have this problem. Stefan

1 0

Adapter to object instance
by MainBrain 25 Apr '07

25 Apr '07

Hello, im looking through http://www.boost.org/libs/functional/index.html, there are ways to access a class method but i cant find a way to access a method of an object. How can i write an adapter for "instance.bar()" in this example: class foo { int _i; public: bar(); // manipulates _i } instance; Greetings, Yelve Yakut -- View this message in context: http://www.nabble.com/Adapter-to-object-instance-tf3632838.html#a10144039 Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[bind, regex] strange MSVC 7.1 compiler effect: Members of unnamed namespace are put in boost::re_detail when stdafx.h includes bind.hpp and regex.hpp
by Stefan Felkel 25 Apr '07

25 Apr '07

Hi there, I have a strange compiler effect with Microsoft Visual Studio.NET 2003 and boost 1.33.1 in a project that uses bind and regex. All Symbols defined in an unnamed namespace are part of the namespace boost::re_detail::'anonymous-namespace'. The effect occurres when I use precompiled headers and bind.hpp is included before regex.hpp. This is my stdafx.h which is used to generate the precompiled header: #pragma once #include <boost/bind.hpp> #include <boost/regex.hpp> This is the main source file: #include "stdafx.h" #include "boost/current_function.hpp" namespace { void foo( void ) { printf( "%s\n", BOOST_CURRENT_FUNCTION ); } } int main( int argc, char * argv[] ) { foo(); return 1; } The program generates this output: void __cdecl boost::re_detail::`anonymous-namespace'::foo(void) instead of the expected output: void __cdecl `anonymous-namespace'::foo(void) When I change the include order in stdafx.h so that regex.hpp is included before bind.hpp the output is as expected. Has someone else came across such a problem? Is it a compiler bug? Regards, Stefan

2 1

Re: [Boost-users] [program_options] missing typed_value
by Romulus 24 Apr '07

24 Apr '07

>> Hi everybody, [...] >> Here is the error message: >> option_groups.cpp: In function 'int main(int, char**)': >> option_groups.cpp:42: error: 'class >> boost::program_options::typed_value<std::basic_string<char, >> std::char_traits<char>, std::allocator<char> >, char>' has no member named >> 'implicit' >Can you please post some sample here, how you are trying to use it? I >assume there is a problem >with implicit function operator () call. But it would be clearer if you post >some usage sample >here. >With Kind Regards, >Ovanes Markarian The problem occurs with the sample file (attached) : /usr/share/doc/libboost-doc/examples/libs/program_options/example/option_groups.cpp Regards

2 1

boost::thread::thread() crashes in pthread_create
by Venikov, Andy 24 Apr '07

24 Apr '07

Hi all, recently I had to move from Mandrake to RedHat linux. On the new system, a simple thing like this crashes: <------- test.cpp #include <boost/thread/thread.hpp> void * Thread1() { //sleep some time return 0; } int main(int, char**) { boost::thread thread1(Thread1); thread1.join(); return 0; } --------> The crash happens in the create_pthread call in boost::thread constructor. Here's the build command: g++ -c test.cpp g++ test.o ../boost/stage/lib/libboost_thread-gcc-mt.a -lpthread Outuput of g++ --version: g++ (GCC) 3.4.5 20051201 (Red Hat 3.4.5-2) Output of uname -a: Linux joe.rps.local 2.6.9-34.ELsmp #1 SMP Fri Feb 24 16:54:53 EST 2006 i686 i686 i386 GNU/Linux Everythink worked fine on Mandrake. I followed exactly the same steps to build boost on the new system.... Thanks, Andy.

2 1

Maps: one-to-one one-to-many many-to-many
by Travis Parks 24 Apr '07

24 Apr '07

Hello: I am constantly trying to jump into boost. However, I can only read so many pages of documentation before my brain explodes. I have always been interested in a data structure for storing pairs of of keys. In math it is a one-to-one mapping. I find it useful from time to time to have a container that allows me to treat it like an enum, but then to do the operation the other way. I usually do it lazily and just do a map and then do a linear search for the value when I need to. However, I have been thinking about it, and why should I have to suffer linear half the time? So today I wrote a very ugly class that does it log n both ways for me. I did it in less than 30 minutes so it has three methods, namely, insert, get_by_first and get_by_second. It is exceptionally ugly because you have to guaruntee that you will never change the data structure by returning a reference to one of the keys. Worse, if you want to save memory and make sure comparisons work the way you expect them, you have to use two maps of pointers with custom comparison functions that call the user's comparison function with the key-pointers dereferenced! I am wondering if there is something like this already out there already. Or is there a better way of dealing with my issue? I want structures that let me go on to things like one-to-many and many-to-many as well. Of course, what would "many" look like? Would it be an array of the mapped values? Perhaps I should stick with one-to-one! Finally, what would be a good name for this structure? I have been calling it bi-directional map. But this name doesn't carry well for one-to-many and many-to-many. And what should the interface look like? This structure is kind of hard to map to a STL container's interface due to the two keys (no operator[] for instance and no mapped_type or key_type). Thanks for any input! Ask if you want my horrible source code. Ever see two const_casts in one line? Want to?

4 3

SPACE problem in replace_all_regex
by llwaeva＠21cn.com 24 Apr '07

24 Apr '07

Hi there, I am using replace_all_regex to do a batch replace, for instance replace_all_regex( source, boost::regex("(xxx)|(yyy)"), string("(?1 FIRST)(?2 SECOND)"), format_all ); the format string is seperated with (?N XXX) pattern, where N is a decimal number. Using the format string shown above, all xxx will be replaced with " FIRST" (no quotation mark) and yyy will be replaced with " SECOND" (no quotation mark) instead of "FIRST" and "SECOND" (no extra space). Someone said the problem can be solved by rewriting the format string as string("(?1FIRST)(?2SECOND)") However, if the replacing string also begins with a decimal string, this approach doesn't work. For example, if I want to replace xxx with "55FIRST" (without quotation mark), the following function will TRANSLATE: replace the N0. 155 pattern with FIRST, but not replace N0.1 pattern with 55FIRST replace_all_regex( source, boost::regex("(xxx)"), string("(?155FIRST)"), format_all ); How can I solve such probelm? Thanks

1 0