- Boost - lists.preview.boost.org

[smart_ptr] small step approach
by Daniel Frey 13 Apr '08

13 Apr '08

Hi, since passing or not passing the deleter to sp_accept_owner seems controversial, I'd like to try another approach: Smaller patches/steps. The attached patch is a minimalistic version of my previous patches. It doesn't change sp_accept_owner's current design. With this patch, I'd be able to implement my own, optimized version of enable_shared_from_this, which is otherwise not possible. Do you see any problem with this patch or with the approach in general? Regards, Daniel

1 0

High Cost of MS "Safe" STL for Release Builds
by Mat Marcus 13 Apr '08

13 Apr '08

### Overview ### In a recent thread regarding issues in the boost::System library, we began a discussion on the performance cost, *in release builds*, of accepting the default Microsoft compiler setting that enables the so-called secure STL feature. In this post I am adding some source code excerpts, from a colleague's benchmark suite, that I used to generate the results (reproduced below). I am also changing the subject line to better reflect the topic under discussion. Summary: In VC8 (Dev Studio 2005) and later, Microsoft's 'secure' STL feature (enabled by default) can cause a slowdown of more than an order of magnitude in the execution of performance critical algorithms in release builds. I suspect that many projects would benefit from ensuring that _SECURE_SCL=0 for release configurations. I recommend that boost ships with this feature disabled by default for (at least) release builds. Microsoft product managers claim that the performance cost for release builds is negligible. For example, Peter Dimov cited a thread that lead me to the following claim: Martyn Lovell> I strongly recommend against turning off Martyn Lovell> _SECURE_SCL. The perf win is normally minor, and Martyn Lovell> the security risk is much higher. If you find a Martyn Lovell> major perf issue with _SECURE_SCL, please let us Martyn Lovell> know. http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=863481&SiteID=1#882374 The benchmarks below offer a different view of the performance costs. (Please don't confuse this discussion with the separate feature controlling compiler warnings. In some configurations, the MS compiler warning that routines like std::copy are inherently unsafe. The original text of the warnings claimed that such routines had been "deprecated". We have not deprecated such routines in the C++ committee. The _SCL_SECURE_NO_DEPRECATE can be used to control such warnings, but this issue is separate from the performance impact of the _SECURE_SCL feature.) A colleague has been developing some benchmarks that aim to help compiler vendors ensure that they properly support C++ programming, and to help programmers understand the costs of the algorithms and data structures that they use. Instead of using his suite to measure the relative performance of different compilers, I ran some tests completely under VC 9 to measure only the Release build performance of the 'secure' STL. (Interestingly, the penalty seems to have increased from VC8 to VC9. But the numbers for VC8 are also disheartening.) ### Details ### I ran the stepanov_vector benchmark (excerpted below) twice, once with default boost build settings ("secure" STL enabled) and once with it turned off. That is, I built with settings roughly equivalent to: bjam release bjam release define=_SCL_SECURE=0 This benchmark attempts, amongst other things, to measure the abstraction penalty by comparing the performance of different algorithms when using a vendor's vector with associated iterator type vs. an array with pointers. When reading the results below, 'double pointer' denotes a test using an array of doubles (pointer iterators), where 'double vector' means a vector of doubles (vector::iterator). Note that sometimes the penalty exceeds an order of magnitude . In light of these results, one could argue that_SECURE_SCL for release builds is a misfeature. I won't debate whether it is worth the slowdown for normal (non-extreme) debugging situations. Results follow for 'secure' STL and then normal STL. These are followed by a source code excerpt from the pre-release benchmark suite. As Peter pointed out, SECURE_SCL setting must be consistent throughout linkage units, or else the resulting ODR violations can lead to memory corruption etc. For this reason, I would like to see boost build add a link-incompatible feature, something like: on/off :-) whose default setting is off for release. Of course something like might be a more realistic name. Of course one can manually achieve a similar effect using the bjam command line above. But with such an approach it is too easy to mix and match, the defaults are backwards, and there seems to be relatively little support for projects built with boost build that bring in boost libraries via properties. Alternatively, it might be worth considering whether we could control the feature via configuration header files. - Mat ### release build with _SECURE_SCL enabled ### c:\boxer\performance\projects\msvc8\Release\stepanov_vector.exe test description absolute operations ratio with number time per second test0 0 "double pointer verify2" 3.03 sec 989.77 M 1.00 1 "DoubleClass pointer verify2" 3.05 sec 984.57 M 1.01 2 "double vector" 16.14 sec 185.86 M 5.33 3 "DoubleClass vector" 18.19 sec 164.95 M 6.00 4 "double vector reverse" 26.23 sec 114.35 M 8.66 5 "DoubleClass vector reverse" 26.20 sec 114.49 M 8.65 6 "double vector reverse reverse" 31.25 sec 96.00 M 10.31 7 "DoubleClass vector reverse reverse" 31.25 sec 96.00 M 10.31 Total absolute time for Vector accumulate: 155.34 sec Vector accumulate Penalty: 5.92 test description absolute operations ratio with number time per second test0 0 "insertion_sort double pointer verify2" 1.16 sec 2.60 M 1.00 1 "insertion_sort DoubleClass pointer verify2" 1.58 sec 1.90 M 1.37 2 "insertion_sort double vector" 19.58 sec 0.15 M 16.94 3 "insertion_sort DoubleClass vector" 18.00 sec 0.17 M 15.57 4 "insertion_sort double vector reverse" 30.56 sec 0.10 M 26.44 5 "insertion_sort DoubleClass vector reverse" 29.06 sec 0.10 M 25.14 6 "insertion_sort double vector reverse reverse" 43.03 sec 0.07 M 37.22 7 "insertion_sort DoubleClass vector reverse reverse" 43.05 sec 0.07 M 37.24 Total absolute time for Vector Insertion Sort: 186.02 sec Vector Insertion Sort Penalty: 16.49 test description absolute operations rati o with number time per second test 0 0 "quicksort double pointer verify2" 1.64 sec 14.63 M 1.00 1 "quicksort DoubleClass pointer verify2" 1.95 sec 12.29 M 1.19 2 "quicksort double vector" 5.03 sec 4.77 M 3.07 3 "quicksort DoubleClass vector" 5.22 sec 4.60 M 3.18 4 "quicksort double vector reverse" 7.16 sec 3.35 M 4.36 5 "quicksort DoubleClass vector reverse" 7.34 sec 3.27 M 4.48 6 "quicksort double vector reverse reverse" 8.84 sec 2.71 M 5.39 7 "quicksort DoubleClass vector reverse reverse" 9.06 sec 2.65 M 5.52 Total absolute time for Vector Quicksort: 46.25 sec Vector Quicksort Penalty: 3.52 test description absolute operations rati o with number time per second test 0 0 "heap_sort double pointer verify2" 1.81 sec 13.24 M 1.00 1 "heap_sort DoubleClass pointer verify2" 1.88 sec 12.80 M 1.03 2 "heap_sort double vector" 7.84 sec 3.06 M 4.33 3 "heap_sort DoubleClass vector" 7.89 sec 3.04 M 4.35 4 "heap_sort double vector reverse" 10.80 sec 2.22 M 5.96 5 "heap_sort DoubleClass vector reverse" 10.31 sec 2.33 M 5.69 6 "heap_sort double vector reverse reverse" 13.23 sec 1.81 M 7.30 7 "heap_sort DoubleClass vector reverse reverse" 13.22 sec 1.82 M 7.29 Total absolute time for Vector Heap Sort: 66.98 sec Vector Heap Sort Penalty: 4.46 ### release build with _SECURE_SCL disabled ### c:\boxer\performance\projects\msvc8\Release\stepanov_vector.exe test description absolute operations ratio with number time per second test0 0 "double pointer verify2" 3.03 sec 989.45 M 1.00 1 "DoubleClass pointer verify2" 3.05 sec 984.57 M 1.00 2 "double vector" 3.06 sec 979.75 M 1.01 3 "DoubleClass vector" 3.05 sec 984.57 M 1.00 4 "double vector reverse" 3.06 sec 979.75 M 1.01 5 "DoubleClass vector reverse" 3.05 sec 984.57 M 1.00 6 "double vector reverse reverse" 3.09 sec 969.62 M 1.02 7 "DoubleClass vector reverse reverse" 3.06 sec 979.43 M 1.01 Total absolute time for Vector accumulate: 24.45 sec Vector accumulate Penalty: 1.01 test description absolute operations ratio with number time per second test0 0 "insertion_sort double pointer verify2" 1.16 sec 2.60 M 1.00 1 "insertion_sort DoubleClass pointer verify2" 1.58 sec 1.90 M 1.37 2 "insertion_sort double vector" 1.58 sec 1.90 M 1.37 3 "insertion_sort DoubleClass vector" 2.08 sec 1.44 M 1.80 4 "insertion_sort double vector reverse" 1.55 sec 1.94 M 1.34 5 "insertion_sort DoubleClass vector reverse" 2.03 sec 1.48 M 1.76 6 "insertion_sort double vector reverse reverse" 1.59 sec 1.88 M 1.38 7 "insertion_sort DoubleClass vector reverse reverse" 2.09 sec 1.43 M 1.81 Total absolute time for Vector Insertion Sort: 13.66 sec Vector Insertion Sort Penalty: 1.53 test description absolute operations rati o with number time per second test 0 0 "quicksort double pointer verify2" 1.75 sec 13.71 M 1.00 1 "quicksort DoubleClass pointer verify2" 2.06 sec 11.64 M 1.18 2 "quicksort double vector" 1.80 sec 13.36 M 1.03 3 "quicksort DoubleClass vector" 2.14 sec 11.21 M 1.22 4 "quicksort double vector reverse" 1.78 sec 13.48 M 1.02 5 "quicksort DoubleClass vector reverse" 2.13 sec 11.29 M 1.21 6 "quicksort double vector reverse reverse" 1.78 sec 13.48 M 1.02 7 "quicksort DoubleClass vector reverse reverse" 2.16 sec 11.13 M 1.23 Total absolute time for Vector Quicksort: 15.59 sec Vector Quicksort Penalty: 1.13 test description absolute operations rati o with number time per second test 0 0 "heap_sort double pointer verify2" 1.80 sec 13.36 M 1.00 1 "heap_sort DoubleClass pointer verify2" 1.83 sec 13.12 M 1.02 2 "heap_sort double vector" 1.88 sec 12.80 M 1.04 3 "heap_sort DoubleClass vector" 2.05 sec 11.73 M 1.14 4 "heap_sort double vector reverse" 2.14 sec 11.21 M 1.19 5 "heap_sort DoubleClass vector reverse" 2.28 sec 10.52 M 1.27 6 "heap_sort double vector reverse reverse" 1.88 sec 12.80 M 1.04 7 "heap_sort DoubleClass vector reverse reverse" 2.03 sec 11.81 M 1.13 Total absolute time for Vector Heap Sort: 15.88 sec Vector Heap Sort Penalty: 1.12 ### pre-release benchmark source code excerpt ### /* Copyright 2007-2008 Adobe Systems Incorporated Distributed under the MIT License (see accompanying file LICENSE_1_0_0.txt or a copy at http://stlab.adobe.com/licenses.html) Goal: examine any change in performance when moving from pointers to vector iterators Assumptions: 1) Vector iterators should not perform worse than raw pointers. 2) Using a vector should not perform worse than using a plain array of values. HIstory: This is similar to Alex Stepanov's original abstraction penalty benchmark. But the use of the STL container adds complexity and dependencies that don't fit with the design of the original benchmark, so this is broken out into a separate test. Now we are testing the STL vector implementation in addition to the compiler. #include #include #include #include #include #include #include "benchmark_results.h" #include "benchmark_timer.h" #include "benchmark_algorithms.h" #include /******************************************************************************/ // a single double value wrapped in a struct struct DoubleClass { double value; DoubleClass() {} DoubleClass(const double& x) : value(x) {} operator double() { return value; } }; inline DoubleClass operator+(const DoubleClass& x, const DoubleClass& y) { return DoubleClass(x.value + y.value); } inline bool operator<(const DoubleClass& x, const DoubleClass& y) { return (x.value < y.value); } /******************************************************************************/ // reverse iterator template template struct reverse_iterator { RandomAccessIterator current; reverse_iterator(RandomAccessIterator x) : current(x) {} T& operator*() const { RandomAccessIterator tmp = current; return *(--tmp); } }; // really a distance between pointers, which must return ptrdiff_t // because (ptr - ptr) --> ptrdiff_t template inline ptrdiff_t operator-(reverse_iterator& xx, reverse_iterator& yy) { return (ptrdiff_t)( yy.current - xx.current ); } template inline reverse_iterator& operator++(reverse_iterator &xx) { --xx.current; return xx; } template inline reverse_iterator& operator--(reverse_iterator &xx) { ++xx.current; return xx; } template inline reverse_iterator operator++(reverse_iterator &xx, int) { reverse_iterator tmp = xx; ++xx; return tmp; } template inline reverse_iterator operator--(reverse_iterator &xx, int) { reverse_iterator tmp = xx; --xx; return tmp; } template inline reverse_iterator operator-(reverse_iterator &xx, ptrdiff_t inc) { reverse_iterator tmp = xx; tmp.current += inc; return tmp; } template inline reverse_iterator operator+(reverse_iterator &xx, ptrdiff_t inc) { reverse_iterator tmp = xx; tmp.current -= inc; return tmp; } template inline reverse_iterator& operator+=(reverse_iterator &xx, ptrdiff_t inc) { xx.current -= inc; return xx; } template inline reverse_iterator& operator-=(reverse_iterator &xx, ptrdiff_t inc) { xx.current += inc; return xx; } template inline bool operator<(const reverse_iterator& x, const reverse_iterator& y) { return (y.current < x.current); } template inline bool operator==(const reverse_iterator& x, const reverse_iterator& y) { return (x.current == y.current); } template inline bool operator!=(const reverse_iterator& x, const reverse_iterator& y) { return (x.current != y.current); } /******************************************************************************/ /******************************************************************************/ // this constant may need to be adjusted to give reasonable minimum times // For best results, times should be about 1.0 seconds for the minimum test run int iterations = 1500000; // 2000 items, or about 16k of data // this is intended to remain within the L2 cache of most common CPUs #define SIZE 2000 // initial value for filling our arrays, may be changed from the command line double init_value = 3.0; /******************************************************************************/ /******************************************************************************/ inline void check_sum(double result) { if (result != SIZE * init_value) printf("test %i failed\n", current_test); } /******************************************************************************/ template void verify_sorted(Iterator first, Iterator last) { if (!is_sorted(first,last)) printf("sort test %i failed\n", current_test); } /******************************************************************************/ // a template using the accumulate template and iterators template void test(Iterator first, Iterator last, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) check_sum( double( accumulate(first, last, zero) ) ); record_result( timer(), label ); } /******************************************************************************/ template void test_insertion_sort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); insertionSort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ template void test_quicksort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); quicksort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ template void test_heap_sort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); heapsort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ /******************************************************************************/ // our global arrays of numbers to be summed double data[SIZE]; DoubleClass Data[SIZE]; double dataMaster[SIZE]; DoubleClass DataMaster[SIZE]; /******************************************************************************/ // declaration of our iterator types and begin/end pairs typedef double* dp; dp dpb = data; dp dpe = data + SIZE; dp dMpb = dataMaster; dp dMpe = dataMaster + SIZE; typedef DoubleClass* Dp; Dp Dpb = Data; Dp Dpe = Data + SIZE; Dp DMpb = DataMaster; Dp DMpe = DataMaster + SIZE; typedef std::vector::iterator vdp; typedef std::vector::iterator vDp; typedef std::vector::reverse_iterator rvdp; typedef std::vector::reverse_iterator rvDp; typedef reverse_iterator rrvdp; typedef reverse_iterator rrvDp; /******************************************************************************/ /******************************************************************************/ int main(int argc, char** argv) { double dZero = 0.0; DoubleClass DZero = 0.0; // output command for documentation: int i; for (i = 0; i < argc; ++i) printf("%s ", argv[i] ); printf("\n"); if (argc > 1) iterations = atoi(argv[1]); if (argc > 2) init_value = (double) atof(argv[2]); // seed the random number generator so we get repeatable results srand( (int)init_value + 123 ); ::fill(dpb, dpe, double(init_value)); ::fill(Dpb, Dpe, DoubleClass(init_value)); std::vector vec_data; std::vector vec_Data; vec_data.resize(SIZE); vec_Data.resize(SIZE); rrvdp rvdpb(vec_data.rend()); rrvdp rvdpe(vec_data.rbegin()); rrvDp rvDpb(vec_Data.rend()); rrvDp rvDpe(vec_Data.rbegin()); ::fill(vec_data.begin(), vec_data.end(), double(init_value)); ::fill(vec_Data.begin(), vec_Data.end(), DoubleClass(init_value)); test(dpb, dpe, dZero, "double pointer verify2"); test(Dpb, Dpe, DZero, "DoubleClass pointer verify2"); test(vec_data.begin(), vec_data.end(), dZero, "double vector"); test(vec_Data.begin(), vec_Data.end(), DZero, "DoubleClass vector"); test(vec_data.rbegin(), vec_data.rend(), dZero, "double vector reverse"); test(vec_Data.rbegin(), vec_Data.rend(), DZero, "DoubleClass vector reverse"); test(rvdpb, rvdpe, dZero, "double vector reverse reverse"); test(rvDpb, rvDpe, DZero, "DoubleClass vector reverse reverse"); summarize("Vector accumulate", SIZE, iterations, kShowGMeans, kShowPenalty ); // the sorting tests are much slower than the accumulation tests - O(N^2) iterations = iterations / 1000; std::vector vec_dataMaster; std::vector vec_DataMaster; vec_dataMaster.resize(SIZE); vec_DataMaster.resize(SIZE); // fill one set of random numbers fill_random( dMpb, dMpe ); // copy to the other sets, so we have the same numbers ::copy( dMpb, dMpe, DMpb ); ::copy( dMpb, dMpe, vec_dataMaster.begin() ); ::copy( dMpb, dMpe, vec_DataMaster.begin() ); rrvdp rvdMpb(vec_dataMaster.rend()); rrvdp rvdMpe(vec_dataMaster.rbegin()); rrvDp rvDMpb(vec_DataMaster.rend()); rrvDp rvDMpe(vec_DataMaster.rbegin()); test_insertion_sort(dMpb, dMpe, dpb, dpe, dZero, "insertion_sort double pointer verify2"); test_insertion_sort(DMpb, DMpe, Dpb, Dpe, DZero, "insertion_sort DoubleClass pointer verify2"); test_insertion_sort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "insertion_sort double vector"); test_insertion_sort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "insertion_sort DoubleClass vector"); test_insertion_sort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "insertion_sort double vector reverse"); test_insertion_sort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "insertion_sort DoubleClass vector reverse"); test_insertion_sort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "insertion_sort double vector reverse reverse"); test_insertion_sort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "insertion_sort DoubleClass vector reverse reverse"); summarize("Vector Insertion Sort", SIZE, iterations, kShowGMeans, kShowPenalty ); // these are slightly faster - O(NLog2(N)) iterations = iterations * 8; // iterations / 25 test_quicksort(dMpb, dMpe, dpb, dpe, dZero, "quicksort double pointer verify2"); test_quicksort(DMpb, DMpe, Dpb, Dpe, DZero, "quicksort DoubleClass pointer verify2"); test_quicksort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "quicksort double vector"); test_quicksort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "quicksort DoubleClass vector"); test_quicksort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "quicksort double vector reverse"); test_quicksort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "quicksort DoubleClass vector reverse"); test_quicksort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "quicksort double vector reverse reverse"); test_quicksort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "quicksort DoubleClass vector reverse reverse"); summarize("Vector Quicksort", SIZE, iterations, kShowGMeans, kShowPenalty ); test_heap_sort(dMpb, dMpe, dpb, dpe, dZero, "heap_sort double pointer verify2"); test_heap_sort(DMpb, DMpe, Dpb, Dpe, DZero, "heap_sort DoubleClass pointer verify2"); test_heap_sort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "heap_sort double vector"); test_heap_sort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "heap_sort DoubleClass vector"); test_heap_sort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "heap_sort double vector reverse"); test_heap_sort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "heap_sort DoubleClass vector reverse"); test_heap_sort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "heap_sort double vector reverse reverse"); test_heap_sort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "heap_sort DoubleClass vector reverse reverse"); summarize("Vector Heap Sort", SIZE, iterations, kShowGMeans, kShowPenalty ); return 0; } // the end /******************************************************************************/ /******************************************************************************/

