February 2010 - Boost - lists.preview.boost.org

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 17 Feb '10

17 Feb '10

> > it is inevitable, etc., but.. read on. I know at least one library in > > Boost that also spoils function declarations in order to provide > > additional functionality: Concept Check library; they may be others > > too (MPL?). > > My suggestion is that if there are (or will be) libraries that require > > spoiling function declarations, they should all provide the same > > "spoiled" syntax. Otherwise I will be always asking "how do I declare > > a function in this library?". It would be very convenient if Boost > > provided one alternative function definition syntax that when used > > would enable all its libraries to work. > > I agree. However, in the past I did look into harmonizing my library > API with the ones of Boost.ConceptCheck and/or Boost.Parameter but it > did not seem feasible... I will double check it. This is not only about clarity. As a super-correct programmer I may want to apply both concept checking and pre-/post-conditions checking to my functions. Perhaps, if the 'compromise' syntax is possible, it requires changing concept-checking library. Regards, &rzej

1 0

[variadic_templates][mpl]interest in compile time matrix multiplication?
by Larry Evans 17 Feb '10

17 Feb '10

For example, with: > ***domain_matrix: > ( 11 12 13 ) > ( 21 22 23 ) the following: > typedef > outer_product_pack > < plus_times_row_column<arg<1>,arg<2> > > >::apply > < domain_matrix > , domain_matrix > >::type > outer_plus_times_rows_rows; > > std::cout<<"***outer_plus_times_rows_rows:\n"; > for_each<outer_plus_times_rows_rows>(printer); produces: > ***outer_plus_times_rows_rows: > ( 434 794 ) > ( 794 1454 ) The plus and times operations can be replaced with any compile-time binary operation. Any interest? -regards, Larry

4 4

[Boost][gsoc]Intrest - big integer library
by Kamil Witecki 17 Feb '10

17 Feb '10

Hello all, I'd like to propose new library for boost - a Big Integer library. Boost has plenty of applications build upon it and some of them has to use integers greater that those ensured by C++ standard. What is more some of them needs even Pythonlike "unbounded" integers. What I am proposing is library implementing cross-platform library supporting such integers working as standard arithmetic type. Is it a good proposal for GSoC project and who would you recommend as a possible mentor for such project? Pozdrawiam, Kamil Witecki.

10 10

[Boost.Preprocessor] FOREACH( MACRO, ... )
by Daniel Larimer 17 Feb '10

17 Feb '10

Is there a reason why Boost.Preprocessor does not have many (any?) utilities for variadic macros? I have implemented a FOREACH( MACRO, ... ) that results in the following expansion MACRO(ARG1) MACRO(ARG2) ... Implemented as such: #define FOREACH_ARRAY( ... ) (PP_NARG(__VA_ARGS__) , ( __VA_ARGS__ ) ) #define FOREACH( A, ... ) BOOST_PP_REPEAT( PP_NARG(__VA_ARGS__), A, FOREACH_ARRAY(__VA_ARGS__) ) #define CASE(z,n,data) case BOOST_PP_ARRAY_ELEM( n, data ): FOREACH( CASE, a, b, c, d, e) case a: case b: case c: case d: case e: Depends upon this macro: #define PP_NARG(...) \ PP_NARG_(__VA_ARGS__,PP_RSEQ_N()) #define PP_NARG_(...) \ PP_ARG_N(__VA_ARGS__) #define PP_ARG_N( \ _1, _2, _3, _4, _5, _6, _7, _8, _9,_10, \ _11,_12,_13,_14,_15,_16,_17,_18,_19,_20, \ _21,_22,_23,_24,_25,_26,_27,_28,_29,_30, \ _31,_32,_33,_34,_35,_36,_37,_38,_39,_40, \ _41,_42,_43,_44,_45,_46,_47,_48,_49,_50, \ _51,_52,_53,_54,_55,_56,_57,_58,_59,_60, \ _61,_62,_63,N,...) N #define PP_RSEQ_N() \ 63,62,61,60, \ 59,58,57,56,55,54,53,52,51,50, \ 49,48,47,46,45,44,43,42,41,40, \ 39,38,37,36,35,34,33,32,31,30, \ 29,28,27,26,25,24,23,22,21,20, \ 19,18,17,16,15,14,13,12,11,10, \ 9,8,7,6,5,4,3,2,1,0

3 4

[thread] thread_specific_ptr, dangerous conflation of identity and address
by Edd Dawson 16 Feb '10

16 Feb '10

Hi folks, A thread_specific_ptr appears to use its own address as a key. For example, the two tss objects created below will likely share the same key: void f() { thread_specific_ptr<int> ptr; // ... } int main() { f(); f(); } When thread_specific_ptr's destructor is called, it does a reset() which clears the data for the thread doing the destruction. However, data for other threads still remain. I find this asymmetric behaviour a little strange. Why should all threads but one see their old data? The bigger problem though, is that it might not be *their* old data. It can just as easily be someone else's old data due to coincidental alignment of different thread_specific_ptrs on the stack at entirely unrelated points in the program, or even in different libraries that each happen to use boost::thread_specific_ptr! void g() { thread_specific_ptr<float> ptr; // ... } f(); g(); It's easy to see the problem here as the calls are very close to one another. In general, however, this strikes me as being really rather dangerous behaviour. Would it be fair to call it a bug? It seems it is only safe to allocate thread_specific_ptrs in static storage. A complete example is listed at the end. It exhibits the kind of behaviour I'm talking about on my x86 systems, at least. Kind regards, Edd //#define BOOST_ALL_NO_LIB 1 #include <queue> #include <iostream> #include <boost/thread/tss.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/barrier.hpp> #include <boost/thread/condition.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> using namespace boost; typedef function<void ()> task_type; // Simple multi-producer-single-consumer job queue. // Manages its own consumer thread. class jobq { public: jobq() : dying_(false), consumer_(bind(&jobq::work_loop, this)) { } ~jobq() { exit_work_loop(); consumer_.join(); } void add(const task_type &task) { unique_lock<mutex> lk(mtx_); tasks_.push(task); arrival_.notify_one(); } private: void exit_work_loop() { unique_lock<mutex> lk(mtx_); dying_ = true; arrival_.notify_one(); } bool wait_for_task(task_type &task) { unique_lock<mutex> lk(mtx_); while (!dying_ && tasks_.empty()) arrival_.wait(lk); if (dying_) return false; task = tasks_.front(); tasks_.pop(); return true; } void work_loop() { task_type task; while (wait_for_task(task)) task(); } private: bool dying_; std::queue<task_type> tasks_; mutex mtx_; condition arrival_; thread consumer_; }; template<typename T> void access_tsp(thread_specific_ptr<T> &tsp, barrier &b) { if (!tsp.get()) tsp.reset(new T(-1)); else std::cout << "Already initialized to " << *tsp << "!\n"; b.wait(); } template<typename T> void f(jobq &q) { barrier b(2); thread_specific_ptr<T> tsp; q.add(bind(&access_tsp<T>, ref(tsp), ref(b))); b.wait(); // wait until it's safe to destroy tsp } int main() { jobq q; f<int>(q); f<unsigned>(q); return 0; }

4 6

Re: [boost] [Boost][gsoc]Intrest - big integer library
by Kamil Witecki 16 Feb '10

16 Feb '10

I see that even a simple, but robust, implementaion covering each case (possibly some of them awaiting implementations of apropriate policy) would be hard, if not infeasible, to be done in such a short period of time as is given in GSoC. On the other hand I would take a deeper look in that topic and meanwhile look for another proposition. Many thanks for all your answers and clarifiyng all the infarmation and possible problems. Kamil Witecki.

1 0

Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

okay, I got it. Okay, I never cared about the project-config.jam file (maybe because the user_config file is mentioned after bootsrap.sh). I just put the using intel-linux stuff inside projetc-config: if ! intel-linux in [ feature.values <toolset> ] { using intel-linux : 10.1 : /lrz/sys/intel/icc_101/bin/icpc : <compileflags>"-fPIC" <linkflags>"-fPIC" ; } instead of the user_config. That's it. Don't know why it doesn't work for intel with user_config but for the gcc. However, I hope it'll work.. Thank @all, SirAnn -- NEU: Mit GMX DSL über 1000,- ¿ sparen! http://portal.gmx.net/de/go/dsl02

1 0

Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

@ Normal 0 21 false false false DE X-NONE X-NONE Volodya > Well, just do that in project-config.jam? Or, alternatively, remove project-config.jam -- and have only user-config.jam be used. Okay, but which one is that? (location?) I can see your name in the jam files very often, thus you are to be the one who can help me out, dont' ya? @Dick Normal 0 21 false false false DE X-NONE X-NONE >If you build an executable that will dynamically load (with dlopen) shared libraries, then all of its code, including whatever it gets from static libraries, has to be compiled and linked with -fPIC. >This leads us to compile and link all of our code, including boost libraries, with -fPIC. bullseye! that's the problem that we have.. thus we have to turn on the fPIC option.. But I don't get it work for the intel compiler.... Do you have a solution? -- Sicherer, schneller und einfacher. Die aktuellen Internet-Browser - jetzt kostenlos herunterladen! http://portal.gmx.net/de/go/chbrowser

3 2

boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

Hello I just try to compile boost 1.42 on the Altix-HPC in Munic. Problem is that I need to compile it with turned on -fPIC cxx-flag. Following steps I'd done: 1. run ./bootstrap.h --prefix=... --with-toolset=intel-linux 2. modify tools/build/v2/user_config.jam: ... using intel-linux : : : <cxxflags>-fPIC ; ... (according to http://www.boost.org/boost-build2/doc/html/bbv2/reference/tools.html#bbv2.r…) 3. run ./bjam --> error: error: at /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/project.jam:884 error: duplicate initialization of intel-linux with the following parameters: error: version = <unspecified> error: previous initialization at /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/project.jam:884 What's the matter? What point did I miss? Please help ;-) SirAnn -- Sicherer, schneller und einfacher. Die aktuellen Internet-Browser - jetzt kostenlos herunterladen! http://portal.gmx.net/de/go/chbrowser

4 4

Re2: boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

Normal 0 21 false false false DE X-NONE X-NONE > Take a look at project-config.jam -- it already has 'using intel....'. > I suggest you remove whatever setting you've made in tools/build/v2/user-config.jam. But that's especially what I wanna to: add the fPIC flag for the gcc version it works fine!) > Further, why are you even trying to use -fPIC. When building shared libraries, -fPIC is used already. Some of our guys have to link because of certain reasons against the static libs from boost and obtain the error boost should be compiled with turned on fPIC flag... -SirAnn -----Ursprüngliche Nachricht----- Von: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] Im Auftrag von Vladimir Prus Gesendet: Dienstag, 16. Februar 2010 17:18 An: boost(a)lists.boost.org Betreff: Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC "Sören Freudiger" wrote: > Hello > I just try to compile boost 1.42 on the Altix-HPC in Munic. Problem is > that I need to compile it with turned on -fPIC cxx-flag. > > Following steps I'd done: > > 1. run ./bootstrap.h --prefix=... --with-toolset=intel-linux 2. modify > tools/build/v2/user_config.jam: > > ... > using intel-linux : : : <cxxflags>-fPIC ; ... > > (according to > http://www.boost.org/boost- build2/doc/html/bbv2/reference/tools.html#bbv2.reference.tools.compiler.intel) > > 3. run ./bjam > > --> error: > error: at > /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/proj > ect.jam:884 > error: duplicate initialization of intel-linux with the following > parameters: > error: version = <unspecified> > error: previous initialization at > /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/proj > ect.jam:884 > > What's the matter? What point did I miss? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost -- NEU: Mit GMX DSL über 1000,- ¿ sparen! http://portal.gmx.net/de/go/dsl02

1 0

[BGL/PM] Composition of two property maps
by Matthias Walter 16 Feb '10

16 Feb '10

Hi, I currently have a function which gets a graph plus an index-map and want's to call a BFS. Therefore it needs to build a color-map which maps vertex_descriptors to colors. As the user already gives a way to map vertex_descriptor to index, I'd like to use this mapping. What I need is a way to define a property map as a composition: composed-map (vertex_descriptor) -> color via color-map (index-map (vertex_descriptor)) -> color whereas index-map (vertex_descriptor) -> index and color-map (index) -> color Of course this should not be too difficult to implement, so I'd just like to ask whether there already exists some kind of implementation, because I neither found a hint by looking in the docs, nor by digging through some of the code. The actual reason I ask is because there might be other ways to come around the problem, e.g. making the color-map itself use vertex_descriptors as keys, so maybe my suggested solution is not the best. best regards Matthias Walter

2 1

C++0x and MSVC 10
by Zachary Turner 16 Feb '10

16 Feb '10