5 4

[1.35] [serialization] header dependency when using msvc-8.0
by Stefan Heinzmann 13 Apr '08

13 Apr '08

Hi all, this very simple program here didn't compile with msvc-8.0 and boost 1.35: // bugtest-boost-1.35-mpl.cpp #include <boost/serialization/map.hpp> int main(int argc, char* argv[]) { return 0; } The compiler outputs those error lines: d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2039: 'and_' : is not a member of 'boost::mpl' d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(50) : see reference to class template instantiation 'boost::serialization::is_bitwise_serializable<std::pair<_Ty1,_Ty2>>' being compiled d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2504: 'and_' : base class undefined d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2143: syntax error : missing ',' before '<' Adding another include line before the existing one makes the compile succeed: #include <boost/mpl/and.hpp> Surely this must be a simple bug in the serialization library. Cheers Stefan

3 3

BOOST_HAS_PTHREADS, BOOST_HAS_SCHED_YIELD tests in config_test not strict enough
by Peter Dimov 13 Apr '08

13 Apr '08

I'm looking at the results of some new tests I added to smart_ptr: spinlock_try_test, yield_k_test, and I'm seeing failures on platforms that (in single threaded mode, i.e. without <threading>multi) advertise BOOST_HAS_PTHREADS (and BOOST_HAS_SCHED_YIELD) but in reality do one of: 1. provide stub implementations of pthread_mutex_*, failing a pthread_mutex_trylock test; 2. provide stubs and segfault on pthread_mutex_trylock; 3. fail to link because of missing pthread_mutex_trylock; 4. fail to link because of missing sched_yield. This isn't particularly odd or surprising. But I think that config_test ought to fail on these platforms, for the same reason my tests fail. The reason the test passes is because boost_has_pthreads.ipp and boost_has_sched_yield.ipp are too permissive; the first one only tests pthread_mutex_* functions that are stubbed and appear to work, the second doesn't attempt to actually call sched_yield and - presumably - the linker discards the reference. Does this make any sense? :-)

2 22

[smart_ptr] enable_shared_from_this_light
by Daniel Frey 13 Apr '08

13 Apr '08

Hi, I attached a complete implementation of enable_shared_from_this_light which has an overhead of a single plain pointer. It is compatible with 1.35.0's enable_shared_from_this, except for one feature: The optimized version requires that the following static_cast is legal: enable_shared_from_this_light<T>* p; static_cast<T*>(p); which means that enable_shared_from_this_light<T> must be a *non-virtual* base class of T. If you need this feature, you might want to use trunk's enable_shared_from_this (without _light), which (currently) has an overhead of four plain pointers, one bool and it adds/requires the class to have a vtable. The trunk version therefore offers some advanced features. The above repeats a few things for those people that haven't followed the discussion in the "[smart_ptr] Some questions"-thread. For those that did: The thing to note is that I added two more things to shared_ptr: _internal_shared_count() and a ctor which takes a detail::weak_count and the raw pointer. Any feedback welcome. Regards, Daniel

4 15

[graph] Dangerous undocumented EdgeList parameter for adjacency_list.
by Jurko Gospodnetić 13 Apr '08

13 Apr '08

Hi. We have just finished a painful three day track-down for a mysterious access violation/crash/undefined behavior bug and the cause has been tracked down to some graph library edge descriptors getting invalidated in a case that is completely undocumented (that in turn causing memory trashing and all the lovely things that follow...) When you have an adjacency_list graph with its EdgeList (not OutEdgeList) parameter set to vecS, then any add_edge() operation may invalidate all existing edge descriptors. This is not documented anywhere - not under the add_edge() operation and not under the 'Iterator and Descriptor Stability/Invalidation' section in adjacency_list.html which in fact explicitly states that add_edge() operation does not invalidate edge descriptors. Please, please, please document this whole EdgeList concept and how it interacts with the rest of the graph library. Also, this behavior is not consistent with add_vertex() which does not invalidate any existing vertex descriptors. Edge descriptors seem to contain a pointer directly into their graph's edge storage, and that causes them to be invalidated whenever that storage gets reallocated. Any reason why they should not be holding an index to that storage in case EdgeList=vecS similar to how vertex descriptors identify their vertex? That way this whole problem with add_edge() invalidating all existing edge descriptors would be avoided. Thanks in advance. Best regards, Jurko Gospodnetić