Playing with the release candidate of MSVC 10, and I'm noticing boost 1.42.0 is not using any C++0x features. Has this been discussed before, or is there a reason for this? Taking a peek at boost/config/compiler/visualc.hpp, I see the following: #if _MSC_VER < 1600 #define BOOST_NO_AUTO_DECLARATIONS #define BOOST_NO_AUTO_MULTIDECLARATIONS #define BOOST_NO_DECLTYPE #define BOOST_NO_LAMBDAS #define BOOST_NO_RVALUE_REFERENCES #define BOOST_NO_STATIC_ASSERT #define BOOST_NO_NULLPTR #endif // _MSC_VER < 1600 // C++0x features not supported by any versions #define BOOST_NO_CHAR16_T #define BOOST_NO_CHAR32_T #define BOOST_NO_CONCEPTS #define BOOST_NO_CONSTEXPR #define BOOST_NO_DEFAULTED_FUNCTIONS #define BOOST_NO_DELETED_FUNCTIONS #define BOOST_NO_EXPLICIT_CONVERSION_OPERATORS #define BOOST_NO_EXTERN_TEMPLATE #define BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS #define BOOST_NO_INITIALIZER_LISTS #define BOOST_NO_RAW_LITERALS #define BOOST_NO_SCOPED_ENUMS #define BOOST_NO_SFINAE_EXPR #define BOOST_NO_TEMPLATE_ALIASES #define BOOST_NO_UNICODE_LITERALS #define BOOST_NO_VARIADIC_TEMPLATES It almost appears as if the #else was simply forgotten on the first #if. Can't we safely change the first conditional to the following? #if _MSC_VER < 1600 #define BOOST_NO_AUTO_DECLARATIONS #define BOOST_NO_AUTO_MULTIDECLARATIONS #define BOOST_NO_DECLTYPE #define BOOST_NO_LAMBDAS #define BOOST_NO_RVALUE_REFERENCES #define BOOST_NO_STATIC_ASSERT #define BOOST_NO_NULLPTR #else #define BOOST_HAS_AUTO_DECLARATIONS #define BOOST_HAS_AUTO_MULTIDECLARATIONS #define BOOST_HAS_DECLTYPE #define BOOST_HAS_LAMBDAS #define BOOST_HAS_RVALUE_REFERENCES #define BOOST_HAS_STATIC_ASSERT #define BOOST_HAS_NULLPTR #endif // _MSC_VER < 1600 Zach

7 13

boost/cstdint.hpp definition of INTMAX_C conflicts with MPFR
by Vincent Lefevre 16 Feb '10

16 Feb '10

Hi, I'm a MPFR developer and the following problem with Boost has been reported in the MPFR mailing-list. As of Boost 1.42, the macros INTMAX_C and UINTMAX_C (in particular) are always defined, and on a system without <stdint.h> (Microsoft C++ compiler), the build of a program using Boost 1.42 and MPFR failed. The reason is that mpfr.h supports systems with and without intmax_t (so that it does not force <stdint.h> inclusion), thus it must have a way to determine when intmax_t is available, without requiring the user to do anything else than including <stdint.h> first. So, it has several heuristics, one of them being the test of the existence of INTMAX_C and UINTMAX_C. Indeed, in C, which does not have namespaces, it is rather intuitive that the existence of INTMAX_C and UINTMAX_C implies that the corresponding types intmax_t and uintmax_t are available. However, in C++ with Boost, intmax_t and uintmax_t are not necessarily available (in the global namespace). Even though one could specify a macro for MPFR that would allow the user to disable (u)intmax_t support explicitly, I think that Boost's behavior is rather awkward, and may break other software too (in particular libraries that would do the same kind of things as Boost). Indeed (correct me if I'm wrong, I don't know very much about C++), while types have namespaces, macros don't, but there are conventions under which using a prefix such as BOOST_ can be used in place of a namespace (to avoid conflicts with other software). So, I wonder why Boost doesn't do the following: since it defines the intmax_t and uintmax_t types in the boost namespace, it should use the BOOST_ prefix for the corresponding macros, e.g. BOOST_INTMAX_C and BOOST_UINTMAX_C. The only acceptable artifact concerning these types would be that additional types and macros be defined due to the inclusion of standard headers such as <stdint.h>; but in such a case, the behavior would remain consistent (i.e. INTMAX_C and UINTMAX_C would be defined only if intmax_t and uintmax_t are available). If, for some reason, Boost really needs to define the INTMAX_C and UINTMAX_C macros, then it should also define intmax_t and uintmax_t in the global namespace. But I don't think that's a good idea. Regards, -- Vincent Lefèvre <vincent(a)vinc17.net> - Web: <http://www.vinc17.net/> 100% accessible validated (X)HTML - Blog: <http://www.vinc17.net/blog/> Work: CR INRIA - computer arithmetic / Arénaire project (LIP, ENS-Lyon)

2 4

[thread] Moving a `recursive_lock`
by Daniel Trebbien 16 Feb '10

16 Feb '10

Hello all, I have been working on a project that uses the Boost Thread library, and I realized that there is a part of the code that needs to transfer a lock to a thread that has just been started. My idea for implementing this was to use a `boost::recursive_mutex` and pass a non-`const` reference to a `boost::recursive_mutex::scoped_lock` to the thread via `boost::ref`. Also, to ensure that the `scoped_lock` does not go out of scope until until the lock is moved, I thought to use a `boost::barrier`. After writing some test code, I find it interesting that if I use a `recursive_mutex`, then an assertion fails, but if I use a `boost::mutex`, then the code seems to work fine. Here is the test code that I have been experimenting with (the `recursive_mutex` version, which is also attached): #include <iostream> #include <boost/ref.hpp> #include <boost/thread.hpp> static boost::recursive_mutex s_mutex; static boost::barrier s_lockMoveBarrier(2); void thread_fun1(boost::recursive_mutex::scoped_lock& lock_) { //boost::recursive_mutex::scoped_lock testLock(s_mutex); // uncommenting this causes deadlock, as expected std::cout << "in `void thread_fun1(...)`: moving lock..."; boost::recursive_mutex::scoped_lock lock2(boost::move(lock_)); std::cout << "done" << std::endl; s_lockMoveBarrier.wait(); std::cout << "in `void thread_fun1(...)`: after the barrier" << std::endl; } int main() { boost::recursive_mutex::scoped_lock lock(s_mutex); std::cout << "in `int main()`: lock on `s_mutex` acquired" << std::endl; boost::thread(&thread_fun1, boost::ref(lock)); s_lockMoveBarrier.wait(); std::cout << "in `int main()`: after the barrier" << std::endl; } After compiling and running this on Debian Squeeze with Boost 1.42.0, I get: in `int main()`: lock on `s_mutex` acquired in `void thread_fun1(...)`: moving lock...done in `int main()`: after the barrier a.out: /usr/local/include/boost/thread/pthread/recursive_mutex.hpp:62: boost::recursive_mutex::~recursive_mutex(): Assertion `!pthread_mutex_destroy(&m)' failed. Aborted After replacing "boost::recursive_mutex" with "boost::mutex", however, the output is: in `int main()`: lock on `s_mutex` acquired in `void thread_fun1(...)`: moving lock...done in `void thread_fun1(...)`: after the barrier in `int main()`: after the barrier This leads me to wondering: 1. Is it correct and/or safe to move a lock to a new thread in this way? 2. Why does the `recursive_mutex` version fail and the `mutex` version succeed? Daniel Trebbien

3 3

Re: [boost] [Boost][gsoc]Intrest - big integer library
by Kamil Witecki 15 Feb '10

15 Feb '10

>Given the number of times which a big integer library has been >started, I'd be wary of suggesting it as a GSoC project. I did not thought it would be so hard to be done. >Since there are already many C big integer libraries (with various >licenses), I'd be far more interested in an expression template system >that would let me hook in the operations I need. That way if I'm ok >with LGPL I can just use GMP, for instance. Also, a naive >implementation could be provided for testing and verification. It sounds very good. And does not involve reinventing the wheel from scratch as would do a new implementation of big integers. You would recommend creating expression templates that will allow to bind operators (functions or functionals) and types(for example big integers from third party library) together using type traits and passing functional as template parameter, have I got your idea right? >I remember hearing that someone had started something like that, but I >don't know its progress. I will take a deeper look if anybody has done it already. >~ Scott -- Kamil Witecki.

2 1

[filesystem] Mac OS default codecvt facet
by Beman Dawes 15 Feb '10

15 Feb '10

On Mac OS, Boost.Filesystem currently uses std::locale() as the default, since Apple doesn't see fit to support std::locale(""). There has been a request (ticket #3928) to change the codecvt facet to UTF-8 for the Boost.Filesystem default on Mac OS. This would at least potentially be a breaking change, so I wanted to ask other's opinions before making it. Questions: * Is UTF-8 OK with Mac OS users as the Boost.Filesystem default? * Would Linux users also prefer UTF-8 as the Boost.Filesystem default? Thanks, --Beman

2 6

Downcast taking account of virtual inheritance
by vicente.botet 15 Feb '10

15 Feb '10

Hi, I have a generic class that needs to downcast from a base class to a template class. The template class can use virtual inheritance or not. When the derived class use virtual inheritance I need to use dynamic cast, but not on the other cases. I'm wondering if a new downcast function that will take in account these facts would be of interest in Boost. clase B {...}; class D : public B {...}; class DV : public virtual B {...}; B* ptr; ptr= new D(); D* dPtr = downcast<D*>(ptr); // uses static_cast as is_virtual_base_of<B,D>::type is false ptr= new DV(); DV* dPtr = downcast<DV*>(ptr); // uses dynamic_cast as is_virtual_base_of<B,DV>::type is true What would be a good name for this downcast function? Best, _____________________ Vicente Juan Botet Escribá

6 11

[config] macors with variable arguments support
by vicente.botet 15 Feb '10

15 Feb '10

Hi, is threa macro to know if the compiler supports macros with variable arguments? Best, _____________________ Vicente Juan Botet Escribá

1 0

incomplete_smart_cast: a smart_cast to incomplete types
by vicente.botet 14 Feb '10

14 Feb '10