1 1

[graph] Documentation error for the adjacency_list_traits<> type.
by Jurko Gospodnetić 13 Apr '08

13 Apr '08

Hi. The adjacency_list_traits<> documentation (adjacency_list_traits.html) lists its first template argument as EdgeList while it should be OutEdgeList. The way it is written now it causes confusion between the OutEdgeList and the (seemingly still unfinished) EdgeList concept. Hope this helps. Best regards, Jurko Gospodnetić

1 0

[graph] Invalid link in the documentation.
by Jurko Gospodnetić 13 Apr '08

13 Apr '08

Hi. The 'BGL Book Errata' link in table_of_contents.html links to http://siek.info/bgl.html which in turn requires the user to enter a password to access. This should be fixed. This could possibly be happening due to an invalid link target and the HTTP server redirecting the call to the root folder to which access is protected by a password. Hope this helps. Best regards, Jurko Gospodnetić

1 0

[gil] [announcement] New IO lib
by Tom Brinkman 12 Apr '08

12 Apr '08

>> https://gil-contributions.googlecode.com/svn/trunk/gil_2/boost/gil/extensio… Link requires a password. You should add a link to summary page so people can get a quick introduction to your proposals. This is a link to svn. Is there any documentation yet? Definately get this added to the review queue. If nothing else it will create lots of interesting discussions. Nice work. I'll be using it.

2 1

boost::shared_ptr/weak_ptr
by Patrick Twohig 12 Apr '08

12 Apr '08

I've been maintaining/developing a fairly large application which has been built entirely without the use of exceptions. Two of the major target platforms have weak or no exception support. Anyhow, It appears that the function weak_ptr<T>::lock() relies on an exception thrown by shared_ptr<T>'s constructor in order to work properly. I'm assuming based on the code for lock() that the reason the call uses an exception is because the constructor of shared_ptr uses an atomic operation to perform the reference counting. I was curious if perhaps and appropriate solution for compilers lacking support for exceptions would be to simply make the constructors for boost::shared_ptr construct a shared_ptr equivalent to shared_ptr<T> ptr( 0 ); I'm assuming that if the constructors of shared_ptr never throw (even if the interface indicates so) using weak_ptr::lock() would be safe based on the code below, taken directly from weak_ptr.hpp. shared_ptr<T> lock() const // never throws { #if defined(BOOST_HAS_THREADS) // optimization: avoid throw overhead if(expired()) { return shared_ptr<element_type>(); } try { return shared_ptr<element_type>(*this); } catch(bad_weak_ptr const &) { // Q: how can we get here? // A: another thread may have invalidated r after the use_count test above. return shared_ptr<element_type>(); } #else // optimization: avoid try/catch overhead when single threaded return expired()? shared_ptr<element_type>(): shared_ptr<element_type>(*this); #endif }

3 5

[1.35] System: error_code.cpp #defines macros without checking if already defined
by Mat Marcus 11 Apr '08

11 Apr '08

Hi Beman, error_code.cpp contains the following #defines: #define _CRT_SECURE_NO_DEPRECATE #define _SCL_SECURE_NO_DEPRECATE It should first check that these macros are not defined already. Otherwise users who #define these macros on the command line will received duplicate definition errors, as I am. Also, you might consider adding: #define _SECURE_SCL 0 for VC 9. - Mat

8 17

[Boost][Spirit] Missing libs/spirit/test directory?
by K. Noel Belcourt 11 Apr '08

11 Apr '08

Hi, The nightly builds are broken because the boost/status/Jamfile.v2 contains this line build-project ../libs/spirit/test ; # test-suite spirit but this directory doesn't appear to exist in the repository. Bjam fails with the this message. error: Unable to find file or target named error: '../libs/spirit/test' error: referred from project at error: '.' Could someone fix this? Thanks. -- Noel

3 2

Re: [boost] [move semantics] Do we have any plan for move semantics emulation?
by vicente.botet 11 Apr '08

11 Apr '08

Hello, In 2005 David Abrahams presented its implementation of move semantics. In Jul 24, 2006 Ion Gaztañaga posted http://www.nabble.com/-move-semantics--Do-we-have-any-plan-for-move-semanti… Since then there is some Boost libraries that use this implementation internnally (I'm thinking of course on Boost.Interprocess, Boost.Thread), but each one changing the namespace. In addition Boost.Thread has an internal move class with a simplified implementation intendeed for the same sematics. This make very difficult to interact between different libraries using the same concept but with a different name. In addition there is a risk that these implementation diverge. Even if the implementation is only an emulation ot the C++0x move semantics, this should be better than nothing? I'd like to reiterate the Ion question, "Do we have any plan for move semantics emulation ?" Best regards _____________________ Vicente Juan Botet Escriba

3 2

[smart_ptr] Some questions
by Daniel Frey 11 Apr '08

11 Apr '08

Hi, I was asked to present smart_ptr to our department, but while trying to understand the details of the implementation, I found some things that I don't understand: 1) in shared_ptr.hpp, the ctor which takes a weak_ptr doesn't copy px from r.px in the initializer list like all other ctors, instead the copy is done the the ctor body. There is even a comment which suggests that there is a problem with doing it before pn, it would not be "safe". What exactly does this mean? px is just a plain pointer, so AFAICS it won't hurt to simply say: template<class Y> explicit shared_ptr(weak_ptr<Y> const & r) : px(r.px), pn(r.pn) // may throw { } or is the current code some kind of optimization? 2) in detail/shared_count.hpp, operator= for shared_count has an optimization for tmp==pi_. At least I think that it's just an optimization and it would work without the check. OTOH, operator= for weak_count does not check for tmp==pi_. Why? Is there any deeper reason that these two code fragements differ? 3) I asked about this point before, but got no real answer: There is no throw specification in shared_from_this()'s documentation. AFAICS, shared_from_this() (if used correctly) can not throw. But will this be guaranteed? Also, it seems that enable_shared_from_this is getting some new features. Previously, enable_shared_from_this added a single weak_ptr to the derived class. Now it adds a vtable, a shared_ptr, a weak_ptr and a bool variable. Am I the only one who is concerned about this? Before the change, I even wondered if the weak_ptr could be replaced by a detail::weak_count, which would reduce the overhead from two plain pointers to only one plain pointer, since shared_from_this always has *this. Regards, Daniel

3 26

Using new threads - link issues
by Amit 11 Apr '08

11 Apr '08

Hi, I understand that using tss with the threads library (statically linked, ICL 10.1 on Win32) forces the user to define tss_cleanup_implemented() in the global namespace. Since there is no documentation on this, I would appreciate some information as to whether there are any gotchas: I am assuming that tss_cleanup_implemented() is the place where all thread_specific_ptr's should be reset(). Is there anything else required? Also, are there any special considerations when some of the threads might not have been started through Boost.threads? Btw, thread.hpp is extremely fiddly to use, since it does not define WIN32_LEAN_AND_MEAN, which leads to winsock.h getting included which makes it unuseable with any networking libraries (that use winsock2). I ended up creating my ouwn header that includes this after defning the macro. Thanks a lot Amit

2 7

Egg 2nd request for reviews
by dan marsden 11 Apr '08

11 Apr '08

Hi All The review of the Egg library by Shunsuke Sogame has been running for 1 week now. There has been some discussion of the library on a couple of related threads, but no reviews submitted so far. Please try and find time to submit a review of this library if possible. If you wish to review, but don't have time before the review ends on April 13th, please post to that effect, we may be able to extend / move the review period to help reviewers. Introduction: It is not so easy to define Function Objects especially if you want to support Boost.ResultOf and Boost.Lambda. Therefore, as Boost provides iterator_facade and iterator adaptors, Egg provides function_facade and function adaptors. Egg provides the following features: * Workaround for the Forwarding Problem http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm * Helpers to build Function Objects: * egg::function and egg::function_facade provides the way to build Function Objects which supports Boost.ResultOf and Lambda. * Function Objects Adaptors(in other words, higher-order functions): * egg::curryN supports the currying. * egg::pipable emulates extension methods(C#). * egg::fuse/unfuse emulates variadic functions. * egg::nestN represents nested lambda expressions. * etc... The documentation is on line: http://p-stade.sourceforge.net/boost/libs/egg/ The zipped source code is in Vault/FunctionObjects: http://tinyurl.com/34lgda Tested under: Boost Development Trunk and Boost Version1.34.1. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Thanks Dan Marsden Review Manager ___________________________________________________________ Yahoo! For Good helps you make a difference http://uk.promotions.yahoo.com/forgood/

5 12

[egg] some comments
by Giovanni Piero Deretta 11 Apr '08

11 Apr '08

I'm attaching some comments after a not-so-brief reading of the egg documentations. I've started the review a while ago, so some of the comments (especially those about static initialization) might be obsolete after the long discussion I had with the author in another thread, but Shunsuke Sogame might want to respond again for those that missed that thread. This is not yet a complete review, I want to spur further discussion on this library (especially on the documentation) before providing a final review. Finally I would like to encourage others to review this library (no reviews yet and we are in the second week!) because it provides some extremely needed functionalities. -- gpd

3 11

Trac open bugs - by assignee
by Marshall Clow 11 Apr '08

11 Apr '08