I have another user case: template <class Final, typename Base=base_transaction_object> class deep_transaction_object : public Base { Final* final() { return static_cast<Final*>(this); } const Final* final() const { return static_cast<Final const*>(this); } public: static Final* make_cache(Final const* rhs, transaction& ) { return new Final(*rhs); } virtual base_transaction_object* make_cache(transaction& t) const { return new Final(*final()); } virtual void delete_cache() { delete this; } virtual void copy_cache(base_transaction_object const & rhs) { *final() = *smart_cast<Final const*>(&rhs); // (1) } }; deep_transaction_object is a mixin class that is be used as follows class F : public deep_transaction_object<F> {...}; At the moment we use smart_cast in deep_transaction_object (1), F is not completly defined. smart_cast is a template class that needs its class parameters to be completly defined, as is_virtual_base_of needs this. In this context I can not check if Final is_virtual_base_of base_transaction_object. As F is a deep_transaction_object<F> which is a Base, the check could be limited to see if Base is_virtual_base_of base_transaction_object. Thus I need a kind of incomplete_smart_cast which in addition has an intermidiate class used for the tests *final() = *incomplete_smart_cast<Final const *, Base const*>(&rhs); incomplete_smart_cast<Target,Intermediate, Source> works like smart_cast except that instead of testing with Target, it test with Intermediate to select the cast to apply to target incomplete_smart_cast<F*, I*>(ptr) = static_cast<F*,smart_cast<I*>(ptr)> For the case of single inheritance this seems to too much to add, but with multiple inheritance the situation we can not build it from static_cast and smart_cast, we need to check if one of the intermediate classes is_virtual_base_of the base class. For example if the mixin allows to inherit from two classes template <class Final, class Base1, class Base1> class deep_transaction_object2 : public Base1, public Base2 { ... virtual void copy_cache(base_transaction_object const & rhs) { *final() = *incomplete_smart_cast2<Final const*, Base1 const*, Base2 const*>(&rhs); // (1) } }; Please let me know if my rationale is correct and if my use case is enough common to interest the Boost community. Best _____________________ Vicente Juan Botet Escribá

1 0

boost::any_ref and boost::any_const_ref
by Daniel Larimer 14 Feb '10

14 Feb '10

I am attempting to create a library with a generic interface run-time interface and have need for something like boost::any; however, boost::any requires heap allocation. boost::variant is not acceptable either because I do not know the full set of types in advance. Has anyone seen the equivalent of a type-checked void* or const void*? Effectively I would like to create a polymorphic method like this: void myclass::method( const_any_ref p1, const_any_ref p2, const any_ref p3 ) { const uint16_t& _p1 = p1; const double& _p2 = p2; const std::string& _p3 = p3; //If any of the types do not match it should throw an exception. alternatively the follow syntax may work if you want to avoid exceptions? boost::optional<const uint16_t&> _p1 = p1; if( !_p1 ) // cast failed? } Anyone have any nifty ideas on how to accomplish this without RTTI and no heap allocation? In place of RTTI I do have a "manual" RTTI system that I could use. get_typename<T>::str will return a unique const char* pointer. I am guessing the best I can hope for is a pair of pointers, one "void*" and one const char*. I am going to write such a class unless someone here knows of an existing solution. Dan

1 1

[vault][msm] Where has the vault gone?
by Agustín K-ballo Bergé 14 Feb '10

14 Feb '10

http://www.boostpro.com/vault/ gives a 404 - Not Found I'm trying to get the latest MSM version. Is there anywhere else I can get it? Agustín K-ballo Bergé.-

3 3

Re: [boost] [vault][msm] Where has the vault gone?
by Christophe Henry 13 Feb '10

13 Feb '10

> You can find it in sandbox > http://svn.boost.org/svn/boost/sandbox/msm/ Small precision, I use it as my "trunk" version. It is stable but the documentation still lags the code state (I am in the rewriting process). The last stable version and with up-to-date documentation (the one from the vault + a few bugfixes / performance improvements) is in: http://svn.boost.org/svn/boost/sandbox/msm/tags/version-2.0/ >For SF right link is http://sourceforge.net/projects/boost-msm/ And I didn't even advertise it :) I plan to use SF so that one could request and try some features before they make it into the official code, but I need to finish the project page first, so for the moment, you will find not much there. Christophe

1 0

Re: [boost] [serialization] Can one deserialize a derived classes viapointers to the base class using polymorphic archives in aDLL context?
by Bogdan 13 Feb '10

13 Feb '10

Robert Ramey <ramey <at> rrsd.com> writes: > >> > >> Please note BOOST_CLASS_EXPORT_IMPLEMENT is used only once per class > >> (inside polymorphic_derived2.cpp), yet the serializers are inserted > >> in the same map both from the Dll and from the executable. > >> > >> Am I doing something wrong? Has anyone been able to create a similar > >> working example? I really appreciate any feedback I could get. > > It looks like polymorphic_derived2.cpp is being included in both the > mainline as well as the DLL. > > It's not clear that polymorphic_base needs to be n the DLL and probably > shouldn't be. > > Make sure that your header includes BOOST_CLASS_EXPORT_KEY and not > BOOST_CLASS_EXPORT. > > finally, make sure that the test for this facility works. > > Robert Ramey > Thank you Robert for your quick response: I appreciate a lot the generous work you put in the library. I double checked the project I previously uploaded: I downloaded it via gmane.org, changed the name back from bin to zip and verified the following: - polymorphic_derived2.cpp file is included only in dll_polymorphic_derived2.vcproj. - there are only three projects dll_polymorphic_derived2, Library and test_dll_exported plus an explicit reference to the bjam files (I removed the latter after downloading); - there is no usage BOOST_CLASS_EXPORT; - there are exactly three declarations of BOOST_CLASS_EXPORT_KEY: one in polymorphic_base.hpp, and two in polymorphic_derved2.hpp one for polymorphic_derived1 and another for polymorphic_derived2. Similarly, there are only three usages of BOOST_CLASS_EXPORT_IMPLEMENT. There was only one question mark: test_dll_exported.vcproj depended on dll_polymorphic_derived2 both via Project Dependencies option and explicitly as an input library: to be on the safe side, I removed the explicit dependency of test_dll_exported on dll_polymorphic_derived2 from the solution. I rebuild the solution from scratch. Unfortunately I got the same exception. So I am still cornered and looking for some help. Thank you again, Bogdan

1 0

[serialization] Can one deserialize a derived classes via pointers to the base class using polymorphic archives in a DLL context?
by Bogdan 13 Feb '10

13 Feb '10

Hi all, I am trying to upgrade to boost 1.42 using Visual Studio 2008 and I have difficulties using serialization with polymorphic archives in a DLL setup. I would like to encapsulate in one DLL the class serialization functionality based on a polymorphic base archive. In another place, I would like to perform the actual serialization/deserialization using a specific archive (e.g., polymorphic_text_[io]archive). The section "Special Considerations" of the documentation indicates in two paragraphs ("DLLS - Serialization and Runtime Linking" and " Plugins") that this scenario is supported by the library. However I couldn't find any example that shows how to do that. Therefore, I changed slightly the boost test that includes test_dll_exported.cpp and polymorphic_derived2.cpp as follows: 1. I moved the classes polymorphic_base and polymorphic_derived1 to the project polymorphic_derived2 This way, we have one place where those classes serialize their members (i.e., polymorphic_derived2.dll) and a separate binary where we serialize them via a derived archive (i.e., test_main() inside test_dll_exported.exe); 2. I replaced the template version of the serialization functions with the equivalent version based on boost::archive::polymorphic_[io]archives. I also removed the text-based instantiation inside the Dll. As indicated in the boost documentation, the class serialization will only have to be compiled once for all archive implementations (present or future). Therefore, the DLL should contain only the serialization functions to the base polymorphic archives. While everything builds correctly, at run time I get a C++ exception BEFORE main() in basic_serializer_map.cpp around the line 48: // if this fails, it's because it's been instantiated // in multiple modules - DLLS - a recipe for problems. // So trap this here if(!result.second){ boost::serialization::throw_exception( archive_exception( archive_exception::multiple_code_instantiation, bs->get_debug_info() ) ); } Please note BOOST_CLASS_EXPORT_IMPLEMENT is used only once per class (inside polymorphic_derived2.cpp), yet the serializers are inserted in the same map both from the Dll and from the executable. Am I doing something wrong? Has anyone been able to create a similar working example? I really appreciate any feedback I could get. Thank you, Bogdan PS For more info I attached the files describing my problem plus the .sln file (I used the configuration "Debug runtime-dynamic threading-multi")

2 1

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 13 Feb '10

13 Feb '10

> I am thinking to submit a library for Contract Programming (a.k.a. > Design By Contract (TM) ) for C++. > I have drafted some of the library documentation in Boost-like format: > http://dbcpp.sourceforge.net/boost/libs/contract/doc/html/ > Comments? Hi, I would be very interested in trying such a library. I have one suggestion, which may be impossible to implement, but I think it would be worth at least looking at. The macros for defining assertions spoil function declarations. I know it is inevitable, etc., but.. read on. I know at least one library in Boost that also spoils function declarations in order to provide additional functionality: Concept Check library; they may be others too (MPL?). My suggestion is that if there are (or will be) libraries that require spoiling function declarations, they should all provide the same "spoiled" syntax. Otherwise I will be always asking "how do I declare a function in this library?". It would be very convenient if Boost provided one alternative function definition syntax that when used would enable all its libraries to work. Regards, &rzej

2 1

Interest in Remote Procedure Call Library?
by Daniel Larimer 13 Feb '10

13 Feb '10

I have been playing with some code and recently developed a very efficient, extensible, and easy to use API for performing remote procedure calls (with multiple protocols). I am writing to gauge interest and get feedback on the user API. The native "protocol" is a custom combined tcp/udp protocol using multi-cast for discovery, but it would be very easy to add a shared memory solution, a dbus, XML/RPC, CORBA, etc back end to the user api. Example: class SomeClass { public: int add( int a, int b ) { return a + b ); void sub( int a, int b, int* result ) { if(result) *result = a -b; }; void inout( int& a ) { a += 5; } }; META_INTERFACE( SomeClass, METHOD(add) METHOD(sub) METHOD(inout) ) // server SomeClass myclass; Server myserver( &myclass, "my.named.service" ); // client RemoteInterface<SomeClass> ri( "my.named.service" ); int result = ri.add(1,4); assert( result == 5 ) ri.sub( 5, 1, &result ); assert( result == 4 ); ri.inout(result); assert( result == 9 ); API can support any type that is serializable. It also supports the signal/slot paradigm. SomeClass could have any number of base-classes both virtual and non-virtual. With respect to performance, it can perform 15,000+ synchronous (invoke, wait for return) operations per-second on localhost/linux. Asynchronous operations are capable of 500,000+ invokes/sec. The library doubles as a built-in reflection system allowing run time inspection member functions, parameter types, inheritance, etc. I am working to convince my employer (small company of 25) that contributing this library would bring more benefits than "costs" to the company. The reasons I think it is a good idea include: 1) Expose the company to more people (marketing) 2) We can give our customers an "open" API for communicating with our products 2) Offload some of the development / maintenance / support to the open source community 3) I like open source and have personal reasons for wanting it free and open. So I need to get some more support to convince my employer that this will be a good move. Active interest would be a good sign. Other ideas on the positive aspects of contributing vs keeping it internal would also help me make my case. Thanks, Dan

7 33

WARNING: BoostBook build change..
by Rene Rivera 13 Feb '10

13 Feb '10

In response to the whole, using Boost logo outside of real Boost Libraries, I changed the BoostBook XSL slightly to: * Default to not including a navbar. * Default to not including the Boost logo in the navbar, when one expressly asks to include the navbar. I changed the Boost Jamroot to include the two options one needs to get back the standard Boost navbar+logo: <xsl:param>nav.layout=horizontal <xsl:param>boost.image=Boost The "boost.image" param is new and lets one specify: none (for no logo image), Boost (for the boost.png image), or anything else (for your own custom image. So.. WARNING: You may have to change your doc builds if you previously assumed that the navbar or logo would show up outside of Boost to include the above options (or some version thereof). -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org (msn) - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

bcp utility documentation
by Jeroen Habraken 13 Feb '10

13 Feb '10

Hi, I just noticed that http://www.boost.org/doc/libs/1_42_0/tools/bcp/bcp.html which is linked to from the main boost.org page under documentation leads to a 404. The page used to exist as http://www.boost.org/doc/libs/1_41_0/tools/bcp/bcp.html. Regards, Jeroen Habraken

2 2

[property_tree] Proposal for Boost.Property_Tree put function
by Andrew Hundt 12 Feb '10

12 Feb '10

I have been using the boost::property_tree in one of our products, and have become frustrated by an inconsistency between two of the convenience functions. The basic_ptree get function allows the specification of a separate delimiter when specifying the path, such as: pt.get<float>('/', "p.a.t.h/t.o/v.a.l.u.e"); However, there is no similar way to call put to place the same value as follows: pt.put('/', "p.a.t.h/t.o/v.a.l.u.e", 3.14f); I would like propose the addition of functions to allow consistency between the use of get and put functions. The basic use of these functions is described in http://www.boost.org/doc/libs/1_42_0/doc/html/boost_propertytree/accessing.… Are there any thoughts or comments? Regards, Andrew Hundt

1 0

[1.3.9][hpux]:pthread_create syambol does not exist in boost.1.3.9 library
by gopal haldar 12 Feb '10

12 Feb '10

Hi I built both boost.1.3.2 and boost 1.3.9 in the hpux 11.23 system. I can see the pthread_create symbol in boost 1.3.2 library but not in boost1.3.9 thread library. Due to this issue, my application crashing hpux 11.11 with boost 1.3.9 system and showing message "pthead_create symbol not found" in the boost thread library but working fine with 1.3.2. Please let me know the solution. Regards Gopal

2 1

[transact] code in sandbox
by strasser＠uni-bremen.de 11 Feb '10

11 Feb '10

Hi, I haven't had much time lately, and that's not going to change to next couple of weeks, so I've uploaded what I have so far to the sandbox: https://svn.boost.org/svn/boost/sandbox/transaction/boost/transact/ what's new: *** basic_transaction_manager: - now supports all kinds of combinations of commits, like we've discussed, including one-phase/transient two-phase, persistent two-phase. no logging/recovery yet. - lazy and non-lazy transaction construction, user-configurable *** simple_transaction_manager: a transaction manager supporting only one resource. basic_tranaction_manager includes a lot of MPL/fusion and the logging infrastrucure, none of which is needed for only one resource. this is intended to be the default transaction manager when one of our libraries is used on its own. *** logging infrastructure: to be used by basic_transaction_manager for its distributed transaction log, and optionally by resource managers that need logging (so it is part of the public interface!) - olog_files: maintaining log files without knowing its contents, manual log rolling - otransaction_log_files: same as olog_files, but automatic log rolling based on transactions - olog: writes to olog_files, aware of log entries - olog_buffer: same interface as olog, but buffers log entries locally and only accesses the log when the internal buffer overflows. - TODO: ilog_files/ilog to read/recover from logs. code is there, but not migrated to "transact". - TODO: interleaved_ologs/..., providing multiple olog interfaces so different resource managers can share a log, as we've discussed. *** new syntax for transaction scopes: syntax changed from: atomic{ ... }retry; to do atomic{ }commit(); I prefer that syntax because it resembles the do{}while(...) syntax. downside is that it conflicts with transaction::commit() if the user chooses to define BOOST_TRANSACT_COMMIT to "commit" (as is done above). *** TODO object_access not migrated to "transact" yet. utility functions for resource managers to serialize/clone/compare/... objects. regards, Stefan

2 4

Re: [boost] Iterator facade example could use some changes/documentation adjustments
by Jacob McIntosh 11 Feb '10

11 Feb '10

> From: Jeffrey Hellrung <jhellrung(a)ucla.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Iterator facade example could use some > changes/documentation adjustments > > I think this is a valid concern, though I'm guessing this would cause > problems at most infrequently. I'm having difficulty coming up with a > use case where this would be a problem. Did you stumble upon this while > writing "real" code? It just came to mind while I was writing some of my own iterators. I wasn't even using iterator facade to do it, as I ended up using raw pointers for iterators in my use case, but I started looking at the documentation for is_convertible to figure out why they chose that conversion, and noticed the other behavior. And, though I personally haven't used that in real code, I could imagine a developer having the bright idea of converting a derived iterator into a base one thinking it will _only_ remove his need to explicitly cast the value provided by the derived iterator for whatever purpose. But, even disregarding that, on a more basic level... using is_convertible to allow conversion from non-const to const iterators is really doing more than just that. It's letting you do a host of other things as well... and though my example involved derived classes, The same would happen in cases like converting an integer iterator into a double iterator, as is_convertible returns true in that case as well. Any time the size of the types is different, it could cause problems. This is arguably a very stupid usage of iterators, but if we can enforce proper usage via compile time errors rather than runtime errors... why not? > > Would this motivate the existence of an is_iterator_convertible > metafunction, which is identical to is_convertible except for pointers? > > - Jeff > I'm not sure what there is to gain from this, would have to see what functionality is_iterator_convertible would provide. IMO, it doesn't make a whole lot of sense to convert an iterator<A> to iterator unless A == const B. Converting a const iterator to non-const iterator wouldn't enforce the access of the const iterator, and doing so in a copy constructor removes the need to const_cast for clarity. And converting an iterator<derived> to iterator<base>... or iterator<int> to iterator<double> doesn't seem to make much sense, to me. - Jacob

1 0

Iterator facade example could use some changes/documentation adjustments
by Jacob McIntosh 10 Feb '10

10 Feb '10

My example here: http://codepad.org/pH3pXAvb As mentioned in the comment block at the codepad page: http://www.boost.org/doc/libs/1_41_0/libs/iterator/doc/iterator_facade.html… The above link demonstrates in a linked-list scenario, using is_convertible to handle the conversion from non-const iterators to const iterators. This works fine in the example's linked list scenario, but it's likely than many users of iterator_facade will more generally copy this usage to their own container, from the example. However, as my example demonstrates, in the case where the data lives in contiguous memory locations, or perhaps other scenarios, using is_convertible is very bad for this purpose. It lets you convert from a derived class pointer to a base class pointer, and this is problematic if sizeof(base) is less than sizeof(derived) See the below, very minimal example to illustrate my point. Look at CFixedTest for my proposed replacement for is_convertible to prevent this undesirable behavior. Seems to me that noting such behavior, or simply changing the example code to not allow the conversion (as my example does), would remedy the misunderstanding/problem. Just thought I'd contribute that - thanks, nacitar

2 1

[iterator] Interest in abstract iterator?
by Andrey Semashev 09 Feb '10

09 Feb '10

Hi, Quite a few times I needed a type-erased iterator, that is somewhat similar to boost::function and boost::any with regard to functors and other objects. I've crafted a simple abstract_iterator that is capable to adopt other iterators. Main features are: * A quite small and simple implementation. * Small objects optimization. By default, adopting iterators with size of a pointer or smaller will not result in dynamic memory allocation. * The abstract_iterator is capable to adopt other abstract_iterators of the same or more relaxed iterator category without increasing the adoption level. * Most operations on the iterator introduce a virtual function call overhead. Operations involving two iterators also require a dynamic_cast. The code is in the Vault: http://tinyurl.com/yhxbkl3 Tested on MSVC 9. Is there any interest?

4 4

[1.3.9][thread]:nm: libboost_thread-gcc40-mt-1_39.sl: no symbols
by gopal haldar 09 Feb '10

09 Feb '10

Hi I have built the boost thread library locally in hpux 11.23 system. But when I try to check the symbol in the library using nm it displays the following message. nm: libboost_thread-gcc40-mt-1_39.sl: no symbols. Please let me know how to check the symbols in boost library. Regards Gopal

3 2

[rfc] sized_array
by Tim Blechmann 09 Feb '10

09 Feb '10

hi all, i have a small class, something between std::vector and boost::array. if others find it useful, i could submit it as an extension to the boost.array libray. it basically implements a dynamically sized array, similar to boost::array, but its size can be defined at run-time, rather than compile-time. in contrary to std::vector, which is only required to support random-access iterators (which are implementation-defined), my class guaranties to allocate the data in one consecutive memory area. it can basically be used like boost::array, the only difference is its constructor, which takes either an integer size or a container. boost::array<float, 5> ba; sized_array<float> sa(5); // initialize to size 5 assert(sa.size() == ba.size()); // container size ba.assign(pi); sa.assign(pi); // assignment sized_array<float> sa2(ba); // construct from container the code is available at [1], would be interested to hear, if other people find it useful .. thanks, tim [1] http://tim.klingt.org/git?p=nova-server.git;a=blob;f=source/utilities/sized… -- tim(a)klingt.org http://tim.klingt.org Art is either a complaint or do something else John Cage quoting Jasper Johns

7 10

[website] Move guidelines and developer documentation to Trac?
by Daniel James 09 Feb '10

09 Feb '10

Hello all, The guidelines and developer documentation on the boost site are getting a bit old, and no one's really updating them. Meanwhile new developer documentation is being written on the Trac wiki. It seems confusing to split the documentation over two sites, and most developers find it easier to update the wiki so it might be a good idea to move all the developer documentation over to the wiki and the Trac would become the 'developer's site'. This could also help improve the main boost site. It could be simpler and more focussed towards users. Some developer pages would probably have to remain on the site for technical reasons (such as test results) and some articles might not be appropriate, or we might not have the author's permission to put them on a wiki. The developer section would be replaced by a page suggesting how to contribute to boost (along the lines of http://lists.boost.org/MailArchives/boost-docs/2010/01/3960.php) We'd also keep the calendar on the main site in some form, as it can be useful for users. Any thoughts? Daniel

3 4

TMP runtime access problem
by Willy Liu 09 Feb '10

09 Feb '10

Hi, I wonder that how to access metadata in runtime. If I pre-compute something and save them into a template ARRAY<int N>, how can I random access the metadatas in runtime? What I can only do is binary searching. Is it possible to do in constant time, or there exist some functions in MPL doing this? #include<cstdio> using namespace std; template<int N> struct ARRAY { static const int a = ARRAY<N - 1>::a * 2; }; template<> struct ARRAY<0> { static const int a = 1; }; template<int LOWER, int UPPER> struct BS { static const int MID = UPPER + LOWER >> 1; typedef BS<MID + 1, UPPER> GREATER; typedef BS<LOWER, MID> LESS; static inline int binary_search(int n) { if(n > MID) return GREATER::binary_search(n); else return LESS::binary_search(n); } }; template<int N> struct BS<N, N> { static const int MID = N; typedef ARRAY<MID> result; static inline int binary_search(int n) { return result::a; } }; int main() { int n; printf("2^n n:"); scanf("%d", &n); printf("ARRAY<%d>::a = %d\n", n, BS<0, 30>::binary_search(n)); main(); return 0; }

2 1

[GGL][Polygon][Union] Union returns hole (inner ring) of the expected result as the output polygon (outer ring)
by Mohammad Morshed Alam Helal 09 Feb '10

09 Feb '10

Hi, Union of two polygon_2d returns a hole (inner ring) as result. Where - Input polygons - Polygon 1: A big rectangle with a hexagonal hole inside Polygon 2: A triangle that intersects the hole from inside leaving portion of it in the hole Output polygon - The hexagonal hole without the triangle-portion. Expected output polygon - The big rectangle with current output polygon as hole (inner)as described in this picture. The Union of a rectangle with a hexagonal hole and a triangle intersecting the first polygon ***************************** ***************************** ***************************** ******** ********* ******* **X***** ****** XXX***** ***** XXX****** **** XX ***** ***** ****** ****** ******* ******* ******** ******** ********* ***************************** ***************************** ***************************** returns this polygon, instead of the correct result. ++++++++++++ ++++++++++++++ +++++++++++++++ +++++++++++++++ +++++++++++++++ +++ ++++++++++++++++++ ++++++++++++++++ ++++++++++++++ ++++++++++++ You can use the code bellow to generate the case and some PPM images. You may use a WSQ Viewer to see the polygons. Please let me know any workaround or anything thats I am missing. Thank and regards, Helal // the code void uniontest() // Your main should call it { double L = 200.0; const double outloop[][2] = { {L, L}, {L, -L}, {-L, -L}, {-L, L}, {L, L} }; double R = 100.0; double H = R * sqrt(3.0) / 2; const double inloop[][2] = { {R, 0}, {R/2, -H}, {-R/2, -H}, {-R, 0}, {-R/2, H}, {R/2, H}, {R, 0} }; polygon_2d BIGpoly; //A rectangle with a hexagonal hole in it assign(BIGpoly, outloop); //the rectangle BIGpoly.inners().resize(1); linear_ring<point_2d>& inner = BIGpoly.inners().back(); assign(inner, inloop); //the inner hexagon correct(BIGpoly); //correct the order iff not double a = 20.0; double h = a * sqrt(3.0) / 2; const double t1[][2] = { { 30+0, 10+0}, { 30+a/2, 10+h}, { 30+a, 10+0} }; const double t2[][2] = { { 0, 0}, { a/2, h}, { a, 0} }; const double t3[][2] = { {-10+0, -10+0}, {-10+a/2, -10+h}, {-10+a, -10+0} }; const double t4[][2] = { { 0, -15+0}, { a/2, -15+h}, { a, -15+0} }; const double t5[][2] = { {-50, -40}, {-110, 0}, {-100, 30}, {-50, -40} }; polygon_2d T1, T2, T3, T4, T5, T6; //the triangles assign(T1, t1); correct(T1); assign(T2, t2); correct(T2); assign(T3, t3); correct(T3); assign(T4, t4); correct(T4); assign(T5, t5); correct(T5); std::vector<polygon_2d > P_list, P_union, P_tmp; //the outer shape P_union.push_back(BIGpoly); DumbPPMPrint("c:\\BIGpoly.ppm", P_union.begin(), P_union.size()); //Case 1: floating triangle in hole P_union.clear(); ggl::union_inserter<ggl::polygon_2d >(BIGpoly, T1, std::back_inserter(P_union)); DumbPPMPrint("c:\\case1.ppm", P_union.begin(), P_union.size()); //Case 2: three solid triangle creating a small hole P_union.clear(); P_tmp.clear(); ggl::union_inserter<ggl::polygon_2d >(T2, T3, std::back_inserter(P_tmp)); DumbPPMPrint("c:\\case2_i.ppm", P_tmp.begin(), P_tmp.size()); ggl::union_inserter<ggl::polygon_2d >( (*(P_tmp.begin())), T4, std::back_inserter(P_union)); DumbPPMPrint("c:\\case2.ppm", P_union.begin(), P_union.size()); //Case 3: floating holed-polygon in hole //P_union.clear(); //contains result of case 2 P_tmp.clear(); ggl::union_inserter<ggl::polygon_2d >(BIGpoly, (*(P_union.begin())), std::back_inserter(P_tmp)); DumbPPMPrint("c:\\case3.ppm", P_tmp.begin(), P_tmp.size()); //Case 4: a triangle intersecting the hole from inside P_union.clear(); P_union.push_back(BIGpoly); P_union.push_back(T5); DumbPPMPrint("c:\\case4_pre.ppm", P_union.begin(), P_union.size()); P_union.clear(); ggl::union_inserter<ggl::polygon_2d >( BIGpoly, T5, std::back_inserter(P_union)); DumbPPMPrint("c:\\case4.ppm", P_union.begin(), P_union.size()); P_union.clear(); ggl::union_inserter<ggl::polygon_2d >( T5, BIGpoly, std::back_inserter(P_union)); DumbPPMPrint("c:\\case4_rev_order.ppm", P_union.begin(), P_union.size()); } void DumbPPMPrint(char *name, std::vector<polygon_2d >::iterator it, unsigned int n) { //WSQ Viewer can be of help //http://www.cognaxon.com/index.php?page=wsqview //the holes are black. //the more number of polygons are present at a pixel the brighter the pixel is. unsigned int imgwidth = 512; //pixel width of image unsigned int imgheight = 512; //pixel height of image float width = 400.0; //width of image: 10 units (e.g. meters) float height = 400.0; //height of image: 10 units (e.g. meters) //float width = 6000.0; //width of image: 10 units (e.g. meters) //float height = 6000.0; //height of image: 10 units (e.g. meters) //header FILE *signal = fopen(name, "wt"); fprintf(signal, "P3\n"); fprintf(signal, "# %s\n", name); fprintf(signal, "%d %d\n", imgwidth, imgheight); fprintf(signal, "255\n"); unsigned int x, y, i; float xpos, ypos; // PPM images carry red, green, blue color channels. int val0, val1, val2; std::vector<polygon_2d >::iterator poly; for (y = 0; y < imgheight; y++) { ypos = height/2 - height * y / imgheight; for (x = 0; x < imgwidth; x++) { xpos = width/2 - width * x / imgwidth; val0 = val1 = val2 = 0; //black ggl::point_xy<float> point(xpos, ypos); poly = it; for (i = 0; i < n; i++, poly++) { if( ggl::within( point, (*poly) ) ) { val0 += 255/n; val1 += 255/n; val2 += 255/n; } } //fi_poly // clamp to allowed range if (val0 < 0) val0 = 0; else if (val0 > 255) val0 = 255; if (val1 < 0) val1 = 0; else if (val1 > 255) val1 = 255; if (val2 < 0) val2 = 0; else if (val2 > 255) val2 = 255; fprintf(signal, "%3d %3d %3d ", val0, val1, val2); if (x%16 == 15) fprintf(signal, "\n"); } //fi_x } //fi_y fclose(signal); } //@End_of_Code

2 7

C++ Networking Library Release 0.5
by Dean Michael Berris 09 Feb '10

09 Feb '10

Good day everyone, and I apologize in advance for the shameless plug. That said though, I'd like to announce the availability of version 0.5 of the C++ Network Library (cpp-netlib) on both Github and Sourceforge. For those interested in trying out a header-only being-developed-for-boost-inclusion networking library collection, you can download the latest release from: http://github.com/cpp-netlib/cpp-netlib/downloads or https://sourceforge.net/projects/cpp-netlib/ Active development happens on Github where the official repository is http://github.com/cpp-netlib/cpp-netlib (or via git) git://github.com/cpp-netlib/cpp-netlib.git While the cutting edge "clearing house" repository is the one I host also on Github http://github.com/mikhailberis/cpp-netlib (or via git) git://github.com/mikhailberis/cpp-netlib.git The latest release contains: * An HTTP 1.1 client * An embeddable HTTP 1.0 server template If you're interested in joining in on the development, please join the discussion at the cpp-netlib-devel mailing list at: https://lists.sourceforge.net/mailman/listinfo/cpp-netlib-devel or just fork my Github hosted repository -- then send pull requests when you feel like submitting your work "upstream" to me. We're currently in the process of moving on to implementing an HTTP 1.1 server template (looks like a Java Servlet Container), more efficient HTTP 1.1 client implementations, and other goodies. You can find documentation about cpp-netlib over at http://cpp-netlib.github.com/ Thanks in advance everyone and I hope this helps! -- Dean Michael Berris cplusplus-soup.com | twitter.com/deanberris linkedin.com/in/mikhailberis | facebook.com/dean.berris | deanberris.com

31 123

[contract] Contract Programming Library
by Lorenzo Caminiti 09 Feb '10

09 Feb '10

Hi all, I am thinking to submit a library for Contract Programming (a.k.a. Design By Contract (TM) ) for C++. I have drafted some of the library documentation in Boost-like format: http://dbcpp.sourceforge.net/boost/libs/contract/doc/html/ Comments? Regards, Lorenzo

6 15

Re: [boost] boost::mpl::for_each and value_initialized
by Niels Dekker - address until 2010-10-10 08 Feb '10

08 Feb '10

>> I'm sorry, MSVC bug #100744 is still there, even though #335987 has >> been fixed. VC9 deals with POD types correctly, but may not do so >> for non-POD aggregate class types. Domagoj Saric wrote: > but if this is so, shouldn't the proposed patch atleast be > modified to: > > #ifdef BOOST_VALUE_INITIALIZATION_NEEDS_MEMSET > if > ( > !( > ( _MSC_VER >= 1500 ) && > ( is_pod<T>::value ) > ) > ) > std::memset(&x, 0, sizeof(x)); > > #endif > ? I would consider that a refinement. But it's not that simple. MSVC does value-initialize a lot of non-POD types correctly! (But not all of them.) Other compilers may value-initialize built-in types correctly, but not aggregates. I can't remember exactly. So I'd rather start by committing the simple fix that I proposed at Aleksey's ticket #3869, "Unconditional call to memset in value_initialized()", https://svn.boost.org/trac/boost/ticket/3869 Note that I'm planning to rename the macro to BOOST_NO_PROPER_VALUE_INITIALIZATION_FOR_ALL_TYPES. I hope that's okay. But before I commit I'll have to write unit tests for this macro, as John explained to me. I'm planning to do so later this month. When all that is done and stabilized, I wouldn't mind looking at some possible fine tuning, to further reduce the number of memset calls. But I'm afraid it will be a maintainer's headache. Kind regards, Niels -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

2 1

[lexical_cast] efficiency
by Domagoj Saric 08 Feb '10

08 Feb '10

'A while back', in the "error_code debate" I used a lexical_cast<> example for demonstrating certain concerns/aspects but the whole post was so long (as usual :) that it was probably read by less than 0.1% of people :) Anyways I'm extracting and reposting this bit now as I think it warrants attention. The first problem is the ('standard') "std::streams vs efficency" issue: - on msvc 9.0 sp1 the single line boost::lexical_cast<int>( "321" ); caused 14 calls to new and 26 calls to EnterCriticalSection() (not to mention vtable initializations, virtual function calls, usage of locales...) the first time it is called, and 3 calls to new and 15 calls to EnterCriticalSection() on subsequent calls...It also caused the binary (which does not otherwise use streams) to increase by 50 kB! ...which is IMNHO abhorrent... (with my usual 'put things in perspective' examples http://www.theprodukkt.com/kkrieger http://www.youtube.com/watch?v=3vzcMdkvPPg :) As a start maybe this problem could be sufficiently "lessened" by providing lexical_cast specializations/overloads that use C library functions (strtol, itoa and the likes) as they suffer less from bloat/performance issues than std::streams. Ideally, IMHO, lexical_cast<> should provide the power/configurability of boost::numeric_cast (so that one can, for example, say I do not need/want to use locales/assume ASCII strings and things like that). The second problem is the use of exceptions (or better of only using exceptions): if, for example, one uses lexical_cast<> deep in the bowels of some parser it is probably "natural" to use a bad_cast exception to report an error to the outside world but if one uses lexical_cast<> to convert a string entered into a widget by a user into an int it would mostly be simpler to have a simple error code if the user entered an invalid string and issue a warning and retry "at the face of the place" (without the need for try-catch blocks)... In other words maybe a dual/hybrid approach of using both exceptions and error codes (through different overloads would be justified). -- "That men do not learn very much from the lessons of history is the most important of all the lessons of history." Aldous Huxley

5 9

boost::mpl::for_each and value_initialized
by Peter Foelsche 08 Feb '10

08 Feb '10

Dear All, what is the use of value_initialized in boost::mpl::for_each? It should be sufficient if the value is initialized by the constructor. value_initialized() calls memset() in before calling the constructor. This memset() is not being optimized away with gnu-c++ 4.4.1. What class does require zeroed memory to work correctly? Peter *** boost_1_40_0/boost/mpl/for_each.hpp Mon Aug 17 22:16:53 2009 --- boost_1_40_0.saved/boost/mpl/for_each.hpp Tue Sep 1 12:54:55 2009 *************** *** 71,78 **** // dwa 2002/9/10 -- make sure not to invoke undefined behavior // when we pass arg. ! value_initialized<arg> x; ! aux::unwrap(f, 0)(boost::get(x)); typedef typename mpl::next<Iterator>::type iter; for_each_impl<boost::is_same<iter,LastIterator>::value> --- 71,78 ---- // dwa 2002/9/10 -- make sure not to invoke undefined behavior // when we pass arg. ! //value_initialized<arg> x; ! aux::unwrap(f, 0)(arg()); typedef typename mpl::next<Iterator>::type iter; for_each_impl<boost::is_same<iter,LastIterator>::value>

5 10

[fusion] is there an adapter for C-arrays?
by vicente.botet 08 Feb '10

08 Feb '10

Hi, I need to visit the members of a C++ type using Fusion sequences. For structures I plan to use BOOST_FUSION_ADAPT_STRUCT. I need also to visit also c-arrays (with static size). I see that there is already an adapter for boost::array. Is there an adapter for C-arrays? Thanks, _____________________ Vicente Juan Botet Escribá

4 11

Re: [boost] boost::mpl::for_each and value_initialized
by Niels Dekker - address until 2010-10-10 07 Feb '10

07 Feb '10

Peter Foelsche wrote: > in boost_1_41_0 there is still an unconditional call to memset in > value_initialized() Fernando Cacciola and I originally added the memset call within value_initialized() for MSVC only, because MSVC's implementation of value-initialization was known to incorrectly leave some bytes uninitialized, in some very relevant use cases. https://svn.boost.org/trac/boost/changeset/39157/trunk/boost/utility/value_… Thereby we also added extra unit tests, which were passed by MSVC by then, because of the memset. But unfortunately they failed on other compilers (GCC, Borland/Codegear and Sun), because of similar value-initialization issues. That's when we thought it was wise to just have the memset call there for all compilers: https://svn.boost.org/trac/boost/changeset/41942/trunk/boost/utility/value_… Do I understand correctly that you want the memset call to be skipped for those compiler versions that have implemented value-initialization entirely correctly? Do you know exactly which compiler versions do implement value-initialization correctly? Personally I do appreciate that the behavior of value_initialized is now exactly the same for all compilers. But I do understand you're concerned about the performance penalty of the memset call, for those compilers that have implemented value-initialization correctly. If so, can you please create a ticket, preferably including a patch? Kind regards, Niels -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

5 8

wrapper to add Boost.Iterator adaptors to Boost.Range
by dstahlke 07 Feb '10

07 Feb '10

I've worked up a subclass that adds Boost.Iterator functionality to a Boost.Range object. The motivation was twofold: Range combines begin() and end() into one object, preventing the need to write iterator adapter code twice, and adding adaptors into the subclass avoids the need to specify namespaces and allows code structures similar to those of perl or ruby. I expect that this type of writing will become desirable when C++0x lambda functions are available. The C++0x 'auto' keyword will allow storing the generated iterators to local variables for further arithmetic; as it stands now the induced types are far to complex to be written out by hand. The point of this message is just to share the idea in case anyone wishes to do something with it. I'm relatively new to C++ and lack the knowledge needed to make something like this the right way. For example, I have no idea how to make the transform_tuple function work with anything other than a two element tuple. The '*' and '+' arithmetic operators have been defined to perform pairwise arithmetic between elements, but it may also make sense to define operators like "magic_iter + scalar" and "magic_iter += magic_iter". With the 'auto' keyword this would allow converting a bunch of STL containers into iterator objects which could then be manipulated mathematically as if they were Blitz++ arrays. /////////////////////////////////////////////// // magic_iter_demo.cpp /////////////////////////////////////////////// #include <magic_iter.h> #include <vector> #include <set> #include <iostream> #include <boost/foreach.hpp> #include <boost/lambda/lambda.hpp> using namespace boost::lambda; int main() { std::cout << "--- odd multiples of 10, reverse sorted\n"; std::vector<int> tmp; BOOST_FOREACH( int x, my::make_magic_counter(0, 10). filter(_1 & 1). transform<int>(_1 * 10). assign_to(tmp). // needed to allow sort sort(_1 > _2) ) { std::cout << x << std::endl; } std::cout << "--- unique elements of v*w, using zip\n"; std::vector<int> v; std::vector<double> w; my::make_magic_counter(0, 11). transform<int>(_1 - 5). assign_to(v). transform<double>(_1 * 0.01). assign_to(w); std::set<double> tmp2; zip(my::make_magic_iter(v), my::make_magic_iter(w)). transform_tuple<double>(_1 * _2). insert_into(tmp2). // uniq for_each(std::cout << _1 << "\n"); std::cout << "--- elements of v*w, using operator\n"; (my::make_magic_iter(v) * my::make_magic_iter(w)). for_each(std::cout << _1 << "\n"); } /////////////////////////////////////////////// // magic_iter.h /////////////////////////////////////////////// #ifndef MAGIC_ITER_H #define MAGIC_ITER_H #include <iterator> #include <algorithm> #include <boost/range/iterator_range.hpp> #include <boost/iterator/transform_iterator.hpp> #include <boost/iterator/filter_iterator.hpp> #include <boost/iterator/zip_iterator.hpp> #include <boost/iterator/counting_iterator.hpp> #include <boost/tuple/tuple.hpp> #include <boost/lambda/lambda.hpp> namespace my { // result_type_wrapper is from mailing list post by Maxim Yegorushkin template <class R, class F> struct result_type_wrapper : F { typedef R result_type; explicit result_type_wrapper(const F &f) : F(f) {} }; template <class R, class F> static inline result_type_wrapper<R, F> result_type(const F &f) { return result_type_wrapper<R, F>(f); } template <class R, class F> struct tuple_lambda_wrapper { typedef R result_type; explicit tuple_lambda_wrapper(const F &_f) : f(_f) { } template <class T> R operator()(const T &tuple_val) const { return f( boost::tuples::get<0>(tuple_val), boost::tuples::get<1>(tuple_val) ); } F f; }; template <class R, class F> static inline tuple_lambda_wrapper<R, F> tuple_lambda(const F &f) { return tuple_lambda_wrapper<R, F>(f); } template <class T> class magic_iter : public boost::iterator_range<T> { public: typedef typename std::iterator_traits<T>::value_type value_type; magic_iter(const T &_begin, const T &_end) : boost::iterator_range<T>(_begin, _end) { } template <class F> magic_iter<boost::transform_iterator<F, T> > transform(const F &f) { return magic_iter<boost::transform_iterator<F, T> >( boost::make_transform_iterator(this->begin(), f), boost::make_transform_iterator(this->end(), f) ); } template <class R, class F> magic_iter<boost::transform_iterator< result_type_wrapper<R, F>, T> > transform(const F &f) { return transform(result_type<R>(f)); } template <class R, class F> magic_iter<boost::transform_iterator< tuple_lambda_wrapper<R, F>, T> > transform_tuple(const F &f) { return transform(tuple_lambda<R>(f)); } template <class C> magic_iter<typename C::iterator> assign_to(C &container) { container.assign(this->begin(), this->end()); return make_magic_iter(container); } template <class C> magic_iter<typename C::iterator> insert_into(C &container) { container.insert(this->begin(), this->end()); return make_magic_iter(container); } template <class F> magic_iter<T> &sort(const F &comparator) { std::sort(this->begin(), this->end(), comparator); return *this; } template <class F> magic_iter<boost::filter_iterator<F, T> > filter(const F &f) { return magic_iter<boost::filter_iterator<F, T> >( boost::make_filter_iterator(f, this->begin(), this- >end()), boost::make_filter_iterator(f, this->end(), this->end()) ); } template <class F> void for_each(const F &f) { std::for_each(this->begin(), this->end(), f); } }; template <class T> magic_iter<typename T::iterator> make_magic_iter(T &container) { return magic_iter<typename T::iterator>(container.begin(), container.end()); } template <class T> magic_iter<typename T::iterator> make_magic_iter(const T &begin, const T &end) { return magic_iter<typename T::iterator>(begin, end); } template <class T> magic_iter<typename boost::counting_iterator<T> > make_magic_counter(const T &begin, const T &end) { return magic_iter<typename boost::counting_iterator<T> >( boost::counting_iterator<T>(begin), boost::counting_iterator<T>(end) ); } template <class A, class B> magic_iter<boost::zip_iterator<boost::tuple<A, B> > > zip(const magic_iter<A> &a, const magic_iter &b) { //return make_magic_iter( return magic_iter<boost::zip_iterator<boost::tuple<A, B> > >( boost::make_zip_iterator( boost::tuple<A, B>(a.begin(), b.begin()) ), boost::make_zip_iterator( boost::tuple<A, B>(a.end(), b.end()) ) ); } template <class X, class Y> struct tuple_multiply { typedef typename boost::lambda::return_type_2< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, X, Y>::type result_type; result_type operator()(const boost::tuple<X, Y> &t) const { const X &x = boost::tuples::get<0>(t); const Y &y = boost::tuples::get<1>(t); return x*y; } }; template <class X, class Y> magic_iter<boost::transform_iterator< tuple_multiply<typename X::value_type, typename Y::value_type>, boost::zip_iterator<boost::tuple<X, Y> > > > operator*(magic_iter<X> x, magic_iter<Y> y) { //magic_iter<boost::zip_iterator<boost::tuple<X, Y> > > zi = zip(x, y); //return zi.transform(tuple_multiply<typename X::value_type, typename Y::value_type>()); tuple_multiply<typename X::value_type, typename Y::value_type> op; return zip(x, y).transform(op); } template <class X, class Y> struct tuple_plus { typedef typename boost::lambda::return_type_2< boost::lambda::arithmetic_action< boost::lambda::plus_action >, X, Y>::type result_type; result_type operator()(const boost::tuple<X, Y> &t) const { const X &x = boost::tuples::get<0>(t); const Y &y = boost::tuples::get<1>(t); return x+y; } }; template <class X, class Y> magic_iter<boost::transform_iterator< tuple_plus<typename X::value_type, typename Y::value_type>, boost::zip_iterator<boost::tuple<X, Y> > > > operator+(magic_iter<X> x, magic_iter<Y> y) { tuple_plus<typename X::value_type, typename Y::value_type> op; return zip(x, y).transform(op); } } // namespace my #endif // MAGIC_ITER_H

3 2

[wave] limited extensibility
by Christopher Lux 07 Feb '10

07 Feb '10

Hi, i am trying to use boost.wave as a preprocessor for OpenGL Shading Language shader files (GLSL). GLSL uses a limited C/C++ preprocessor (no included etc.). I want to use boost.wave to handle the includes correctly besides generally gaining a more powerful preprocessor. Now the problem is that there a special preprocessor directives in GLSL that the compiler itself has to handle. I am speaking of the #version and #extension directives. I hoped boost.wave would provide the possibility to add special directives that the client code then can handle properly. Currently I use the context hook as follows: class glsl_preprocessing_hook : public boost::wave::context_policies::default_preprocessing_hooks { public: template <typename ContextT> void throw_exception(ContextT const &ctx, std::exception const& e) { throw e; } template <typename ContextT> void throw_exception(ContextT const &ctx, boost::wave::preprocess_exception const& e) { // just ignore ill formed directives (version, exception...) and let the glsl compiler handle these if(e.get_errorcode() != boost::wave::preprocess_exception::ill_formed_directive) { throw e; } } }; This just ignores the ill formed directives, but may still let unwanted errors through. Would it be possible to extend boost.wave in a way to be able feed the lexer or context regular expressions of the new custom directives? These could be pushed into a special hook method with the appropriate context information. I think this functionality would greatly increase the usability for C++ like languages with custom extensions to the preprocessor. Regards -chris

2 4

[chrono] v0.3.1 Support for wide characters
by vicente.botet 07 Feb '10

07 Feb '10

Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

7 9

[thread] small futures patch
by Christopher Lux 07 Feb '10

07 Feb '10

Hi, i came across an annoying compiler warning when using boost.thread (1.42 release) in a 64bit environment. Attached is a small patch for the futures.hpp in the trunk. Regards -chris

1 0

BoostCon 2010 tentative, fully scheduled program available
by Hartmut Kaiser 06 Feb '10

06 Feb '10

Hey all, The first tentative, fully scheduled program for BoostCon 2010 is now available at http://www.boostcon.com/program. We're quite fond of this program and we believe it contains something for almost everybody. We hope to convince you to join us at BoostCon 2010, May 10-14th, in the beautiful Aspen. For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

Link errors in copy_exception_test
by Emil Dotchevski 05 Feb '10

05 Feb '10

Can someone help me figure out what's the problem with the copy_exception_test from Boost Exception on this test site: http://tinyurl.com/yzjo8v4 Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

Utility/swap test error: LNK1561: entry point must be defined
by Kevin Li 05 Feb '10

05 Feb '10

Hi there, I got linking failures (fatal error LNK1561: entry point must be defined) with some of the Utility/swap tests. There is a test_main function in the source file, and the test application statically links to the Boost library. It seems that the Utility/swap tests try to link to boost_test_exec_monitor library. I have the library "libboost_test_exec_monitor-vc90-mt-1_41.lib" ready. I have no idea why the linking does not work. Is the problem with this library? I would appreciate any helps with this. The Ja Thanks in advance, Kevin _________________________________________________________________

2 2

Re: [boost] problems with recursive_timed_mutex and scoped lock wont compile in version 1.39
by amillet 05 Feb '10

05 Feb '10

did you find a solution for this compilation errror ? regards Clark Sims-2 wrote: > > I can compile the following code fine in boost 1.33.1 but it generates > compiler errors > in version 1.39. I am using visual studio 2005. > > I will post the code, and then post the compiler errors: > > #include <iostream> > #include <boost/thread/thread.hpp> > #include <boost/thread/xtime.hpp> > #include <boost/thread/recursive_mutex.hpp> > > using namespace std; > //using namespace boost; > using boost::mutex; > using boost::thread; > using boost::recursive_timed_mutex; > using boost::xtime; > > boost::recursive_timed_mutex hello_mutex; > > void hello( int thread_id, int iter) { > cerr << thread_id << " : " << iter << endl; > } > > > void rand_xtime( xtime* xt) { > xtime_get( xt, boost::TIME_UTC); > //xt.nsec += (rand() % 1000000000); > xt->sec += 1 + rand()%5; > } > > void say_hello( int thread_id) { > for (int iter=0; iter<5; iter++) { > xtime xt; > rand_xtime( &xt); > thread::sleep(xt); > rand_xtime( &xt); > { > recursive_timed_mutex &refer_hello = hello_mutex; > const xtime& refer_xt = xt; > recursive_timed_mutex::scoped_timed_lock > lock1( refer_hello, refer_xt); > if (lock1) { > hello( thread_id, iter); > } > } > } > } > > void hello1() { > say_hello( 1); > } > > void hello2() { > say_hello( 2); > } > > int main() { > boost::thread thrd1(hello1); > boost::thread thrd2(hello2); > > thrd1.join(); > thrd2.join(); > > return 0; > } > > Microsoft (R) Program Maintenance Utility Version 8.00.50727.42 > Copyright (C) Microsoft Corporation. All rights reserved. > > Warning: cannot find Makefile.TimedMutex.dep > cl.exe /nologo /Ob0 /W3 /EHs /MD /GR /I ".." /D NDEBUG /D WIN32 /D > _CONSOLE /FD /c /Fo"Release\TimedMutex\I386\TimedMutex.obj" > "TimedMutex.cpp" > TimedMutex.cpp > c:\boost_1_39\boost\thread\win32\basic_recursive_mutex.hpp(64) : error > C2679: binary '+' : no operator found which takes a right-hand operand of > type 'const boost::xtime' (or there is no acceptable conversion) > > c:\boost_1_39\boost/date_time/posix_time/date_duration_operators.hpp(31): > could be 'boost::posix_time::ptime boost::posix_time::operator +(const > boost::posix_time::ptime &,const boost::gregorian::months &)' [found using > argument-dependent lookup] > c:\boost_1_39\boost/date_time/date_duration_types.hpp(132): or > 'boost::gregorian::date > boost::date_time::months_duration<base_config>::operator +(const > boost::gregorian::date &,const > boost::date_time::months_duration<base_config> &)' [found using > argument-dependent lookup] > with > [ > base_config=boost::gregorian::greg_durations_config > ] > > c:\boost_1_39\boost/date_time/posix_time/date_duration_operators.hpp(75): > or 'boost::posix_time::ptime boost::posix_time::operator +(const > boost::posix_time::ptime &,const boost::gregorian::years &)' [found using > argument-dependent lookup] > c:\boost_1_39\boost/date_time/date_duration_types.hpp(244): or > 'boost::gregorian::date > boost::date_time::years_duration<base_config>::operator +(const > boost::gregorian::date &,const > boost::date_time::years_duration<base_config> &)' [found using > argument-dependent lookup] > with > [ > base_config=boost::gregorian::greg_durations_config > ] > c:\boost_1_39\boost/date_time/time.hpp(139): or > 'boost::posix_time::ptime > boost::date_time::base_time<T,time_system>::operator +(const > boost::gregorian::date_duration &) const' > with > [ > T=boost::posix_time::ptime, > time_system=boost::posix_time::posix_time_system > ] > c:\boost_1_39\boost/date_time/time.hpp(159): or > 'boost::posix_time::ptime > boost::date_time::base_time<T,time_system>::operator +(const > boost::posix_time::time_duration &) const' > with > [ > T=boost::posix_time::ptime, > time_system=boost::posix_time::posix_time_system > ] > while trying to match the argument list '(boost::system_time, > const boost::xtime)' > c:\boost_1_39\boost/thread/locks.hpp(364) : see reference to > function template instantiation 'bool > boost::detail::basic_recursive_mutex_impl<underlying_mutex_type>::timed_lock<boost::xtime>(const > Duration &)' being compiled > with > [ > underlying_mutex_type=boost::detail::basic_timed_mutex, > Duration=boost::xtime > ] > c:\boost_1_39\boost/thread/locks.hpp(363) : while compiling class > template member function 'bool boost::unique_lock<Mutex>::timed_lock(const > boost::xtime &)' > with > [ > Mutex=boost::recursive_timed_mutex > ] > TimedMutex.cpp(36) : see reference to class template instantiation > 'boost::unique_lock<Mutex>' being compiled > with > [ > Mutex=boost::recursive_timed_mutex > ] > NMAKE : fatal error U1077: '"c:\Program Files\Microsoft Visual Studio > 8\VC\BIN\cl.exe"' : return code '0x2' > Stop. > > > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > > -- View this message in context: http://old.nabble.com/problems-with-recursive_timed_mutex-and-scoped-lock-w… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

linear algebra library... again
by DE 04 Feb '10

04 Feb '10

"Yeah, well... I'm gonna go build my own theme park, with blackjack and hookers. In fact, forget the park!" it seems the previous message has not reached the list i hope this will i present you an almost finished linear algebra library called BIBLAL there are some aspects of matrix algebra implemented as well the sources and docs are in the vault:/linalg/ http://www.boostpro.com/vault/index.php?direction=0&order=&directory=linalg& to this moment the core of the library is fully working it turned out to be almost 100% the way i originally intended so i'm very happy about it there are some minor details to implement as well as some usefull features to add but this seems trivial when the core is finished although i think a linear algebra lib should never be part of the standard, the boost collection of libraries will certainly benefit from its inclusion to complement ublas i'm open to questions, criticism and suggestions -- Pavel

4 9

[1.42] PDF documentation build available.
by John Maddock 04 Feb '10

04 Feb '10

Documentation for those Boost libraries that can have their documentation built as PDF is now available from the usual SF download page: https://sourceforge.net/projects/boost/files/ Individual links are: https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (26Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (25Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (24Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (23Mb) Enjoy! John.

1 0

[1.42.0][integer] Compilation error in MS VS 2005
by Adam Badura 04 Feb '10

04 Feb '10

Problem described by Ticket #3657 was solved by version 1.42 only for Visual Studio 2008. In Visual Studio 2005 it still exists. So I reopened the bug with appropriate description (https://svn.boost.org/trac/boost/ticket/3657#comment:2) Is it possible to release 1.42.1 version correcting the bug? Or do I have to wait again 2 months (at least) for 1.43 which will (possibly) solve the bug? I still have to use 1.39 since starting from 1.40 there are problems with Integer library. Adam Badura

2 2

[serialization] basic_binary_oarchive.hpp asserts are no longer necessary
by Number Cruncher 04 Feb '10

04 Feb '10

I've just tried building my code against 1.42 and am encountering numerous warnings of the sort: boost/archive/basic_binary_oarchive.hpp:95: warning: comparison is always true due to limited range of data type I've checked the difference to the 1.41 release and noticed that boost/archive/basic_archive.hpp now uses BOOST_ARCHIVE_STRONG_TYPEDEF for class_id_type etc. and uses int_least16_t rather than "int". This is causing my GCC 4.1.2 compiler to produce the above warning because the assertion "t.t <= boost::integer_traits<boost::int_least16_t>::const_max" is always true when t.t *is* an int_least16_t The attached patch removes the (now redundant) asserts.

2 2

[1.42] The PDF build of the docs for the 1.42 BETA available
by John Maddock 04 Feb '10

04 Feb '10

The PDF build of the docs for 1.42 BETA are now available for download from the sourceforge download page https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_…. Please let me know if you spot any issues, Thanks, John Maddock.

2 1

[gil] trac #3619
by Christian Henning 03 Feb '10

03 Feb '10

Hi there, could someone please tell whether or not this bug still exists. I don't have access to gcc 4.4. This is marked as a showstopper and I would like to get rid of it. Is it a compiler bug maybe? Thanks, Christian

2 1

[multi_index][serialization] save_construct_data not called for multi_index collection
by Felipe Magno de Almeida 03 Feb '10

03 Feb '10

Hi, Boost.Serialization has support for non-default classes using save_construct_data and load_construct_data overloads. These are called before serialization to save and load information that's important for the construction of the object. Unfortunately, multi_index doesn't call these functions when serializing, so serialization of non-default-constructible classes is impossible with multi_index. I wanted to patch it so that it becomes possible, but to be honest I'm a bit lost in the serialization code for multi_index. collections_save_impl calls boost::serialization::save_construct_data_adl before serializing each item in the collection. I'm using boost 1.38.0, is there anyway to do the same for multi_index? Thanks in advance, -- Felipe Magno de Almeida

4 8

errors in Math Toolkit documentation
by Shawn Pautz 03 Feb '10

03 Feb '10

The documentation for the Poisson distribution in boost/math/distributions (http://www.boost.org/doc/libs/1_41_0/libs/math/doc/sf_and_dist/html/math_to…) contains a few errors. In the middle of the page is a bar graph depicting the Poisson distribution for several values of lambda. The one labeled for lambda=1 is actually the distribution for lambda=5. Similarly the one labeled as lambda=50 appears to be generated for lambda=20 instead. Please check this and correct as needed. Shawn Pautz

2 1

[1.42.0] Release candidates available
by Beman Dawes 02 Feb '10

02 Feb '10

Release candidates for 1.42.0 are available at http://boost.cowic.de/rc/ We need some reality checks before pushing these out to SourceForge. Please download, do a build, and report results here. Also let us know if you spot any problems or have any other comments. Thanks, --Beman PS: I've already downloaded and tried the .zip file on Windows. No problems.

6 10

Boost release 1.42.0 available
by Beman Dawes 02 Feb '10

02 Feb '10

Release 1.42.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_42_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ To install this release on your system, see http://www.boost.org/doc/libs/1_42_0/more/getting_started/index.html Thanks, --The Boost release team

1 0

[property_tree][log] Error compiling with Visual C++ 2010 Beta 2
by Fulvio Esposito 02 Feb '10

02 Feb '10

Hi all, I'm currently experimenting with Visual C++ 2010 Beta 2. I've found compilation problems related to property_tree and log libraries. Hope it's not a problem to send a single post for two libraries. Boost.PropertyTree: the simplest program: #include "stdafx.h" #include <boost/property_tree/ptree.hpp> int _tmain(int argc, _TCHAR* argv[]) { boost::property_tree::ptree tree; return 0; } generate the error: c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(30): error C2440: 'specialization' : cannot convert from 'const std::string std::_Pair_base<_Ty1,_Ty2>::* ' to 'const std::basic_string<_Elem,_Traits,_Ax> std::pair<_Ty1,_Ty2>::* ' 1> with 1> [ 1> _Ty1=const std::string, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string> 1> ] 1> and 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Ax=std::allocator<char>, 1> _Ty1=const std::string, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string> 1> ] 1> Standard conversion from pointer-to-member of base to pointer-to-member of derived is not applied for template arguments 1> c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(159) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>::subs' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1> c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(159) : while compiling class template member function 'boost::property_tree::basic_ptree<Key,Data>::basic_ptree(void)' 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1> d:\documenti\visual studio 2010\projects\testpropertytree\testpropertytree\testpropertytree.cpp(9) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] Boost.Log The compilation with bjam gives the error: libs\log\src\filter_parser.cpp(149) : error C2668: 'std::tr1::bind' : ambiguous call to overloaded function C:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\xxbind1(363): could be 'std::tr1::_Bind<_Result_type,_Ret,_BindN> std::tr1::bind<void,const std::basic_string<_Elem,_Traits,_Ax>&,double,boost::function1<R,T0>&,boost::reference_wrapper<T>,boost::arg,boost::reference_wrapper<boost::function1<R,T0>>>(_Rx (__cdecl *const )(_Farg0,_Farg1,_Farg2),_Arg0,_Arg1,_Arg2)' [found using argument-dependent lookup] with [ _Result_type=void, _Ret=void, _BindN=std::tr1::_Bind3<std::tr1::_Callable_fun<void (__cdecl *const )(const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,double,boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &),false>,boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>,boost::arg<1>,boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>>>, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>>, I=1, _Rx=void, _Farg0=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, _Farg1=double, _Farg2=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &, _Arg0=boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>, _Arg1=boost::arg<1>, _Arg2=boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>> ] C:\Users\Fulvio\Sviluppo\boost_1_41_0\boost/bind/bind_cc.hpp(46): or 'boost::_bi::bind_t<R,F,L> boost::bind<void,const std::basic_string<_Elem,_Traits,_Ax>&,double,boost::function1<bool,T0>&,boost::reference_wrapper<T>,boost::arg,boost::reference_wrapper<boost::function1<bool,T0>>>(R (__cdecl *)(B1,B2,B3),A1,A2,A3)' with [ R=void, F=void (__cdecl *)(const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,double,boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &), L=boost::_bi::list3<boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>,boost::arg<1>,boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>>>, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>>, I=1, B1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, B2=double, B3=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &, A1=boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>, A2=boost::arg<1>, A3=boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>> ] while trying to match the argument list '(overloaded-function, const boost::reference_wrapper<T>, boost::arg, const boost::reference_wrapper<T>)' with [ T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> ] and [ I=1 ] and [ T=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> ] libs\log\src\filter_parser.cpp(87) : see reference to function template instantiation 'boost::function1<R,T0> boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>::parse_argument<boost::log_mt_nt5::aux::equal_to>(const std::basic_string<_Elem,_Traits,_Ax> &,const std::basic_string<_Elem,_Traits,_Ax> &)' being compiled with [ R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, CharT=char, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] libs\log\src\filter_parser.cpp(86) : while compiling class template member function 'boost::function1<R,T0> boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>::on_equality_relation(const std::basic_string<_Elem,_Traits,_Ax> &,const std::basic_string<_Elem,_Traits,_Ax> &)' with [ R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, CharT=char, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] libs\log\src\filter_parser.cpp(208) : see reference to class template instantiation 'boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>' being compiled with [ CharT=char ] libs\log\src\filter_parser.cpp(530) : see reference to class template instantiation 'boost::log_mt_nt5::`anonymous-namespace'::filters_repository<CharT>' being compiled with [ CharT=char ] libs\log\src\filter_parser.cpp(569) : see reference to function template instantiation 'void boost::log_mt_nt5::register_filter_factory<char>(const char *,const boost::shared_ptr<T> &)' being compiled with [ T=boost::log_mt_nt5::filter_factory<char> ] In this case I belive that an explicit namespace qualification could solve. Fulvio Esposito

3 2

crash in boost serialization 1.41
by Est 02 Feb '10

02 Feb '10

Hi All I'm developing an image processing app. In my app, I serialize a boost::ptr_vector of an abstract base class to a polymorphic xml archive. I checked all my polymorphic classes are exported with BOOST_SERIALIZATION_EXPORT and BOOST_SERIALIZATION_ASSUME_ABSTRACT for abstract classes, and it's working correctly with boost 1.38. If I update to boost 1.41, I can save archives without problems. When I try to load the resulting archive, I get a crash: Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_PROTECTION_FAILURE at address: 0x00000000 boost::archive::detail::basic_iarchive_impl::load_pointer (this=0x1b955a00, ar=@0xbfffe598, t=@0xbfffd8d0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:429 429 class_id_type new_cid = register_type(bpis_ptr->get_basic_serializer()); I can read the archive with my app compiled with boost 1.38. I'm using gcc 4.0.1 on OSX and gcc 4.3 on linux, all 32 bits. I'm not using DLLs. I ran the unit tests of the serialization library. All passed. I'm in the process of extracting a small example that reproduces the crash. Do you have any idea how can I fix it? Thank you. Est. Here is the backtrace: node_t is my abstract base class. #0 boost::archive::detail::basic_iarchive_impl::load_pointer (this=0x1b955a00, ar=@0xbfffe598, t=@0xbfffd8d0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:429 #1 0x005a5506 in boost::archive::detail::basic_iarchive::load_pointer (this=0x0, t=@0x0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:538 #2 0x00043f2e in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_pointer (this=0xbfffe58c, t=@0xbfffd8d0, bpis_ptr=0x0) at polymorphic_iarchive_route.hpp:65 #3 0x0003d0f9 in boost::archive::detail::load_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::node_t*> (ar=@0xbfffe58c, t=@0xbfffd8d0) at iserializer.hpp:486 #4 0x0003d157 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::node_t*> (ar=@0xbfffe58c, t=@0xbfffd8d0) at iserializer.hpp:554 #5 0x0003d1a6 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::node_t*> (this=0xbfffe58c, t=@0xbfffd8d4) at polymorphic_iarchive.hpp:137 #6 0x0003d1f8 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::node_t*> const> (this=0xbfffe58c, t=@0xbfffd8d4) at interface_iarchive.hpp:61 #7 0x0003d253 in boost::ptr_container_detail::load_helper<boost::archive::polymorphic_iarchive, boost::ptr_container_detail::sequence_config<ramen::node_t, std::vector<void*, std::allocator<void*> > >, boost::heap_clone_allocator> (ar=@0xbfffe58c, c=@0x193b1bd8, n=1) at detail/serialize_reversible_cont.hpp:52 #8 0x0003d2e9 in boost::serialization::load<boost::archive::polymorphic_iarchive, ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > (ar=@0xbfffe58c, c=@0x193b1bd8) at serialize_ptr_vector.hpp:28 #9 0x0003d327 in boost::serialization::free_loader<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > >::invoke (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_free.hpp:58 #10 0x0003d349 in boost::serialization::split_free<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_free.hpp:74 #11 0x0003d36b in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > (ar=@0xbfffe58c, c=@0x193b1bd8, version=0) at serialize_ptr_vector.hpp:34 #12 0x0003d3a9 in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #13 0x0003d456 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > >::load_object_data (this=0xbcc2f0, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #14 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #15 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #16 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc2f0) at libs/serialization/src/basic_iarchive.cpp:529 #17 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc2f0) at polymorphic_iarchive_route.hpp:59 #18 0x00039f93 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #19 0x00039fbc in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #20 0x00039fdb in boost::archive::load<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #21 0x0003a02a in boost::archive::polymorphic_iarchive_impl::load_override<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (this=0xbfffe58c, t=@0xbfffdbc4) at polymorphic_iarchive.hpp:137 #22 0x0003a07c in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > const> (this=0xbfffe58c, t=@0xbfffdbc4) at interface_iarchive.hpp:61 #23 0x0003a0ac in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > const> (this=0xbfffe58c, t=@0xbfffdbc4) at interface_iarchive.hpp:68 #24 0x0003aa49 in ramen::dataflow::graph<ramen::node_t>::load<boost::archive::polymorphic_iarchive> (this=0x193b1bd8, ar=@0xbfffe58c, version=0) at graph.hpp:168 #25 0x0003ab9b in boost::serialization::access::member_load<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:101 #26 0x0003abbd in boost::serialization::detail::member_loader<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> >::invoke (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_member.hpp:54 #27 0x0003abdf in boost::serialization::split_member<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_member.hpp:69 #28 0x0003ac01 in ramen::dataflow::graph<ramen::node_t>::serialize<boost::archive::polymorphic_iarchive> (this=0x193b1bd8, ar=@0xbfffe58c, file_version=0) at graph.hpp:175 #29 0x0003ac23 in boost::serialization::access::serialize<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:109 #30 0x0003ac45 in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:74 #31 0x0003ac83 in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #32 0x0003ad30 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> >::load_object_data (this=0xbcc260, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #33 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #34 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #35 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc260) at libs/serialization/src/basic_iarchive.cpp:529 #36 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc260) at polymorphic_iarchive_route.hpp:59 #37 0x000365fb in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #38 0x00036624 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #39 0x00036643 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #40 0x00036692 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::dataflow::graph<ramen::node_t> > (this=0xbfffe58c, t=@0xbfffdf8c) at polymorphic_iarchive.hpp:137 #41 0x000366e4 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::dataflow::graph<ramen::node_t> > const> (this=0xbfffe58c, t=@0xbfffdf8c) at interface_iarchive.hpp:61 #42 0x00036714 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<ramen::dataflow::graph<ramen::node_t> > const> (this=0xbfffe58c, t=@0xbfffdf8c) at interface_iarchive.hpp:68 #43 0x0002c3fb in ramen::composition_t::serialize (this=0x193b1bd8, ar=@0xbfffe58c, version=0) at /Users/est/Devel/ramen/trunk/ramen/app/composition.cpp:193 #44 0x0004570f in boost::serialization::access::serialize<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:109 #45 0x00048387 in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:74 #46 0x0004574f in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #47 0x00048436 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, ramen::composition_t>::load_object_data (this=0xbcc410, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #48 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #49 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #50 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc410) at libs/serialization/src/basic_iarchive.cpp:529 #51 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc410) at polymorphic_iarchive_route.hpp:59 #52 0x0004835f in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #53 0x00043692 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #54 0x000436b1 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #55 0x00043700 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::composition_t> (this=0xbfffe58c, t=@0xbfffe5c8) at polymorphic_iarchive.hpp:137 #56 0x00043752 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at interface_iarchive.hpp:61 #57 0x00043782 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at interface_iarchive.hpp:68 #58 0x0004379c in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::operator&<boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at polymorphic_iarchive_route.hpp:173

1 1

metaprogramming: associating a type with another type
by DE 02 Feb '10

02 Feb '10

hi boosters while solving my own design problems i accidentally discovered an interesting technique let's assume we want to associate some value (a type) to a newly created type so we can easily access the associated type during metaprogramming let's call the associated type a property then we have the following property types: struct property0 {}; struct property1 {}; struct property2 {}; now we want to access the associated property for an arbitrary type in a natural traits manner: property<arbitrary_type>::type it appears we can implement it almost trivially (if know how) (let's assume we have portable typeof() facility) consider the code //the return type of this function appears to be the default property template<typename type> property0 get_prop(type*); //do not implement! template<typename t> struct property { typedef typeof(get_prop((type*)42) type; }; template<typename type, typename p = typename property<type>::type> struct base { friend p get_prop(type*) { return p(); } }; template<typename type> void foo(const base<type>&) //handles ALL types derived from base { typedef typename property<type>::type associated_property; } template<typename type> void bar(const base<type, property2>&) //handles ONLY types with property2 {} struct s : public expression<s> //default property used here {}; struct s1 : public expression<s1, property1> {}; struct s2 : public expression<s2, property2> {}; int main() { foo(s()); foo(s1()); foo(s2()); //bar(s()); //should not compile //bar(s1()); //should not compile bar(s2()); return 0; } even with the lack of typeof(), given a fixed set of properties it is very easy to implement this technique see working example at http://codepad.org/qXkESprl personally i see it as extremely useful for generic lib writers for some designes (of course if appropriately applied) as well as for users of such libs i would appreciate any thoughts on improvement of this technique within C++98 standard also any thoughts on portability are welcome if you have questions about how and/or why does it work feel free to ask -- Pavel

5 17

Macro redefinition in boost/cstdint.hpp (1.42 beta1)
by Vemund Handeland 02 Feb '10

02 Feb '10

I've tested my code with the 1.42 beta, and get a lot of macro redefinition warnings on my system (msvc-9.0) The problem is redefinition of INT64_C and UINT64_C in boost/cstdint.hpp. My code also includes the ICU library, and these two macros are already defined in the ICU headers. The problem then comes down to header include order... I see that the updated boost/cstdint.hpp only test !defined(INT8_C) before defining all INT#_C and UNIT#_C macros The solution to my problem is to test for existence on every macro before definition: #ifndef INT#_C #define INT#_C( value ) ... #endif Is this appropriate fix, and should I add a ticket for this? -Vemund

3 2

[thread][hpux][1.3.9]/usr/lib/dld.sl: Unresolved symbol: pthread_create (code)
by gopal haldar 02 Feb '10

02 Feb '10

Hi I am using boost 1.3.9 thread library for all platform(Windows and non-windows). Same code is runing in all platform but for HPUX, I am getting the following error during runtime. /usr/lib/dld.sl: Unresolved symbol: pthread_create (code) from /opt/bst/lib/libboost_thread.sl ABORT instruction (core dumped). But it is working fine with boost library 1.3.2. Please let me know the solution of this problem. Regards Gopal

2 1

[transaction] New Boost.Transaction library under discussion
by vicente.botet 02 Feb '10

02 Feb '10

Hi Stefan, Bob, I've created in the sandbox the transaction directory (http://svn.boost.org/svn/boost/sandbox/transaction/) so we can share our work. I've created also a wiki page (http://svn.boost.org/trac/boost/wiki/BoostTransaction) on which we can compile the result of our discussions, requirements for the library, design, ... If you don't have right access to the Boost wiki pages, please request them throught this ML. Of course, anyone is welcome to participate, or comment on this wiki. HTH, _____________________ Vicente Juan Botet Escribá

8 42

[Serialization] seg fault with BOOST_CLASS_EXPORT
by fab 01 Feb '10

01 Feb '10

Hi, Simply by adding BOOST_CLASS_EXPORT(MyClass), all executables, unit tests, etc. which compile with this class failed at the end of the execution with a seg fault. All the process is done but the application exit with a seg fault. I encounter this problem with some classes and not with others... I don't understand where the error comes from and I don't arrived to reproduce on a simple test. Best regards, Fabien Castan Program received signal SIGSEGV, Segmentation fault. strcmp () at ../sysdeps/i386/i686/strcmp.S:40 40 ../sysdeps/i386/i686/strcmp.S: Aucun fichier ou dossier de ce type. in ../sysdeps/i386/i686/strcmp.S Current language: auto The current source language is "auto; currently asm". (gdb) bt #0 strcmp () at ../sysdeps/i386/i686/strcmp.S:40 #1 0x004ed2c1 in boost::serialization::extended_type_info::key_unregister() () from /usr/lib/libboost_serialization.so.1.40.0 #2 0x004ed3e4 in boost::serialization::extended_type_info::~extended_type_info() () from /usr/lib/libboost_serialization.so.1.40.0 #3 0x004edc98 in boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0() () from /usr/lib/libboost_serialization.so.1.40.0 #4 0x0805861b in boost::serialization::extended_type_info_typeid<tuttle::host::ofx::attribute::OfxhClipDescriptor>::~extended_type_info_typeid() ( this=0x8189470) at /usr/include/boost/smart_ptr/detail/shared_count.hpp:221 #5 0x080586e5 in boost::serialization::detail::singleton_wrapper<boost::serialization::extended_type_info_typeid<tuttle::host::ofx::attribute::OfxhClipDescriptor> >::~singleton_wrapper() (this=0x8189470) at /usr/include/boost/smart_ptr/detail/shared_count.hpp:221 #6 0x0054f05f in __run_exit_handlers (status=0, listp=0x661304, run_list_atexit=true) at exit.c:78 #7 0x0054f0cf in *__GI_exit (status=0) at exit.c:100 #8 0x00536b5e in __libc_start_main (main=0x80561fa <main>, argc=1, ubp_av=0xbffff3a4, init=0x8126f80 <__libc_csu_init>, fini=0x8126f70 <__libc_csu_fini>, rtld_fini=0x198d20 <_dl_fini>, stack_end=0xbffff39c) at libc-start.c:252 #9 0x08052501 in _start () at ../sysdeps/i386/elf/start.S:119

2 3

[thread] why crash launching a thread?
by David M. Cotter 01 Feb '10

01 Feb '10

i'm launching a new thread from an existing background thread, BUT it is crashing. i don't know if it happens often yet, but was wondering what could possibly cause this? Thread 10 Crashed: 0 libSystem.B.dylib 0x96ce435d usleep$NOCANCEL$UNIX2003 + 0 1 libSystem.B.dylib 0x96d05a50 abort + 105 2 libstdc++.6.dylib 0x96bb2fda __gnu_cxx::__verbose_terminate_handler() + 433 3 libstdc++.6.dylib 0x96bb117a __cxxabiv1::__terminate(void (*)()) + 10 4 libstdc++.6.dylib 0x96bb11ba __cxxabiv1::__unexpected(void (*)()) + 0 5 libstdc++.6.dylib 0x96bb12b8 __gxx_exception_cleanup(_Unwind_Reason_Code, _Unwind_Exception*) + 0 6 libboost_thread.dylib 0x006af933 boost::thread::start_thread() + 195 7 com.kjams.kjams 0x001281d1 CThreads::Fork(APP_ThreadType, long (*)(void*, long), long (*)(void*, long), void*, char const*) + 1521 8 com.kjams.kjams 0x0012858b CT_Preemptive::call(char const*) + 91 9 com.kjams.kjams 0x00139fc2 CSpooler::Fork_Spool(CSpooler*, bool) + 290 10 com.kjams.kjams 0x0027fd05 CSongImporter::EncodeSong(CSI_PersistantQueData*, CSpooler*) + 1109

5 7

BoostCon 2010 preliminary program
by Hartmut Kaiser 01 Feb '10

01 Feb '10

Hey all, please find below a list of accepted submissions to BoostCon 2010. A tentative, fully scheduled program will be available soon. The keynote will be held by Maurice Herlihy. Maurice Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to the design of concurrent algorithms, and in particular to the exposition and quantification of the properties and uses of hardware synchronization operations. He is currently (2009) a professor of computer science at Brown University and one of the leading visionaries in the field of transactional memory. Following up on this keynote we will have a full day sessions and panel discussion where we plan for 4 different groups to talk about their work on transactional memory (Mark Moir (Sun), Tatiana Shpeisman (Intel), Michael Wong (IBM), Vicente Botet (TBoost.STM)) In addition we have a high quality, distinctive, fully packed, and very diverse list of accepted talks: João P. R. Abecasis: Cross-platform development with Qt and Boost Ruediger Berlich: Distributed parametric optimization with the Geneva library Dean Michael Berris: Techniques in Flexible Header-Only C++ Network Library Implementations Michael Caisse: Using Spirit 2.1: Qi and Karma An Asio Based Flash XML Server Marshall Clow: A (proposed) MIME library for Boost Tony Van Eerd: The Basics of Lock-free Programming Joel Falcou and Jean-Thierry Lapresté: The Numerical Template Toolbox: BOOST'ed Generic Array Library for High Performance Computing Joachim Faulhaber: Boost.Alabaster (proposed): A Law Based Tester Barend Gehrels, Bruno Lalande and Mateusz Loskot: Generic Programming for Geometry Justin Gottschlich: TBoost.STM's Engine: An Efficient Software Transactional Memory Using Commit-Time Invalidatio Douglas Gregor: Clang: An Open-Source C++ Compiler Library C++ Tool-Builders Workshop Christophe Henry: Tutorial: The Meta State Machine Library V2 Ken Joyner: Revisiting Guidelines to Using Exceptions in C++ Hartmut Kaiser and Joel de Guzman: RAD Spirit Spirit History and Evolution Zachary Laine and Matt Calabrese: Instantiations Must Go! Stephan Lavavej: Data Structure Visualizers in Visual Studio 2010 Nevin Liber: Type Erasure Eric Niebler: Practical DSEL Design with Proto Roshan Naik: Logic Paradigm for C++ Stjepan Rajko: Patterns Library: a generic library for modeling, recognition, and synthesis of sequential patterns Gennadiy Rozental: Production use of Boost.Test David Sankel: Functional Programming in C++ Jeremy Siek: Generic Programming and the Boost Graph Library Robert Ramey: Is Boost Broken? Michael Wong: C++0x Update C++0x Concurrency We believe this program is reason enough to come to BoostCon this year (Aspen, CO, USA, May 10-14th)! For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

[log] Release Candidate 4 released
by Andrey Semashev 01 Feb '10

01 Feb '10

I'm proud to announce that I've released the fourth candidate of Boost.Log for the review. There were many improvements since the passed year of development. Many of them reflect the discussion of RC3. Here's a short list of major changes: * Substantial documentation improvement. The tutorial section has been reorganized. * Removed rotating file stream. As a replacement, a new file sink has been added, which allows to achieve the same results ans adds a few more features. It is now possible to collect rotated log files in a dedicated directory. * Added a new multifile sink backend. * Added a new ordering asynchronous sink frontend. * The syslog sink backend is now supported on Windows, too. The sink no longer requires native support for POSIX API for syslog, but is able to send syslog packets to a remote server over UDP. * Added support for scoped logging. There is now a distinct log record entity, which is returned by the core as a result of filtring. * Added support for exception control. * Added a new mode of logging, called trivial logging. The more complete change log is available here: http://tinyurl.com/ybcghuf The library with docs, tests and examples has been updated in Boost.Vault: http://tinyurl.com/cm9lum There's SVN repository available on SourceForge project page: http://tinyurl.com/ye23wyh The docs are also available online here: http://tinyurl.com/5e4fd7 Comments are welcome.

9 37

Boost.Atomic request for review/inclusion
by Helge Bahmann 01 Feb '10

01 Feb '10

Hello, First of all I would like to thank for the comments that I have received so far, I have incorporated almost all of them I think. Boost.Atomic is now in a form that I consider calling it a release. It has support for "true" atomic variables on: - gcc/x86, 32-bit (tested on Linux, FreeBSD) - gcc/x86, 64-bit (tested on Linux) - gcc/powerpc32 (tested on Linux, Mac OS X) - gcc/powerpc64 (untested) - generic Win32 (tested with Visual Studio Express on Win XP) For all others it falls back gracefully to locked operation. There is proper quickbook documentation, including a hopefully illustrative example section. If you have an unsupported platform, contact me and I will attempt to provide support for it (usually it is just a matter of testing). Otherwise I would like to request considering the library for inclusion and appreciate any further comments. Everything available as usual at: http://www.chaoticmind.net/~hcb/projects/boost.atomic Best regards Helge

6 12

[1.42.0] OK to build RC?
by Beman Dawes 01 Feb '10

01 Feb '10

If anyone knows of any 1.42.0 showstoppers, please post something right away. Otherwise we will start to put a release candidate together in a couple of hours. --Beman

1 0