[ 287 open bugs today, 283 Wednesday ] If you are maintaining a library, and have not logged into the trac system at <http://svn.boost.org/trac/boost/>, please do so ASAP. Until you do that, no tickets can be assigned to you, and will remain under "None". Instructions on working with tickets can be found at: <http://svn.boost.org/trac/boost/wiki/TicketWorkflow> and a mapping of user names to "real names" can be found at: <http://svn.boost.org/trac/boost/report/16> Bug summary 26 djowel 24 az_sw_dude 23 grafik 16 vladimir_prus 14 dave 14 bemandawes 13 dgregor 12 doug_gregor 11 no-maintainer 11 agurtovoy 10 anthonyw 9 jsiek 9 danieljames 8 turkanis 7 nesotto 6 rogeeff 6 None 5 witt 5 ramey 5 johnmaddock 5 igaztanaga 4 ebf 4 danielw 3 samuel_krempp 3 pdimov 3 pavol_droba 3 nasonov 3 kaalus 2 troyer 2 shammah 2 jmaurer 2 hkaiser 2 garcia 2 eric_niebler 2 aaron_windsor 1 urzuga 1 t_schwinger 1 speedsnail 1 matias 1 marshall 1 fcacciola 1 dlwalker 1 chris_kohlhoff 1 <Blank> <Blank> 1750 Autolink library name not in sync with actually build lib None 1644 Boost.Test missing documentation file BOOST_CHECK_CLOSE_FRACTION.html None 1736 Headers containing non ASCII characters cause MS VC to issue warning 4819 in some locales None 1744 No information on building static libraries with bjam under Windows None 1763 wrong AST when parser_tag==0 None 1799 Boost.Test docs missing reference pages None 1810 HP-UX_ PA-RISC_ GCC 4.1+ sp_counted_base.hpp aaron_windsor 1622 Adjacency list needs to handle self-edges correctly aaron_windsor 778 top-level configure is broken agurtovoy 1001 gcc 4.1.2 segfaults on mpl/test/apply.cpp agurtovoy 1051 MPL header ordering triggers bug agurtovoy 1099 unable to iterate through a "non-explicitly-declared" mpl::set agurtovoy 1215 Boost 1.34.1_ mpl: Wrong workaround detection using MinGW32 (or.hpp_ line #33) agurtovoy 1317 has_xxx randomly broken in msvc agurtovoy 1469 [mpl] nested typedef of set has two different meanings agurtovoy 1476 always<> is not nullary. agurtovoy 1528 g++ 4.3.0 reports error because of redeclaration of next agurtovoy 1549 Boost.MPL: 'index_of' algorithm is not documented agurtovoy 1568 duplicate include guards agurtovoy 588 mpl::remove compile error with gcc 4.1.0 anthonyw 1154 tss destruction segfaults in conjunction with dlopen/dlclose anthonyw 1168 [thread] tss crashes randomly anthonyw 1268 xtime_cmp changes to deal with overflow were reverted anthonyw 1470 Boost.Thread: Compilation errors with non-__cdecl calling convention anthonyw 1657 Bug in boost::threads sample anthonyw 1713 no definitions for copy ctor and assignment operator for basic_condition_variable anthonyw 1805 thread creation crashes with /Zp1 switch in VS2005 compiler anthonyw 1813 Signed/Unsigned warning in win32/condition_variable anthonyw 876 xtime documentation incomplete anthonyw 881 errors when build with Apache stdcxx az_sw_dude 1028 typo in boost header: date_time/time_defs.hpp az_sw_dude 1078 from_iso_string cannot read the output from to_iso_string az_sw_dude 1098 Urgent libboost-date-time1.33.1 : bugs on ia64 ? az_sw_dude 1147 date_time library contains global #define ERROR az_sw_dude 1160 warning: month_format shadows a member of this az_sw_dude 1162 warning: ticks shadows a member of this az_sw_dude 1289 posix_time::time_facet forgets to pass a_ref argument to base class az_sw_dude 1299 change in typedef stringstream_type in format_date_parser.hpp causing compilation error az_sw_dude 1306 invalid docbook in date_period.xml az_sw_dude 1384 Linking problem with date_time library on Visual C++ 2008 Express az_sw_dude 1386 date_time documentation Jamfile breaks building of boost docs az_sw_dude 1524 format_date_parser.hpp(221) : cannot convert parameter 1 az_sw_dude 1574 operator<< for boost::posix_time::ptime ignores ostream flags az_sw_dude 1674 date_time::date_formatting.hpp: incorrectly formats year using global locale az_sw_dude 1695 add correct namespace to class to fix compilation bug az_sw_dude 1726 boost/date_time/posix_time/time_formatters.hpp incorrectly formats fractional seconds using global locale az_sw_dude 1740 date_time includes <windows.h> az_sw_dude 1788 local_time::local_time_period streaming operators not implemented az_sw_dude 287 wrong usage of ios_base::narrow az_sw_dude 316 date_time type conversion warning az_sw_dude 604 from_ftime incorrectly processes FILETIME filled with zeros az_sw_dude 642 operator<< for gregorian::date_duration not found az_sw_dude 889 Insane Dependencies az_sw_dude 890 date_time library supports only the current dst rule bemandawes 1378 filesystem path invalid name for hidden files (LINUX) bemandawes 1389 filesystem::ostream << boost::format generates operator ambigious error (in MSVC++) bemandawes 1458 Darwin Tiger throws std::runtime_error: locale::facet::_S_create_c_locale name not valid bemandawes 1578 bug in readdir_r_simulator() in a multi-threaded environment bemandawes 1583 Serious flaw in boost::filesystem filename handling (opensuse) bemandawes 1589 [filesystem] 'mbstate_t' : is not a member of 'std' bemandawes 1606 filesystem/src/exception.cpp doesn't build with gcc bemandawes 1613 Link Errors against file_system on OS X with Intel Version 10.1 C++ compilers bemandawes 1682 path_traits needs imbue() bemandawes 1701 boost::filesystem::remove_all - segmentation fault with wpath on Linux bemandawes 1711 Boost Serialization export facility broken on gcc 4.1_ 4.2 bemandawes 1767 missing file: boost/filesystem/cerrno.hpp bemandawes 1768 system: error_code.cpp #defines macros without checking whether already defined bemandawes 752 directory_iterator doesn't work with catch chris_kohlhoff 1703 [asio] Compiler warnings on VC8/9 + warning level 4 danieljames 1554 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support new string types. danieljames 1555 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support boost::system::error_code danieljames 1705 [boostbook] Spaces in reference file names for types like 'long long' danieljames 1731 Website 'bugs' danieljames 1742 Some bugs in http://www.boost.org/doc/libs/1_35_0 danieljames 1743 Documentation has incorrect Build & Link settings for some libraries danieljames 1779 Whos using boost link broken danieljames 1783 No link to wiki danieljames 1806 Broken links to numeric cast. danielw 1044 Argument pack inaccessable in a functions return type danielw 1054 Parameter takes an "infinite" amount of time to compile with the Intel compiler. danielw 1097 keyword.hpp generates many warnings C4180: qualifier applied to function type has no meaning; ignored danielw 1784 [parameter] missing include dave 1010 linking boost.python on freebsd dave 1019 iterator_facade::pointer should be the return type of operator-> (DR 445) dave 1085 Python rules for compiling in Mac OS X dave 1179 [boost.python] can not export a union in VC2005sp1 dave 1181 [boost.python] can modify enum value dave 1387 Review / update docs to reflect changes dave 1460 Python classes with multiple bases are convertible only to the first class in the lists dave 1482 boost::python::throw_error_already_set should be marked noreturn dave 1516 [python] Failing VC9 regression tests dave 1599 [python] '_set_se_translator': identifier not found dave 1697 [utility][noncopyable] ADL barrier broken by msvc-9.0 dave 1730 No debug libs on Windows by default dave 865 Use of C++0x keyword as identifier dave 910 gcc strict-aliasing problems with python dgregor 1009 Improper overflow handling in shortest paths algorithms dgregor 1164 Floyd Warshall broken with unsigned edge weights dgregor 1192 [boostbook] problem when two files have the same name dgregor 1199 configure doesn't work with path containing whitespaces (MacOS X) dgregor 1310 [result_of] const-qualified function pointer doesn't work dgregor 1326 Unable to check graph isomorphism using LEDA adapter dgregor 1391 dominator_tree_test on Borland/CodeGear outputs overly long line dgregor 1395 Write Tests for Python Bindings dgregor 1630 gcc-4.3: adjacency_list.hpp includes deprecated header dgregor 1680 long long and wchar_t support in MPI dgregor 556 Bundled graph properties dgregor 732 Johnson All-Pairs needs better "no path" information dgregor 736 Const correctness violation djowel 1170 Emit Warnings instead of # symbols in the syntax highlighter djowel 1171 Quickbook title output djowel 1172 non-utf djowel 1176 Space after inline code djowel 1206 Escaping from within code? djowel 1273 CR+LF newlines in position_iterator djowel 1276 spirit problem with _GLIBCXX_DEBUG djowel 1277 Closing section like [pre with } causes Quickbok to crash djowel 1280 sections in imported source files get put inside <para> elements in docbook output djowel 1281 Quickbook produces invalid BoostBook/DocBook XML djowel 1324 tuple should have a swap() that operates element-by-element djowel 1396 wrong result_of invocation around transform_view djowel 1436 [quickbook] inline code inside headings djowel 1484 Quickbook produces illegal docbook for some docinfo fields. djowel 1500 [Spirit/Phoenix] C4512 Compiler warnings from VC8 djowel 1570 Some boost headers aren't ready for gcc 4.3 djowel 1600 duplicate include guard djowel 1601 distane of boost::tuple djowel 1607 Tuple Library Documentation Changes djowel 1610 [MSVC/STLport] [tree/common.hpp] Standard library requirements violation(incomplete type as vector parameter) djowel 1614 vector workaround needed for MSVC9 djowel 1617 spirit gcc-4.3 fix djowel 1619 [Fusion] C4512 warnings from VC9 (Visual Studio 2008) djowel 1651 incorrect typedefs in examples djowel 1722 [TR1/Fusion] Conflict between TR1 and Fusion headers djowel 1764 wrong AST when parser_tag==0 dlwalker 613 boost/crc.hpp uses non-standard conforming syntax doug_gregor 1021 [Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph doug_gregor 1076 compile error: disconnecting struct with operator()() doesn't work in VS2005 SP1 doug_gregor 375 LEDA graph adaptors do not handle hidden nodes properly doug_gregor 402 random_vertex/random_edge are unnecessarily inefficient doug_gregor 403 Document copy_component doug_gregor 447 reverse_graph and constness of property maps doug_gregor 708 Dijkstra no_init version should not require VertexListGraph doug_gregor 733 Numbered headers don't work with "preferred" syntax doug_gregor 735 Fruchterman-Reingold grid performance can be improved doug_gregor 738 Memory leaks with signal::connect? doug_gregor 829 Implicit graph not implement doug_gregor 852 Problem with Boost and GCC 4.1 ebf 1507 [variant] C4512 warnings from VC8.0 ebf 1548 [variant][docs]typo: formal arg_ operand_ should be v in times_two arglist ebf 1654 recursive variants do not handle nested variants correctly. ebf 993 Variant should use least common multiple of alignments_ rather than maximum eric_niebler 1796 compile error when SDL_syswm.h (from sdl library) is included before foreach.hpp eric_niebler 1814 foreach broken by is_char_array mpl assertion. fcacciola 1666 Visualizer for boost::optional garcia 1581 Boost.MultiArray: Resizing bug if the index is not 0-based garcia 1741 Review schedule out of date grafik 1041 Cygwin requires PATH setting. grafik 1322 trac rejects patch attachment as spam grafik 1417 Regresson tests hang in Darwin (Tiger) grafik 1430 Regression fails under Cygwin grafik 1433 Trac's spam detection rejects too many valid messages grafik 1512 Broken link to vacpp in bjam docs. grafik 1513 Broken link to bcpp in bjam docs. grafik 1576 cannot read non-ASCII output messages grafik 1577 Some commands don't work because hStdInput == 0 grafik 1663 build.bat cannot set/reset ERRORLEVEL grafik 1733 Website layout overlays on IE7 grafik 1735 [website] Wrong HTML on main documentation page. grafik 1738 Boost Jam details and download link grafik 1739 Search box and Google link grafik 1753 Python docs: bad link to the Jamroot grafik 1769 Broken links in documentation index. grafik 1771 Statechart TOC mangled. grafik 1775 website bugs for 1.35.0 docs grafik 1776 Documentation page renders incorrectly in Safari 3.1 on OS X grafik 1815 Optional doc web page not loading grafik 616 Boost Jam_ and non english directorys grafik 959 linking fails when Boost is compiled with STLport 5.1.* on Linux (names mismatch) grafik 986 Problem building Python modules on boost 1.34.0 hkaiser 1079 boost-1.34.0 fails to compile. concept checks not satisfied. hkaiser 1670 wave almost unusably slow on real-world input igaztanaga 1080 boost::interprocess win32 global file mapping issue igaztanaga 1210 interprocess::barrier hangs during second use under linux (boost 1.33.1) igaztanaga 1390 Interpocess: managed shared memory failing completely under OS X igaztanaga 1634 boost::interprocess::vector cannot contain volatile int igaztanaga 1635 Incomplete include guard in boost/intrusive jmaurer 351 Diff in state of mersenne_twister gen between GCC3.41 & CW9 jmaurer 599 uniform_01 copies engine instead of using a reference johnmaddock 1081 Empty string rejected as perl-style regex johnmaddock 1411 Fix BOOST_PARTIAL_SPECIALIZATION_EXPLICT_ARGS johnmaddock 1446 POSIX API doesn't use C locale johnmaddock 1451 error: use of C99 long long integer constant johnmaddock 1765 Need a macro to determine whether basic streams are present jsiek 1531 segfault in dynamic_bitset::reference assign operator jsiek 1540 Poisson distribution very slow for large mean (and may also overflow). jsiek 1755 Boost.tokenizer is broken for wide characters - patch attached jsiek 1798 met an error using boost::tokenizer in multi-times in vs2005_ unicode jsiek 575 Calling subgraph::global_to_local on a root graph jsiek 636 strange compiling problem for transitive_closure jsiek 815 remove_edge core dumps on self-circle jsiek 875 No iterator based constructor for adjacency_matrix jsiek 900 graphml reader namespace handling is broken kaalus 1184 property_tree assignment (operator) bug kaalus 1604 property_tree xml parser doesn't compile with gcc kaalus 1678 Boost.property_tree::read_xml does not parse UNICODE file with BOMs marshall 1252 [pool] severe overhead with unaligned sizes. matias 1406 Understanding the Tables outdated nasonov 1220 lexical_cast requires RTTI nasonov 1704 [any] 4512 warning from VC8/9 on warning level 4 nasonov 754 boost::any - typeid comparison across shared boundaries nesotto 1629 range/iterator_range.hpp bug nesotto 1675 [range] VC8 - compiler warnings when including range/array headers nesotto 1694 NDEBUG vs. BOOST_ASSERT in iterator_range.hpp nesotto 1748 [ptr_container] compiler warnings from VC9 nesotto 1754 Illegal HTML in range docs. nesotto 1785 assign::list_of works poorly with class constructors nesotto 1795 [ptr_container] minor documentation typo no-maintainer 1068 Mersenne twister disables streaming for Visual C++ no-maintainer 1222 lambda::ret<T> should declare result_type. no-maintainer 1270 uniform_smallint doesn't compile with lagged_fibonacci random number generators no-maintainer 1515 [lambda] C4512 warnings from VC8.0 no-maintainer 1544 uniform_01 w/ref template param causes ref to ref error no-maintainer 1546 Method boost::random::uniform_int::operator()(engine_ value) is missing no-maintainer 1572 [lambda] smart pointer const-ness affects its contents no-maintainer 1632 Default Interval rounding policies incomplete no-maintainer 1691 [Random] Brokem MSVC workaround no-maintainer 781 Lambda: (_1 + "y")(string("x")) Doesn't Compile no-maintainer 819 uniform_int<> with type's maximum availaible range error pavol_droba 1152 rle_example fails pavol_droba 1385 begin must be boost-qualified pavol_droba 1761 StringAlgo: Error in an example pdimov 1106 shared_ptr<T> should not convert to shared_ptr<U> when T* doesn't convert to U* pdimov 1719 [addressof] Can't obtain the address of an instance of an anonymous struct pdimov 1762 BOOST_DISABLE_THREADS should imply BOOST_SP_DISABLE_THREADS ramey 1708 Can't serialize class with private destructor ramey 1734 BOOST_STATIC_WARNING can't be passed a dependent expression ramey 1747 [serialization] unreferenced formal parameter warnings from VC9 ramey 1807 boost::archive::xml_archive_exception does not store error code and reports wrong message text ramey 1812 Boost.Serialization fails to build on Cygwin rogeeff 1383 signal.h features not found on Mac OS rogeeff 1542 [test] compiler errors when building with stdcxx library rogeeff 1676 Dead links on Boost.Test example documentation. rogeeff 1723 No subprocess can be started in init_unit_test_suite rogeeff 1746 Online documentation for 1.35.0 is out of date for current lib version rogeeff 1781 Empty page in Test documentation samuel_krempp 1699 Compile warning about initialization order. samuel_krempp 1801 Typo in documentation. samuel_krempp 859 boost::format ignores a user defined locale shammah 290 perfomance: memory cleanup for pool takes too long shammah 386 boost::pool_allocator breaks with vector of vectors speedsnail 1138 Problems with TSS and static thread library t_schwinger 1653 wave executable erroneously required for build of function_types lib troyer 1774 serialization: file written with 1.34.1 can't be read in with 1.35 troyer 1778 Possible regression in 1.35 serialization of 2D arrays turkanis 1523 [iostreams] VC8/VC9 compiler warnings turkanis 1545 [boost/rational.hpp] 'noskipws' is not a member of 'std' turkanis 1579 gzip compressor should model DualUseFilter turkanis 1580 Add static assert to prohibit instantiating a chain with mode dual_use turkanis 1649 Fix definition of JavaScript menu to avoid long chains of functions turkanis 1656 Consider implementing flush() for symmetric filters turkanis 1671 type mismatch of buffer size parameter causes overload resolution to fail turkanis 1727 Sample code in documentation does not compile_ has namespace errors. urzuga 574 [boost::lambda] Compile error with libstdc++ debug mode vladimir_prus 1132 program_options documentation error. vladimir_prus 1165 more quoting problems vladimir_prus 1274 Useless error message vladimir_prus 1321 invalid docbook in tool documentation vladimir_prus 1527 [program_options] Second (and subsequent) lines in tabbed text not aligned correctly vladimir_prus 1530 Program options documentation - Overview - Syntactic Information example typo vladimir_prus 1537 no value given in 'mysql_password =' vladimir_prus 1584 cryptic bbv2 error building quickbook vladimir_prus 1587 [program_options] crashes if value part missing in external configuration file vladimir_prus 1588 [program_options] crashes if value part missing in external configuration file vladimir_prus 1645 Invalid unicode support for default_value vladimir_prus 1679 added 4-way universal binary support from mac osx (ppc_ ppc64_ i386_ x86_64) vladimir_prus 1809 Allow empty values in conf file vladimir_prus 469 multitoken broken vladimir_prus 689 [program_options] Endless loop with long default arguments vladimir_prus 850 program_options strips off escaped quotes in some situations witt 1046 Boost.Python quickstart instructions mention nonexistent target witt 583 Fixes for build on IBM pSeries for AIX and Linux witt 834 Homepage regression links witt 957 The "Getting Started" page does not mention the stdlib option witt 973 zip_iterator has value_type == reference -- -- Marshall Marshall Clow Qualcomm, Inc. <mailto:mclow@qualcomm.com> The famous British scientist, Lord Kelvin, said: "When you measure what you are speaking about and express it in numbers, you know something about it, but when you cannot (or do not) measure it, when you cannot (or do not) express it in numbers, then your knowledge is of a meagre and unsatisfactory kind."

1 0

[thread_new] New thread launching library based on N1883: Any plans?
by vicente.botet 11 Apr '08

11 Apr '08

Hello Ion, When Kevlin Henney presented his vision of how the thread interface could be in "More C++ Threading: From Procedural to Generic, by Example" , April 2004 I has very impressed on how the roles were inversed, not only for threads but also for condition variables. When he presented his proposal to the C++ LWG "N1883: Preliminary Threading Library Proposal for TR2" , August 2005 I has very excited. When you announced your implementation based on N1883 [ANN][thread_new] New thread launching library based on N1883 - Ion Gaztañaga May 03, 2006 I started to though that this could be soon a reality. When the Kevlin proposal was not accepted I was really disappointed. Could you point me some links that help me to understand why his proposal was not found interesting or souhaitable? Any way your implementation on top of the thread interface proved that we can have two level interfaces. Independently of the C++ standard, do you think that it will be possible to have two thread interfaces in Boost, one on top of the other? Do you plan to follow your thread implementation, and request a Boost review? I'm really interested, and I supose that I'm not alone. Best regards _____________________ Vicente Juan Botet Escriba

1 0

Re: [boost] thoughts on logging library: orthogonal runtime configuration
by brass goowy 11 Apr '08

11 Apr '08

Steven Watanabe writes: >AMDG > >brass goowy wrote: >> >> This is a good example of the need for compilers that output the code they >> generate based on templates. If they did that, the library writer could >> have an online service that spits out the final deliverable rather than >> users having to maintain different versions of a library. > >I don't understand the advantage over preprocessor configuration. >I don't really want to have to have a separate boost distribution >every time I want a different configuration. > >> It is a slow >> and error prone process to rebuild a library/application as suggested here. >> Alternatively, service providers would have logging versions of their code available >> for users in the field, in effect eliminating the long and unproductive process of >> a rebuild. > >How is this any better than just providing pre-built binaries. I think the follow through on pre-built binaries that would be needed is more than the release team currently delivers. It would require branching out to the library level (I think the pre-builts are mostly of the whole of Boost) and then multiplying that times primary configuration options such as logging/non-logging. And then multiplying that total by the various platforms. That gets to be too much work with the various platforms around. The situation could be simplified by having a compiler that applies user code against a library and outputs fully instantiated source code. That seems like it would minimize the platform dimension in the equation. The compiler I'm talking about would be strong in terms of it's implementation of the language and some/most of the platform related preprocessing wouldn't be needed. This approach might make it easier to push C++0x functionality to more platforms without the various compiler implementors having to each incorporate support for all of the changes required by the standard. Brian Wood Ebenezer Enterprises www.webEbenezer.net

2 1

[webiste] Bad link to "Who's using Boost"
by JOAQUIN M. LOPEZ MUÑOZ 10 Apr '08

10 Apr '08

In "Boost Background Information" (http://boost.org/users/ ) the link to "Who's using Boost" is http://boost.org/doc/libs/1_35_0/doc/html/who_s_using_boost_.html which points nowehere. I think the correct link is http://boost.org/users/uses.html Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[website] bad link to "Who's using Boost"
by JOAQUIN M. LOPEZ MUÑOZ 10 Apr '08

10 Apr '08

In "Boost Background Information"

1 0

regex problem
by Mihaly Zachar 10 Apr '08

10 Apr '08

Hi all, I'm using libboost-regex1.34.1 from gutsy. here is a sample for my problem: ------- CUT ------- #include <boost/regex.hpp> #include <string> #include <iostream> using namespace std; using namespace boost; int main() { string input = "1111"; string a = "(.*)"; string b = "0$1"; regex reg (a, regex::perl); string out = regex_replace(input, reg, b); cout << out << endl; return 0; } ------- CUT ------- the expected result would be "01111" but it gives "011110"... why does it work like this ? if I use anchors (^ and $) it works well, but the problem is I will not get anchors from the other applications :( the problem is that I get regexes from different perl and php applications... will the upgrade to 1.35 solve my problem ? Thanks, Misi

3 5

drawing planar graphs
by Vicen 10 Apr '08

10 Apr '08

Hi, thanks Aaron. Another point: Is there any example to get a planar drawing without making the graph maximal planar? In the straight_line_drawing documentation this procedure is outlined. I think it would be very useful to have an example in the documentation which work for any planar graph without having to create explicitly the triangulated one. Thanks again and congratulations for the planar utilities, Vicen

2 1

[documentation][optional] why can't I see the docs in my browser
by Thorsten Ottosen 10 Apr '08

10 Apr '08

Hi, There is something completely wrong with these pages --- they are in fact empty. What happened? Nemeric conversion also suffers from the same problem. Thanks -Thorsten

2 1