October 2009 - Boost - lists.preview.boost.org

[thread][thread_specific_ptr]
by Sid Sacek 28 Oct '09

28 Oct '09

In VC++ and GCC a user creates global TLS like this: VC++ __declspec( thread ) int tls_1; GCC __thread int tls_2; But using the boost library boost::thread_specific_ptr< int > tls_3; doesn't provide an initialized global variable as one would expect from thread-local-storage. Using tls_3 crashes the program if it's not pre-initialized to some object. The implication is that every time a new thread is created, it needs to first instantiate all global TLS objects. Am I not understanding the intentions of this class? Is there a proper or intended way of using this class? I couldn't find any example code in the boost archives. Thanks, -Sid

2 2

Can we suppress integer_traits warnings?
by John Maddock 27 Oct '09

27 Oct '09

If you have a program that simply includes boost/integer_traits.hpp and is compiled with g++ -pedantic you get a bunch of warnings: ./boost/integer_traits.hpp:164:57: warning: use of C99 long long integer constant ./boost/integer_traits.hpp:164:73: warning: use of C99 long long integer constant ./boost/integer_traits.hpp:170:62: warning: use of C99 long long integer constant ./boost/integer_traits.hpp:170:62: warning: use of C99 long long integer constant And no matter where I insert __extension__ I can't seem to get gcc to suppress these:-( Any ideas? BTW I'm asking because this came to me as a - somewhat misplaced - bug report: https://svn.boost.org/trac/boost/ticket/1451. Thanks, John.

7 17

[task in sandbox] memory leak?
by Jeffrey Hellrung 27 Oct '09

27 Oct '09

All: A colleague of mine is trying to use the proposed Boost.Task library in the sandbox, but he is observing some memory leaks. See forwarded email below and attached cpp file. Does anyone have any information or suggestions for him? I agreed to query the list for him, but if this becomes too involved, I'll ask him to subscribe and communicate directly. Thanks! - Jeff -------- Original Message -------- Subject: Boost.task memory leak Date: Tue, 27 Oct 2009 15:14:44 -0700 From: Paul Jones <pajones(a)gmail.com> To: Jeffrey Hellrung <jhellrung(a)ucla.edu> References: <7f0a1570910271324o3dcb2d9xb361501267b7a5db(a)mail.gmail.com> This code leaks memory on my system: - gcc version 4.4.1 (Ubuntu 4.4.1-4ubuntu8) - Boost 1.40 - boost.task-0.3.0 When this code is run you can observe the program's allocated memory steadily increasing in the system monitor. The output displays the number of (undestroyed) functor objects when all the pool has completed all of its tasks. This seems to be capped at 64, so this isn't the source of the leak. The maintainer's name is Oliver Kowalke. But I couldn't find his email address. Paul

1 0

asio library
by Peter Foelsche 27 Oct '09

27 Oct '09

Out of curiousity (reading somebody comment here regarding socket calls) I looked into the asio library and found the following example code below. My question is: What is the use of the socket object created in the first line? I think this line must always be followed by some more code. Because of this it does not make sense, that a library exports this functionality. boost::asio::ip::tcp::socket socket(io_service); boost::system::error_code ec; socket.open(boost::asio::ip::tcp::v4(), ec); if (ec) { // An error occurred. }

4 7

Proposal for Library to perform dependency injection
by Adam Young 27 Oct '09

27 Oct '09

Having had a career that has bounced me between a few languages, I have had the opportunity to work with a couple of tools in the Java world that didn't see, to have analogues in C++. One of these is the inversion of control containers, of which Spring is one of the best known. Ken Fowler suggested the term "Dependency Injection" as a way to better describe how inversion of control is performed, and I prefer his term. I've written a fairly simple dependency injection framework in C++ that seems to make proper use of the C++ Language. It is not attempting to do any COM like component model. Rather, it allows the developer the ability to cleanly separate the Object usage from the construction policy. I've posted the code on Sourceforge at https://sourceforge.net/projects/cpp-resolver/. I have not yet taken the time to get it into proper format for a Sandbox project, but will do that next if there seems to be enough interest in the project. I wrote up the philosophy behind the design here: http://adam.younglogic.com/?p=146 The code is currently g++ only, although I've attempted to use only core language constructs. It has no dependencies on other libraries other than stl collections. Any constructive feed back will be most appreciated. Adam

2 2

[conversion] Release v0.4: Replace function template specialization by ADL
by vicente.botet 27 Oct '09

27 Oct '09

Hi, I have just released the version 0.4 of Boost.Conversion , which includes since my last publicly announced version 0.3: Replace function template specialization by ADL A Source class is convertible to a Target class if: * Either: A function with the signature convert_to<Target>(Source const&, boost::dummy::type_tag<To> const&) is available via argument dependent lookup * Or: A template specialization of boost::conversion::convert_to<Target, Source> exists for Target and Source * Or: Target is copy constructible from Source (default implementation) The template function convert_to allows to convert a source type to a target type, using argument dependent lookup to select a specialized convert_to function if available. If no specialized convert_to function is available, boost::conversion::convert_to is used. The generic convert_to function requires that the elements to be converted are assignable and copy constructible. It is implemented using the Target copy construction from a Source or the Source conversion operator Target - this is sometimes unavailable. For standard types, we can not add a specialized convert_to function on the namespace std. The alternative to using argument dependent lookup in this situation is to provide a template specialization of boost::conversion::convert_to for every pair of standard types that requires a specialized convert_to. You can found all the detail for dowloading, documentation, ... in http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Conve… I'd appreciate it if people could take a look, test it on their compiler and give me some feedback. Thanks to Edward Diener for showing me that multiple assignments should be taken in account. Thanks also to Jeffrey Hellrung and Robert Stewart for showing me that Boost.Conversion should use also ADL. BTW, I'm looking for a review manager. Anyone around here who would like to volunteer? Best regards, _____________________ Vicente Juan Botet Escribá

1 0

[system][filesystem v3] A possible error_code argument compromise
by Scott McMurray 27 Oct '09

27 Oct '09

2009/10/20 Beman Dawes <bdawes(a)acm.org>: > > One particular concern is that as currently worded, the N2838 proposal > requires throws() return a null reference, which they see as relying > on undefined behavior. > So it sounds like the idea solution is something that looks like a reference to the caller, for shortness of typing, but looks like a pointer to the implementation, to ease checking and avoid the weirdness of null references. struct optional_error_code_ref { optional_error_code_ref() : p_() {} optional_error_code_ref(optional_error_code_ref const &ecr) : p_(ecr.p_) {} optional_error_code_ref(error_code &r) : p_(&r) {} error_code &operator*() const { return *p_; } error_code *operator->() const { return p_; } operator safe_bool() const { return safe_bool(p_); } private: error_code *p_; }; Then the call is done the same was as before: error_code ec; foo(ec); But it's obvious to check, and never deals in null references: void foo(optional_error_code_ref ec = optional_error_code_ref()) { ... if (ec) { ec->value = bar; } else { throw bar_exception(); } ... } It would of course be better spelt qux<error_code&>, but I'm not sure exactly what name that should be. ~ Scott (Hopefully the subject change will get us out of the exceptions vs error codes quagmire.)

2 2

[python] AttributeError
by Okko Willeboordse 27 Oct '09

27 Oct '09

Running Boost 1.40 ( Windows server 2003/XP, Visual Studio 2008) Given; #include<boost/python.hpp> struct Foo{ static int bar; }; int Foo::bar=3; BOOST_PYTHON_MODULE(foo){ boost::python::class_<Foo>("Foo",boost::python::init<>()) .def_readonly("bar",Foo::bar); } With Python 2.6.3 and 2.6.4 I get; >c:\Python26\python.exe -c "import foo" Traceback (most recent call last): File "<string>", line 1, in <module> AttributeError: 'Boost.Python.StaticProperty' object attribute '__doc__' is read-only Also; >python Python 2.6.4 (r264:75708, Oct 26 2009, 08:23:19) [MSC v.1500 32 bit (Intel)] on win32 Type "help", "copyright", "credits" or "license" for more information. >>> import foo Traceback (most recent call last): File "<stdin>", line 1, in <module> AttributeError: 'Boost.Python.StaticProperty' object attribute '__doc__' is read-only >>> import foo >>> dir(foo.Foo) ['__class__', '__delattr__', '__dict__', '__doc__', '__format__', '__getattribute__', '__hash__', '__init __', '__instance_size__', '__module__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__setattr_ _', '__sizeof__', '__str__', '__subclasshook__', '__weakref__'] So importing foo for the second time succeeds but foo.Foo holds no bar With Python < 2.6.3 everything works as expected. See also http://mail.python.org/pipermail/cplusplus-sig/2009-August/014747.html

1 0

[Graph] problem with strong_components.hpp and variant
by Nil Geisweiller 27 Oct '09

27 Oct '09

Hi, it seems there is a conflict between strong_components.hpp and variant, maybe the method boost::get is wrongly overloaded. The problem occurs with 1.40 but not with 1.37, and it is still occurs with the last svn. I attach a minimal code to reproduce the bug + compile error ###### test.cpp ###### //uncomment the line below to get the bug #include <boost/graph/strong_components.hpp> #include <boost/variant.hpp> typedef boost::variant < int, float > intorfloat; int main() { int i(2); intorfloat iof(i); return boost::get<int>(iof); //problem is here } ########### compile error ########### a-lin@a-lin-desktop:~/OpenCog/test/bin$ make [100%] Building CXX object CMakeFiles/test.dir/test.cpp.o In file included from /usr/include/boost/graph/graph_concepts.hpp:17, from /usr/include/boost/graph/depth_first_search.hpp:18, from /usr/include/boost/graph/strong_components.hpp:17, from /home/a-lin/OpenCog/test/test.cpp:2: /usr/include/boost/property_map/property_map.hpp: In instantiation of ‘boost::property_traits<int>’: /usr/include/boost/graph/two_bit_color_map.hpp:46: instantiated from ‘boost::two_bit_color_map<int>’ /home/a-lin/OpenCog/test/test.cpp:10: instantiated from here /usr/include/boost/property_map/property_map.hpp:31: error: ‘int’ is not a class, struct, or union type /usr/include/boost/property_map/property_map.hpp:32: error: ‘int’ is not a class, struct, or union type /usr/include/boost/property_map/property_map.hpp:33: error: ‘int’ is not a class, struct, or union type /usr/include/boost/property_map/property_map.hpp:34: error: ‘int’ is not a class, struct, or union type make[2]: *** [CMakeFiles/test.dir/test.cpp.o] Error 1 make[1]: *** [CMakeFiles/test.dir/all] Error 2 make: *** [all] Error 2 Is it a bug? Thanks a lot! Nil

1 1

[interprocess] mapped_file with wide filename on Windows
by Cory Nelson 27 Oct '09

27 Oct '09

Could the mapped_file constructor allow a wchar_t filename on Windows? Or some cross-platform way to get Unicode support? -- Cory Nelson http://int64.org

2 2

[string]
by remi.chateauneu＠gmx.de 26 Oct '09

26 Oct '09

Hi, Is there any interest for a class for computing Levenshtein and Damerau distances ? It is inspired from http://en.wikipedia.org/wiki/Levenshtein_distance with some enhancements: - The buffer can be reused thanks to a class, avoiding reallocations. - Only one buffer of twice the size of the longest string is necessary (Instead of the product of the size of the two input sequences). (Three times the size for Damerau distance). - It works with any input iterator category for one string, any iterator except input_iterator for the second string. - The distance type is templatized (Allowing to use short ints to save buffer space). - Any type of element can be used (Not only chars). - More efficient than the other implementations I could find on the web, completely inlined (Specific care to maximize memory locality). - The cost function can be specified with a functor (Insertion, deletion, replacement, transposition). - Tested with GCC 3.2.3 and 4.2.3, Visual C++ 2005. There was a proposal for such a function two years ago (edit_distance), but maybe this one, being faster, might be of interest for the string algorithms library ? The code is not very big so please let me attach it here. Thanks /* boost levenshtein.hpp header file * * Copyright Remi Chateauneu 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * $Id: $ * * Idea by x */ #ifndef BOOST_LEVENSHTEIN_HPP #define BOOST_LEVENSHTEIN_HPP #include <string.h> #include <vector> namespace boost { /// Given a distance formula, levenshtein or damerau, does some processing of the input parameters. template< class Distance, class Formula > class distance_base { /// This uses Curiously recurring template pattern template < class Iter1, class Iter2 > inline Distance distance_noswap( Iter1 begS1, Iter1 endS1, Iter2 ptrS2, size_t len2 ) { return static_cast< Formula * >(this)->distance_noswap( begS1, endS1, ptrS2, len2 ); }; public: /// If both lengths are available, we can swap to increase speed. template < class Iter1, class Iter2 > Distance distance_swap( Iter1 begS1, Iter1 endS1, size_t len1, Iter2 begS2, Iter2 endS2, size_t len2 ) { /// The longer string should go to the inner loop return ( len1 < len2 ) ? distance_noswap( begS1, endS1, begS2, len2 ) : distance_noswap( begS2, endS2, begS1, len1 ); }; /// For plain containers. We assume that 'size()' has a constant cost. template < class Container1, class Container2 > Distance operator()( const Container1 & s1, const Container2 & s2 ) { return distance_swap( s1.begin(), s1.end(), s1.size(), s2.begin(), s2.end(), s2.size() ); }; /// For plain C-style strings. No need to create a temporary string. Distance operator()( const char * ptrS1, const char * ptrS2 ) { size_t len1 = strlen(ptrS1); size_t len2 = strlen(ptrS2); return distance_swap( ptrS1, ptrS1 + len1, len1, ptrS2, ptrS2 + len2, len2 ); }; /// If no iterator is an input_iterator, we may be able to swap them for performance. template< class Iter1, class Iter2 > Distance distance_iterator( Iter1 beg1, Iter1 end1, std::forward_iterator_tag, Iter2 beg2, Iter2 end2, std::forward_iterator_tag ) { return distance_swap( beg1, end1, std::distance( beg1, end1 ), beg2, end2, std::distance( beg2, end2 ) ); }; /// If the first iterator only is an input_iterator, then process it. template< class Iter1, class Iter2 > Distance distance_iterator( Iter1 beg1, Iter1 end1, std::input_iterator_tag, Iter2 beg2, Iter2 end2, std::forward_iterator_tag ) { return distance_noswap( beg1, end1, beg2, std::distance( beg2, end2 ) ); }; /// If the first iterator only is an input_iterator, then swap them first. template< class Iter1, class Iter2 > Distance distance_iterator( Iter1 beg1, Iter1 end1, std::forward_iterator_tag, Iter2 beg2, Iter2 end2, std::input_iterator_tag ) { return distance_noswap( beg2, end2, beg1, std::distance( beg1, end1 ) ); }; /// According to the type of iterator, not all operations are possible. template< class Iter1, class Iter2 > Distance operator()( Iter1 beg1, Iter1 end1, Iter2 beg2, Iter2 end2 ) { return distance_iterator( beg1, end1, typename std::iterator_traits< Iter1 >::iterator_category(), beg2, end2, typename std::iterator_traits< Iter2 >::iterator_category() ); }; }; // distance_base /// A user functor must have this interface. /// NOTE: The distance must always be positive. template< class Distance, class Char > struct dummy_functor { /// Char subsitution. Distance operator()( Char, Char ) const ; /// Char insertion or deletion. The cost /// is the same for both cases otherwise the distance /// would not be commutative. Distance operator()( Char ) const ; /// Char transposition (Option, for Damerau only). /// This does not depends on the character. Distance operator()(void) const ; }; /// Default functor for the most common case. It is never instantiated. /// Equivalent to a cost of '1' for character insertion, deletion or substitution. struct distance_null_functor {}; /// Specialization for the default case, for performance. /// This wraps a user functor, and compute the core test of Levenshtein distance. template < class Distance, class Functor > class cell_min { /// A user can specify the cost of char insertion, deletion and substitution. /// It must match the interface of dummy_functor. Functor _ftor ; public: cell_min() {}; cell_min( const Functor & refFtor ) : _ftor( refFtor ) {}; /// The cost of character insertion and deletion are the same otherwise /// it would not be commutative, and would not be a distance. template< class Char > Distance min_levenshtein( const Distance & distIJ, const Distance & distI1J, const Distance & distIJ1, const Char & chrLeft, const Char & chrRight ) { return std::min( distIJ + _ftor( chrLeft, chrRight ), std::min( distI1J + _ftor( chrLeft ), distIJ1 + _ftor( chrRight ) ) ); }; /// The operator without argument computes the cost of a transposition /// and does not depend on the transposed characters. /// Damerau is tested on top of Levenshtein comparison. Distance min_damerau( const Distance & prevDiag, const Distance & currDiag ) { return std::min( Distance( prevDiag + _ftor() ), currDiag ); }; }; // cell_min /// Does the core comparison of Levenshtein distance when no /// user functor is provided. This is the most common case /// and must be the fastest. template < class Distance > class cell_min< Distance, distance_null_functor > { public: cell_min() {}; cell_min( const distance_null_functor & ) {}; /// Here we save two additions, than if the general class were used. template< class Char > Distance min_levenshtein( const Distance & distIJ, const Distance & distI1J, const Distance & distIJ1, const Char & , const Char & ) const { return 1 + std::min( distIJ, std::min( distI1J, distIJ1 ) ); }; /// The usual cost of a transposition can be set to 1. /// Damerau is tested on top of Levenshtein comparison. Distance min_damerau( const Distance & prevDiag, const Distance & currDiag ) const { return std::min( prevDiag, currDiag + 1 ); }; }; // cell_min (Specialization) /// Most of times, Distance is 'unsigned int'. template< class Distance > class distance_buffer { /// TODO: Use temporary buffer. std::vector< Distance > _buffer ; size_t _sz ; public: distance_buffer() : _sz(0) {}; void resize( size_t sz ) { if( sz <= _sz ) return ; _buffer.resize( sz ); _sz = _buffer.size(); }; Distance * start(void) { return &_buffer[0]; } }; // distance_buffer /// This wraps a buffer which can be reused, because buffer allocations are costly. /// The distance may be char, short, int: This can reduce the buffer size. /// TODO: Do not resize the buffer but use the stack if less than X elements. /// TODO: Use a specific buffer allocation. template < class Distance = unsigned int, class Functor = distance_null_functor > class levenshtein : public distance_base< Distance, levenshtein< Distance, Functor > > { /// This wraps a user-provided optional functor. cell_min< Distance, Functor > _minFtor ; /// Max size: Twice the longest string + 2. distance_buffer< Distance > _buffer ; public: levenshtein() {}; levenshtein( const Functor & refFtor ) : _minFtor( refFtor ) {}; /// The size of the first range is not needed, any iterator type will do. template < class Iter1, class Iter2 > Distance distance_noswap( Iter1 begS1, Iter1 endS1, Iter2 ptrS2, size_t len2 ) { typedef typename std::iterator_traits< Iter1 >::value_type Char ; /// The buffer contains two lines of distance. _buffer.resize( 2 * ( len2 + 1 ) ); Distance * localPtr = _buffer.start() ; for(unsigned j = 0; j <= len2; ++j) { localPtr[ 2 * j ] = (Distance)j; } const Distance * endPtr = localPtr + 2 * len2 ; /// One cell out of two is associated to one line, the other to the next line. /// The two lines are swapped at each loop. for( unsigned i = 1; ; ) { localPtr = _buffer.start() ; localPtr[1] = Distance(i++) /* i,j+1 */ ; Char chr1 = *begS1++ ; // Restart from the beginning of the second string. for( Iter2 currS2 = ptrS2 ; localPtr != endPtr ; localPtr += 2 ) { const Char chr2 = *currS2++ ; Distance costDiag = localPtr[ 0 ]; /// Optimisation: The distance cannot increase if the chars are identical. if( chr1 != chr2 ) { /// Good data locality in four contiguous cells of the buffer. costDiag = _minFtor.min_levenshtein( costDiag, /* i,j */ localPtr[ 2 ] /* i+1,j */, localPtr[ 1 ] /* i,j+1 */, chr1, chr2 ); } localPtr[ 3 ] = costDiag ; } /// The loop is unrolled two steps by two. if( begS1 == endS1 ) { /// After an even number of half-loops (and lines). return localPtr[ 1 ] /* i+1,j+1 */ ; } /// This starts an odd line. localPtr = _buffer.start() ; localPtr[0] = Distance(i++) /* i,j+1 */ ; chr1 = *begS1++; // Restart from the beginning of the second string. for( Iter2 currS2 = ptrS2 ; localPtr != endPtr ; localPtr += 2 ) { const Char chr2 = *currS2++ ; Distance costDiag = localPtr[ 1 ]; /// Optimisation: The distance cannot increase if the chars are identical. if( chr1 != chr2 ) { /// Good data locality in four contiguous cells of the buffer. costDiag = _minFtor.min_levenshtein( costDiag, /* i,j */ localPtr[ 3 ] /* i+1,j */, localPtr[ 0 ] /* i,j+1 */, chr1, chr2 ); } localPtr[ 2 ] = costDiag ; }; if( begS1 == endS1 ) { /// After an odd number of lines. return localPtr[ 0 ] /* i+1,j+1 */ ; } } /// Should never happen. return Distance(0); }; // distance_noswap }; // levenshtein /// This wraps a buffer which can be reused, because buffer allocations are costly. /// The distance may be char, short, int: This can reduce the buffer size. template < class Distance = unsigned int, class Functor = distance_null_functor > class damerau : public distance_base< Distance, damerau< Distance, Functor > > { /// This wraps a user-provided optional functor. cell_min< Distance, Functor > _minFtor ; /// Max size: Twice the longest string + 2. distance_buffer< Distance > _buffer ; public: damerau() {}; damerau( const Functor & refFtor ) : _minFtor( refFtor ) {}; /// The size of the first range is not needed, any iterator will do. template < class Iter1, class Iter2 > Distance distance_noswap( Iter1 begS1, Iter1 endS1, Iter2 ptrS2, size_t len2 ) { typedef typename std::iterator_traits< Iter1 >::value_type Char ; /// The buffer contains two lines of distance. _buffer.resize( 3 * ( len2 + 3 ) ); Distance * localPtr = _buffer.start() ; for(unsigned j = 0; j <= len2; ++j) { localPtr[ 3 * j] = (Distance)j; } /// One cell out of two is associated to one line, the other to the next line. int offPrev = 2, offCurr = 0, offNext = 1 ; Char chr1, chr1_prev ; /// The three lines are shifted at each loop. for( unsigned i = 1; begS1 != endS1 ; chr1_prev = chr1, ++begS1, ++i, offCurr = offNext, offNext = offPrev, offPrev = offPrev == 2 ? 0 : offPrev + 1 ) { Distance * localPtr = _buffer.start() ; localPtr[offNext] = Distance(i) /* i+1,j */ ; chr1 = *begS1 ; Char chr2, chr2_prev ; Iter2 currS2 = ptrS2 ; for(unsigned j = 0; j < len2; chr2_prev = chr2, ++currS2, ++j, localPtr += 3 ) { chr2 = *currS2 ; Distance costDiag = localPtr[ offCurr ] /* i,j */ ; /// Optimisation: The distance cannot increase if the chars are identical. /// NOTE: Without this test, a valid transposition could not be checked. if( chr1 != chr2 ) { /// Good data locality in four contiguous cells of the buffer. costDiag = _minFtor.min_levenshtein( costDiag, localPtr[ 3 + offCurr ], localPtr[ offNext ], chr1, chr2 ); /// If beyond the first column and line, check for a transposition. /// This makes sense only if the current chars are different. if( ( i > 1 ) && ( j > 0 ) && ( chr1 == chr2_prev ) && ( chr1_prev == chr2 ) ) { costDiag= _minFtor.min_damerau( costDiag, localPtr[ offPrev - 3 ] /* i-1,j-1 */ ); } } localPtr[ 3 + offNext ] = costDiag /* i+1,j+1 */ ; } } return _buffer.start()[ 3 * len2 + offCurr ]; }; // distance_noswap }; // damerau } // namespace boost #endif /* BOOST_LEVENSHTEIN_HPP */ #include <iostream> #include <string> #include <list> #include <vector> #include <iterator> #include "levenshtein.hpp" using namespace std ; /// This can be later used for creating combinations of tests. static void tst_perf(size_t nbLoops) { static const char * tst[] = { "a", "c", "bc", "abc", "bcdef", "abcdegh", "acdeghi", "acedghi", "abcdfgi", "abcfgi", "abcfig" }; const size_t nbTst = sizeof(tst)/sizeof(tst[0]); boost::levenshtein<int> tmpLev ; boost::damerau<int> tmpDam ; while( nbLoops-- ) { for( size_t i = 0 ; i < nbTst ; ++i ) { for( size_t j = i + 1 ; j < nbTst ; ++j ) { int distLev = tmpLev( tst[i], tst[j] ); int distDam = tmpDam( tst[i], tst[j] ); }; }; } } // http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_d… template <class T> size_t edit_distance(const T& s1, const T& s2) { const size_t len1 = s1.size(), len2 = s2.size(); vector<vector<unsigned int> > d(len1 + 1, vector<unsigned int>(len2 + 1)); d[0][0] = 0; for(unsigned int i = 1; i <= len1; ++i) d[i][0] = i; for(unsigned int i = 1; i <= len2; ++i) d[0][i] = i; for(unsigned int i = 1; i <= len1; ++i) for(unsigned int j = 1; j <= len2; ++j) d[i][j] = std::min( std::min(d[i - 1][j] + 1, d[i][j - 1] + 1), d[i - 1][j - 1] + (s1[i - 1] == s2[j - 1] ? 0 : 1) ); return d[len1][len2]; } /// Classical implementation. For comparing results. size_t levenshtein_dist(const std::string & source, const std::string & target) { const size_t n = source.length(); const size_t m = target.length(); if (n == 0) return m; if (m == 0) return n; vector<vector<size_t> > matrix(n + 1, vector<size_t>(m + 1,0)); for (size_t i = 0; i <= n; i++) { matrix[i][0]=i; } for (size_t j = 0; j <= m; j++) { matrix[0][j]=j; } for (size_t i = 1; i <= n; i++) { char s_i = source[i-1]; for (size_t j = 1; j <= m; j++) { char t_j = target[j-1]; int cost; if (s_i == t_j) { cost = 0; } else { cost = 1; } size_t above = matrix[i-1][j]; size_t left = matrix[i][j-1]; size_t diag = matrix[i-1][j-1]; size_t cell = std::min( above + 1, std::min(left + 1, diag + cost)); matrix[i][j]=cell; } } return matrix[n][m]; } /// Classical implementation. For comparing results. size_t damerau_dist(const std::string & source, const std::string & target) { const size_t n = source.length(); const size_t m = target.length(); if (n == 0) return m; if (m == 0) return n; vector<vector<size_t> > matrix(n + 1, vector<size_t>(m + 1,0)); for (size_t i = 0; i <= n; i++) { matrix[i][0]=i; } for (size_t j = 0; j <= m; j++) { matrix[0][j]=j; } for (size_t i = 1; i <= n; i++) { char s_i = source[i-1]; for (size_t j = 1; j <= m; j++) { char t_j = target[j-1]; int cost; if (s_i == t_j) { cost = 0; } else { cost = 1; } size_t above = matrix[i-1][j]; size_t left = matrix[i][j-1]; size_t diag = matrix[i-1][j-1]; size_t cell = std::min( above + 1, std::min(left + 1, diag + cost)); // Step 6A: Cover transposition, in addition to deletion, // insertion and substitution. This step is taken from: // Berghel, Hal ; Roach, David : "An Extension of Ukkonen's // Enhanced Dynamic Programming ASM Algorithm" // (http://www.acm.org/~hlb/publications/asm/asm.html) if( (i > 1) && (j > 1) && (source[i-2] == t_j) && (s_i == target[j-2]) ) { cell = std::min( cell, matrix[i-2][j-2] + 1 ); } matrix[i][j]=cell; } } return matrix[n][m]; } struct TstData { const char * _left ; const char * _right ; unsigned int _lev ; unsigned int _dam ; }; /// We can check whether the result is OK. static const TstData tst_array[] = { { "a","c", 1, 1 }, { "a","bc", 2, 2 }, { "ab","ba", 2, 1 }, { "a","abc", 2, 2 }, { "a","bcdef", 5, 5 }, { "a","abcdegh", 6, 6 }, { "a","acdeghi", 6, 6 }, { "a","acedghi", 6, 6 }, { "a","abcdfgi", 6, 6 }, { "a","abcfgi", 5, 5 }, { "a","abcfig", 5, 5 }, { "c","bc", 1, 1 }, { "c","abc", 2, 2 }, { "c","bcdef", 4, 4 }, { "c","abcdegh", 6, 6 }, { "c","acdeghi", 6, 6 }, { "c","acedghi", 6, 6 }, { "c","abcdfgi", 6, 6 }, { "c","abcfgi", 5, 5 }, { "c","abcfig", 5, 5 }, { "bc","abc", 1, 1 }, { "abcd","badc", 3, 2 }, { "bc","bcdef", 3, 3 }, { "bc","abcdegh", 5, 5 }, { "bc","acdeghi", 6, 6 }, { "bc","acedghi", 6, 6 }, { "bc","abcdfgi", 5, 5 }, { "bc","abcfgi", 4, 4 }, { "bc","abcfig", 4, 4 }, { "abc","bcdef", 4, 4 }, { "abc","abcdegh", 4, 4 }, { "abc","acdeghi", 6, 6 }, { "abc","acedghi", 6, 6 }, { "abc","abcdfgi", 4, 4 }, { "abc","abcfgi", 3, 3 }, { "abc","abcfig", 3, 3 }, { "bcdef","abcdegh", 3, 3 }, { "bcdef","acdeghi", 4, 4 }, { "bcdef","acedghi", 5, 5 }, { "bcdef","abcdfgi", 4, 4 }, { "bcdef","abcfgi", 4, 4 }, { "bcdef","abcfig", 4, 4 }, { "abcdegh","acdeghi", 2, 2 }, { "abcdegh","acedghi", 4, 3 }, { "abcdegh","abcdfgi", 2, 2 }, { "abcdegh","abcfgi", 3, 3 }, { "abcdegh","abcfig", 3, 3 }, { "acdeghi","acedghi", 2, 1 }, { "cadeghi","acedghi", 3, 2 }, { "acdeghi","abcdfgi", 3, 3 }, { "acdeghi","abcfgi", 4, 4 }, { "acdeghi","abcfig", 5, 5 }, { "acedghi","abcdfgi", 4, 4 }, { "acedghi","abcfgi", 4, 4 }, { "acedghi","abcfig", 5, 5 }, { "abcdfgi","abcfgi", 1, 1 }, { "abcdfgi","abcfig", 3, 2 }, { "abcfgi","abcfig", 2, 1 } }; static const size_t nbArr = sizeof(tst_array)/sizeof(tst_array[0]); static boost::levenshtein<int> staticLev ; static boost::damerau<int> staticDam ; /// This is for checking the assembly code generated. static int assembly_levenshtein( const char * a, const char * b ) { return staticLev( a, b ); } static void tst_values(void) { for( size_t i = 0; i < nbArr ; ++i ) { const TstData * p = tst_array + i ; size_t valL = staticLev( p->_left, p->_right ); size_t valD = staticDam( p->_left, p->_right ); size_t edtL = edit_distance( std::string(p->_left), std::string(p->_right) ); size_t oldL = levenshtein_dist( p->_left, p->_right ); size_t oldD = damerau_dist( p->_left, p->_right ); if( ( valL != p->_lev ) || ( oldL != p->_lev ) || ( edtL != p->_lev ) ) { std::cout << "Error L:" << "\tvalL=" << valL << "\tp->lev=" << p->_lev << "\toldL=" << oldL << "\tedtL=" << edtL << "\tp->left=" << p->_left << "\tp->right=" << p->_right << "\n" ; }; if( ( valD != p->_dam ) || ( oldD != p->_dam ) ) { std::cout << "Error D:" << "\tvalD=" << valD << "\tp->dam=" << p->_dam << "\toldD=" << oldD << "\tp->left=" << p->_left << "\tp->right=" << p->_right << "\n" ; }; }; } int main( int argC, const char ** argV ) { tst_values(); if( argC > 1 ) { int nbTst ; sscanf( argV[1], "%d", &nbTst ); tst_perf(nbTst); }; /// So it it not optimized away. std::cout << assembly_levenshtein << "\n" ; }; /// This is for checking the assembly code generated. int assembly_damerau( const char * a, const char * b ) { return staticLev( a, b ); } /// This tests some specific compile-time conditions. template< class Formula > static int compile_formula(Formula refFrm) { std::list< char > chrLst ; vector< char > chrVec ; std::istream_iterator<char> chrStrm ; refFrm( chrLst, chrVec ); refFrm( chrStrm, chrStrm, chrVec.begin(), chrVec.end() ); refFrm( chrLst.begin(), chrLst.end(), chrStrm, chrStrm ); }; struct my_functor { short operator()( char a, char b ) const { return 2 ; }; short operator()( char a ) const { return 1 ; }; short operator()(void) const { return 1 ; }; }; /// This tests some specific compile-time conditions. static int compile_test(void) { boost::levenshtein<int> tmpLev ; compile_formula( tmpLev ); boost::damerau<long long> tmpDam ; compile_formula( tmpDam ); boost::levenshtein<short,my_functor> tmpLevF ; compile_formula( tmpLevF ); my_functor tmpFunc ; boost::damerau<short, my_functor> tmpDamF( tmpFunc ) ; compile_formula( tmpDamF ); };

2 1

boost 1.39 to 1.40 difference: missing toolset and threading tag from library filename?
by Todd Lovette 26 Oct '09

26 Oct '09

Is there a difference in the naming conventions of the libboost_*.so files from boost 1.39 to boost 1.40.0? When I build the boost 1.39 libs they have filenames like... "libboost_thread-gcc44-mt-1_39.so" ..but when I build boost 1.40.0 all the libs filenames are like so... "libboost_thread.so" Did the library naming change in 1.40 or are their new compile options to enable the library naming feature? Build options: (both used on 1.39 & 1.40.0) ------------------------- ./bootstrap.sh --prefix=/usr --libdir=/usr/lib64 ./bjam threading=multi System ------------- Slamd64 12.1(x86_64) using gcc 4.4.2 Any help would be appticiated! Todd :-)

2 2

[test] Errors #including test/floating_point_comparison.hpp
by Emil Dotchevski 26 Oct '09

26 Oct '09

The log below shows a warning and 3 errors in test/predicate_result.hpp from Comeau C++ 4.3.10. Is this easy to fix? (Incidentally, I am not using boost/test, I only need floating_point_comparison.hpp -- shouldn't floating point comparison be independent from boost/test?) Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode como-win.compile.c++ ..\..\..\..\..\..\bin\dev\boost-la\libs\la\test\col_matrix_test.test\como-win-4.3.10\debug\link-static\col_matrix_test.obj "C:\code\dev\boost-trunk\boost/test/utils/basic_cstring/basic_cstring.hpp", line 60: warning #68-D: integer conversion resulted in a change of sign enum npos_type { npos = static_cast<size_type>(-1) }; ^ "C:\code\dev\boost-trunk\boost/test/predicate_result.hpp", line 62: warning #54-D: too few arguments in macro invocation BOOST_READONLY_PROPERTY( bool, (predicate_result) ) p_predicate_value; ^ "C:\code\dev\boost-trunk\boost/test/predicate_result.hpp", line 62: error #40: expected an identifier BOOST_READONLY_PROPERTY( bool, (predicate_result) ) p_predicate_value; ^ "C:\code\dev\boost-trunk\boost/test/predicate_result.hpp", line 62: error #277: invalid friend declaration BOOST_READONLY_PROPERTY( bool, (predicate_result) ) p_predicate_value; ^ "C:\code\dev\boost-trunk\boost/test/predicate_result.hpp", line 62: error #65: expected a ";" BOOST_READONLY_PROPERTY( bool, (predicate_result) ) p_predicate_value; ^

1 0

boost policy against inline friend functions?
by Stefan Strasser 26 Oct '09

26 Oct '09

I've noticed boost::shared_ptr and other classes avoid using inline friend functions, e.g. operator < in class shared_ptr scope: public: template<class Y> bool _internal_less(shared_ptr<Y> const & rhs) const { return pn < rhs.pn; } in namespace scope: template<class T, class U> inline bool operator<(shared_ptr<T> const & a, shared_ptr<U> const & b) { return a._internal_less(b); } what's wrong with template<class Y> friend bool operator<(shared_ptr<Y> const & rhs) const { return pn < rhs.pn; } in class shared_ptr? compiler compatibility? other reasons? should boost libraries avoid inline friend functions in general?

5 6

[conversion] Motivation for two NEW generic conver_to and assign_to functions
by vicente.botet 26 Oct '09

26 Oct '09

Hi, I would like to share with you what motivated me to add two new free template functions convert_to<> and assign_to<> on the Boost.Conversion. I've needed recently to convert from boost::chrono::time_point<Clock, Duration> to boost::posix_time::ptime and from boost::chrono::duration<Rep, Period> to boost::posix_time::time_duration. This kind of conversions are needed quite often when you use code from two different libraries that have implemented the same concept using of course different representations and have hard coded the library interface to its own implementation. Well this is a normal situation, we can't avoid. Life is life. Quite often we need to convert unrelated types `Source` and `Target`. As these classes are unrelated, neither of them offers conversion operators to the other. Usually we get it by defining a specific function such as Target ConvertToTarget(Source& v); In my case I started by defining template <typename Rep, typename Period> boost::posix_time::time_duration convert_to_posix_time_time_duration( const boost::chrono::duration<Rep, Period>& from); template <typename Clock, typename Duration> posix_time::ptime convert_to_posix_time_ptime(const chrono::time_point<Clock, Duration>& from); Imagine now that you need to convert a `std::pair<Source, Source>` to a `std::pair<Target, Target>`. The standard defines conversions of pairs if the related types are C++ convertible: template <typename T1, typename T2> struct pair { ... template<class U, class V> //requires Constructible<T1, const U&> && Constructible<T2, const V&> std::pair(const pair<U, V>& p); template<class U , class V> //requires HasAssign<T1, const U&> && HasAssign<T2, const V&> std::pair& operator=(const std::pair<U , V>& p); ... }; But here the types Target and Source are not convertible other than using a specific function. Well we can again define a specific function std::pair<Target,Target> ConvertToPairOfTarget(std::pair<Source,Source>& v) { return std::make_pair(ConvertToTarget(v.fisrt), ConvertToTarget(v.second)); } While the `ConvertToTarget` could be specific, the `ConvertToPairOfTarget` should be generic template <typename Target1, typename Target2, typename Source1, typename Source2) std::pair<Target1,Target2> ConvertToPair(std::pair<Source1,Source2>& v); In order to do that we need that the pair template parameters define a common function, let it call `convert_to`: template <typename Target, typename Source) Target convert_to(Source& v); Thus `ConvertToPair` can be defined as template <typename Target1, typename Target2, typename Source1, typename Source2) std::pair<Target1,Target2> ConvertToPair(std::pair<Source1,Source2>& v) { return std::make_pair(convert_to<Target1>(v.fisrt), convert_to<Target2>(v.second)); } We need to specialize the `convert_to` function for the specific classes `Source` and `Target`. We can do it as follows template <> Target convert_to<Target, Source>(Source& v) {return ConvertToTarget(v);} In my case I need template <typename Rep, typename Period> boost::posix_time::time_duration convert_to<posix_time_time_duration, boost::chrono::duration<Rep, Period> > (const boost::chrono::duration<Rep, Period>& from) { return convert_to_posix_time_time_duration(from); } template <typename Clock, typename Duration> boost::posix_time::ptime convert_to<posix_time_ptime, chrono::time_point<Clock, Duration> > (const boost::chrono::time_point<Clock, Duration>& from) { return convert_to_posix_time_ptime(from); } So now I can convert std::pair<chrono::time_point<Clock, Duration>, boost::chrono::duration<Rep, Period> > to std::pair<boost::posix_time::ptime, boost::posix_time::time_duration> using the `ConvertToPair` function. What about converting `std::pair<Source,std::pair<Source,Source> >` to `std::pair<Target,std::pair<Target,Target> >`? The issue now is that `convert_to(std::make_pair<to, std::make_pair<to,to> >)` do not compiles because the conversion of `std::pair` is named `ConvertToPair`. So we need to specialize the function `convert_to` for pairs. template <typename T1, typename T2, typename S1, typename S2) static std::pair<T1,T2> convert_to<std::pair<Target1,T2>, std::pair<S1,S2> >( std::pair<Source1,Source2>& from) { { return std::pair<T1,T2>(convert_to<T1>(from.first), convert_to<T2>(from.second)); } There is still a last point. The preceding design works well with unrelated classes, but what about classes that already define some kind of conversion, using a constructor or a conversion operator. Do we need to make specialization for these conversion? The answer is no. We need just to define the default implementation of convert_to function to just return the explicit conversion. template < typename Target, typename Source> Target convert_to(const Source& from) { return Target(from); } With compilers supporting partial specialization of function templates there is no major problem. For the others, we need to use a trick; as it allows partial specialization of classes we can define convert_to by as relying to a specific function of a class, as follows: namespace partial_specialization_workaround { template < typename Target, typename Source > struct convert_to { static Target apply(const Source& val); }; } template < typename Target, typename Source > Target convert_to(const Source& val) { return partial_specialization_workaround::convert_to<Target,Source>::apply(val); } So now we can specialize `partial_specialization_workaround::convert_to` for pairs as follows: namespace partial_specialization_workaround { template <typename Target1, typename Target2, typename Source1, typename Source2) struct convert_to< std::pair<Target1,Target2>, std::pair<Source1,Source2> > { static std::pair<Target1,Target2> apply(std::pair<Source1,Source2>& v) { { return std::pair<T1,T2>(convert_to<T1>(from.first), convert_to<T2>(from.second)); } }; } Conclusion Classes or algorithms relying on a conversion by copy-construction or by the conversion operator can be made more generic by relaying in a function that explicitly states this conversion. Thus, instead of requiring Target(from) require convert_to<Target>(from) The same applies to classes or algorithms relying on the assignment operator. So instead of requiring to = from require assign_to(to, from); The default implementation of assign_to relies on the assignment operator template < typename Target, typename Source > To& assign_to(Target& to, const Source& from) { to = from; return to; } and with the workaround namespace partial_specialization_workaround { template < typename Target, typename Source > struct assign_to { static To& apply(Target& to, const Source& from) { to = from; return to; } }; } template < typename Target, typename Source > To& assign_to(Target& to, const Source& from) { return partial_specialization_workaround::assign_to<Target,Source>::apply(to, from); } For classes that are explicitly convertible and having a self assignment operator it is easy to make a specialization of assign_to as follows. to = convert_to<Target>(from); The rationale is that if there was not a copy constructor from a Source seems reasonable to think that there will not be an assignment operator. So in most of the cases, once we have specialized the convert_to function we recover a reasonable implementation for the assign_to function. When doing multiple assignments we use to do a = b = c; With assign_to we could do assign_to(a, assign_to(b, c)); and if we find this not really readable we can try with tie(a) = tie(b) = c; The behavior of tie recall the tie function of Boost.Tuple, but instead assigning multiple variable at once, assign only one by calling assign_to. So one of the advantages of using this common functions is uniformity. The other is that now we are able to find all the explicit conversions to one type, as we can do with explicit casts. We can even generalize this, so classes or algorithms relying on a member function, can be made more generic by relaying on a free function. The default function implementation could just call to the member function with the equivalent prototype, but this is out of the scope of this library. Note that this is already the case of the free functions as swap(), begin(), next(), end(), ... What about changing the C++ standard? C++1x has added explicit conversion operators, but they must always be defined in the Source class. The same applies to the assignment operator, it must be defined on the Target class. What it will interesting is to be able to add constructors and assignments operators to the class std::pair, so we can say that two pairs are convertible if the parameters are explicitly convertible using a convert_to function template<class U , class V> //requires HasConvertTo<T1, const U&> && HasConvertTo<T2, const V&> std::pair& operator=(const std::pair<U , V>& p) { return std::make_pair(convert_to<T1>(p.first), convert_to<T1>(p.second)); } But this is not possible. We can not add operators to a class from outside. A more generic alternative could be to make an evolution to the standard, so the convertible concept takes car of extrinsic conversions. We could be able to implicitly or explicitly add extrinsic conversion operators between unrelated types. Assignment operators could also be specialized. template < typename To, typename From > operator To(const From& val); template < typename To, typename From > To& operator=(To& to, const From& from); For example we could specialize the conversion from as chrono::time_point<Clock, Duration> to posix_time::ptime follows template < class Clock, class Duration> operator boost::posix_time::ptime(const boost::chrono::time_point<Clock, Duration>& from) { typedef boost::chrono::time_point<Clock, Duration> time_point_t; typedef boost::chrono::nanoseconds duration_t; typedef boost::duration_t::rep rep_t; rep_t d = boost::chrono::duration_cast<duration_t>(from.time_since_epoch()).count(); rep_t sec = d/1000000000; rep_t nsec = d%1000000000; return boost::posix_time::from_time_t(0)+ boost::posix_time::seconds(static_cast<long>(sec))+ boost::posix_time::nanoseconds(nsec); } The convert_to and the assign_to functions preted to be a library solution to the convertibility of unrelated types problem. Best regards, _____________________ Vicente Juan Botet Escribá

5 12

[rfc] a library for gesture recognition, speech recognition, and synthesis
by Stjepan Rajko 26 Oct '09

26 Oct '09

Hello, For the past few years I've been working on the AME Patterns library - a generic library for modeling, recognition and synthesis of sequential patterns. So far it's been applied mostly to gesture recognition (e.g., recognition of mouse gestures, full body gestures from video or motion capture data, accelerometer gestures), but recently it has also shown some good results on speech datasets. It can also be used to synthesize the same kinds of patterns it can recognize (e.g., you could use it to synthesize a gesture or speech, or purely numerical patterns). The library provides support for hidden Markov models and other related models. The design is concept-based, and the library uses the Boost Graph Library, Boost.Range (including the RangeEx extension), Boost.Fusion, Boost.Math, Boost.Random, and other boost libraries. The documentation for the library is available here: http://ame4.hc.asu.edu/amelia/patterns/ However, the documentation is lacking, so I'm curious to know which parts of the functionality (if any) are of interest to the boost community, so I know what parts of the documentation to focus on. I am also considering proposing a presentation of this library to BoostCon. The library is currently released under the GPL, which I realize is not acceptable to some. Please let me know your thoughts. If anyone is interested in using this library, please let me know what you'd like to use it for and I'd be happy to help you get started. Kind regards, Stjepan

2 3

[conversion] How to repere assignement to a variable? (was [property] interest in C# like properties for C++?)
by vicente.botet 26 Oct '09

26 Oct '09

Hi, in the thread about C# like properties we were talking about the advantage to be able to repere assignation to properties. I said that, another way to repare the assignments is to use a free function assign_to, like we use the free function swap, or the cast family functions. assign_to(a.p_X, 1); assign_to call by default the assignment operator. If we want transitive assignation a = b = c; we could do assign_to(a, assign_to(b, c)); and if we find this not really readable we can try with tie(a) = tie(b) = c; tie is a template function returning an ca_wrapper. template <typename T> ca_wrapper <T> tie(T& r) { return ca_wrapper<T>(r); } ca_wrapper is responsable to transforming the assignation and operator conversion on a call to assign_to and no more. template <typename T> class ca_wrapper { T& ref_; public: ca_wrapper(T& r) : ref_(r) {} template <typename U> T& operator =(U const& u) { return assign_to(ref_, u); } template <typename U> operator U() { return convert_to(ref_, u); } }; The advantage of having a specific function is that we can specialize the assign_to function for unrelated classes. The Boost.Conversion library (on the review schedule) defines two free functions convert_to and assign_to which by default use the conversion operator and the assignment. We can see convert_to as a getter and assign_to as a setter. The major advantage is that with a uniform syntax, the user can however specialize them to do conversion and assignations between unrelated types. I don't know if tie is a good name to manage with assignation of a variable, I have taken the name from the Boost.Tuple? Regards, _____________________ Vicente Juan Botet Escribá P.S. tie and ca_wrapper are new features of Boost.Conversion v.0.3

2 3

boost design details
by wildinto wildinto 26 Oct '09

26 Oct '09

hi all, because i'm studying the generic programming, i just want to study boost to get the most useful skills, but i can't find any design details about boost. such as boost bind, so, anyone who can tell where i can find the design details about the design of each boost lib ? thanks very much! best regards, Thunder

1 0

[BGL] [Property Map] PropertyGraph concept
by Cosimo Calabrese 26 Oct '09

26 Oct '09

Hi to all, I've taked a look to the PropertyGraph concept, and it defines the following valid expression: get(p, g, x) and its return type: boost::property_traits<Map>::*value_type* Also the docs of Property Map library says that the get() function return the property *by value*, making a copy of the property. But looking to the \boost\graph\detail\adjacency_list.hpp file, I've noticed that the return value of the get function is: typename boost::property_traits< typename boost::property_map<typename Config::graph_type, Property>::type >::*reference* Why this difference? Or they are the same think? Which is the correct specific? Thanks in advance, Cosimo Calabrese.

2 1

[RegEx] Performance degradation since 1.36
by Dave Vest 26 Oct '09

26 Oct '09

I've just downloaded boost 1.40, compiled the libraries, and re-compiled our application. Part of our application uses regular expressions extensively to search through source code and the performance appears to be up to 5 x slower in release mode than with the 1.36 libraries. Boost source (no modifications) compiled with Visual Studio 2008 on Win 7. (Note: 1.36 was compiled with VS 2008 on Win Vista.) bjam debug release --with-thread --with-regex --with-date_time link=static Regex creation: boost::regex::flag_type flags = boost::regex::perl | boost::regex::optimize | boost::regex::icase); boost::regex * pengine = new boost::regex(strSampleExpression, flags); .. Regex use: boost::regex_iterator<char const*> itMatch(pszStr, pszStr + nStrLen, *pengine); boost::regex_iterator<char const*> itEnd; if ( itMatch != itEnd ) { . } A simple for(int i=0;i<100000;++i) loop test shows huge differences. Any ideas why 1.40 is so much slower? Some change in default traits or some documentation note I've missed?

1 0

[PBGL] Distributed BFS example : input and outpu
by Sandeep Gupta 26 Oct '09

26 Oct '09

Hello, I am trying to understand how the example libs/graph_parallel/example/breadth_first_search.cpp works. I am not able to understand (neither find any documentation for it) the input and output of the program. To the best of my understanding a valid input to this program is graph/test/ weighted_graph.gr. What's the format for the input. And why does the output of BFS dependent upon the number of process in the mpirun argument. Would greatly appreciate any explanation or relevant pointers. -thanks Sandeep

1 0

[Test] Building with Comeau C/C++ 4.3.10.1 fails
by Mateusz Loskot 25 Oct '09

25 Oct '09

Hi, Where can I find current status what Boost libraries compile using Comeau C/C++ compiler? I've tried to build Boost.Test and it fails. Is this a known issue? Should I submit a ticket with detailed errors log? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 3

tuple<T,T,...> generator meta-function
by Emre Turkay 23 Oct '09

23 Oct '09

Hi folks, How can I do this in a better way? template <typename T, size_t N> struct make_tuple { }; template <typename T> struct make_tuple<T, 1> { typedef boost::tuple<T> type; }; template <typename T> struct make_tuple<T, 2> { typedef boost::tuple<T, T> type; }; template <typename T> struct make_tuple<T, 3> { typedef boost::tuple<T, T, T> type; }; template <typename T> struct make_tuple<T, 4> { typedef boost::tuple<T, T, T, T> type; }; // ... Thanks, emre

4 3

Re: [boost] [property] interest in C# like properties for C++?
by Stefan Strasser 23 Oct '09

23 Oct '09

Not trying to beat a dead horse, but this is yet another reason to keep the parenthesis syntax: name().size() -- Ursprüngl. Mitteil. -- Betreff: Re: [boost] [property] interest in C# like properties for C++? Von: Olaf van der Spek <olafvdspek(a)gmail.com> Datum: 23.10.2009 07:44 On Fri, Oct 23, 2009 at 1:30 AM, Edward Diener <eldiener(a)tropicsoft.com> wrote: > Of course you can support reference properties along with value properties. > It is just very hard, if not impossible, to support both kinds using the > same template class. So really one would not a separate template class to > support reference properties. Maybe I should've said class reference. Take std::string for example. I'd be very interested if you've got code that supports for example name.size() where name is your reference property class. name->size() is no problem, but I'd like to have name.size(). Olaf _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[random] seeding with arbitrary integers
by Steven Watanabe 23 Oct '09

23 Oct '09

AMDG Currently, some PRNGs cannot be seeded with certain values. For example, the seed for linear_congruential cannot be a multiple of the modulus if the offset is zero. lagged_fibonacci also cannot be seeded with 0, because it uses minstd_rand0. Since linear_congruential already tries to wrap the seed to fit in the range, I'd like to change it so that any seed works. The other generator that needs to be changed is linear_feedback_shift. linear_feedback_shift cannot be seeded with a small integer. What I've done is to add the minimum value to the seed, if the seed is too small. I'm not sure that this is a good solution, since this means that there are a few (and only a few) seeds that result in identical generators. Thoughts? Would it be better to wrap the values to make them fit in range instead? At least this would be consistent with linear_congruential. I've attached a patch with these changes and test cases. See also: http://svn.boost.org/trac/boost/ticket/3516 which prompted this investigation. In Christ, Steven Watanabe

7 18

[asio] help windows.h not littering namespace
by Bjoern Thiel 23 Oct '09

23 Oct '09

Hallo, in socket_types.hpp instead of ... # if defined(__CYGWIN__) # if !defined(__USE_W32_SOCKETS) # error You must add -D__USE_W32_SOCKETS to your compiler options. # endif // !defined(__USE_W32_SOCKETS) # if !defined(NOMINMAX) # define NOMINMAX 1 # endif // !defined(NOMINMAX) # endif // defined(__CYGWIN__) # include <winsock2.h> ... I suggest something like ... # if defined(__CYGWIN__) # if !defined(__USE_W32_SOCKETS) # error You must add -D__USE_W32_SOCKETS to your compiler options. # endif // !defined(__USE_W32_SOCKETS) # endif // defined(__CYGWIN__) # if !defined(NOMINMAX) # define NOMINMAX 1 # define BOOST_NOMINMAX_DEFINED 1 # endif // !defined(NOMINMAX) # include <winsock2.h> # if defined(BOOST_NOMINMAX_DEFINED) # undef NOMINMAX # undef BOOST_NOMINMAX_DEFINED # endif // defined(BOOST_NOMINMAX_DEFINED) ... Thanks. Bjoern Thiel

1 0

[libboost_regex-1_32.dylib] Validating Email address using Regx failing in boost
by Arun 23 Oct '09

23 Oct '09

Hi All, I am using boost regex libraries (libboost_regex-1_32.dylib) for validation of strings. The regular expression string i use is as below. string expr = "^((?>[a-zA-Z\\d!#$%&'*+\\-/=?^_`{|}~]+\\x20*|\"((?=[\\x01-\\x7f])[^\"\\\\]|\\\\[\\x01-\\x7f])*\"\\x20*)*(?<angle><))?((?!\\.)(?>\\.?[a-zA-Z\\d!#$%&'*+\\-/=?^_`{|}~]+)+|\"((?=[\\x01-\\x7f])[^\"\\\\]|\\\\[\\x01-\\x7f])*\")@(((?!-)[a-zA-Z\\d\\-]+(?<!-)\\.)+[a-zA-Z]{2,}|\\[(((?(?<!\\[)\\.)(25[0-5]|2[0-4]\\d|[01]?\\d?\\d)){4}|[a-zA-Z\\d\\-]*[a-zA-Z\\d]:((?=[\\x01-\\x7f])[^\\\\\\[\\]]|\\\\[\\x01-\\x7f])+)\\])(?(angle)>)$"; When i make a call boost::regex regExpr(expr); it is throwing what(): Invalid preceding regular expression. I got the regular expression from http://regexlib.com/REDetails.aspx?regexp_id=711 and converted into std::string. If i print the string onto a terminal, the string exactly matches with the regular expression ^((?>[a-zA-Z\d!#$%&'*+\-/=?^_`{|}~]+\x20*|"((?=[\x01-\x7f])[^"\\]|\\[\x01-\x7f])*"\x20*)*(?<angle><))?((?!\.)(?>\.?[a-zA-Z\d!#$%&'*+\-/=?^_`{|}~]+)+|"((?=[\x01-\x7f])[^"\\]|\\[\x01-\x7f])*")@(((?!-)[a-zA-Z\d\-]+(?<!-)\.)+[a-zA-Z]{2,}|\[(((?(?<!\[)\.)(25[0-5]|2[0-4]\d|[01]?\d?\d)){4}|[a-zA-Z\d\-]*[a-zA-Z\d]:((?=[\x01-\x7f])[^\\\[\]]|\\[\x01-\x7f])+)\])(?(angle)>)$ I am not able to find why boost is telling the string as invalid regular expression. I work in Mac OS X Leopard, and use boost_1_32. Any ideas? Thanks Arun Reply Forward New window Print all « Back to Sent Mail Archive Report spam Delete Move to Inbox Labels More actions 1 of 598 Older › Use free POP access to download your messages to Outlook or devices that support POP. Learn more You are currently using 1306 MB (17%) of your 7382 MB. Last account activity: 9 minutes ago at this IP (125.16.133.35). Details Gmail view: standard | turn off chat | older version | basic HTML Learn more ©2009 Google - Terms - Privacy Policy - Google Home

4 7

[asio] icmp example not working on Windows 2000
by Wolfgang Fertsak 23 Oct '09

23 Oct '09

Hello! The icmp example provided with the asio-library in 1.40 throws a system error with code 10044 "The support for the specified socket type does not exist in this address family." when compiled with _WIN32_WINNT 0x0500 and executed on an Win2000 machine. The error comes from the gai_echeck()-function in socket_ops.hpp which is called with family AF_INET and socktype SOCK_RAW: inline int gai_echeck(const char* host, const char* service, int flags, int family, int socktype, int protocol) { .... switch (family) { case AF_UNSPEC: break; case AF_INET: case AF_INET6: if (socktype != 0 && socktype != SOCK_STREAM && socktype != SOCK_DGRAM) return EAI_SOCKTYPE; ... I have attached the callstack for call to gai_echeck() I'm using Visual Studio 2005 and boost 1.39 (although the example is from boost 1.40) I changed the return value of gai_echeck() back to 0 in the debugger and then the rest of the icmp(ping) example ran without any apparent problems. Best regards, Wolfgang boost::asio::detail::socket_ops::gai_echeck(const char * host=0x0012fad0, const char * service=0x0012faa8, int flags=0, int family=2, int socktype=3, int protocol=1) Line 1380 C++ boost::asio::detail::socket_ops::getaddrinfo_emulation(const char * host=0x0012fad0, const char * service=0x0012faa8, const addrinfo * hintsp=0x0012fa78, addrinfo * * result=0x0012faf0) Line 1441 + 0x1d bytes C++ boost::asio::detail::socket_ops::WspiapiGetAddrInfo(const char * host=0x0012fad0, const char * service=0x0012faa8, const addrinfo * hints=0x0012fa78, addrinfo * * result=0x0012faf0, boost::system::error_code & ec={...}) Line 1801 + 0x15 bytes C++ boost::asio::detail::resolver_service<boost::asio::ip::icmp>::resolve(boost::shared_ptr<void> & __formal={...}, const boost::asio::ip::basic_resolver_query<boost::asio::ip::icmp> & query={...}, boost::system::error_code & ec={...}) Line 147 + 0x51 bytes C++ boost::asio::ip::resolver_service<boost::asio::ip::icmp>::resolve(boost::shared_ptr<void> & impl={...}, const boost::asio::ip::basic_resolver_query<boost::asio::ip::icmp> & query={...}, boost::system::error_code & ec={...}) Line 105 + 0x1b bytes C++ boost::asio::ip::basic_resolver<boost::asio::ip::icmp,boost::asio::ip::resolver_service<boost::asio::ip::icmp> >::resolve(const boost::asio::ip::basic_resolver_query<boost::asio::ip::icmp> & q={...}) Line 98 + 0x1d bytes C++ pinger::pinger(boost::asio::io_service & io_service={...}, const char * destination=0x00324199) Line 32 + 0x1a bytes C++ main(int argc=2, char * * argv=0x00324170) Line 155 + 0x16 bytes C++

1 0

boost-test and Mac 10.6
by Mike Tegtmeyer 23 Oct '09

23 Oct '09

Does anyone know anything about boost test crashing on Mac 10.6? Unless I'm missing something, it is completely broken for 1.40 and trunk. There is a Ticket #2889 (closed Bugs: fixed) for malloc errors that looks awfully similar to what I'm seeing. file is: rotor:~ tegtmeye$ cat boost_test.cc #define BOOST_TEST_MODULE footest test #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE( test1 ) { BOOST_CHECK( true ); } BOOST_AUTO_TEST_CASE( test2 ) { BOOST_CHECK( true ); } BOOST_AUTO_TEST_CASE( test3 ) { BOOST_CHECK( true ); } BOOST_AUTO_TEST_CASE( test4 ) { BOOST_CHECK( true ); } rotor:~ tegtmeye$ g++ boost_test.cc /usr/local/lib/libboost_unit_test_framework.a rotor:~ tegtmeye$ ./a.out Running 4 test cases... *** No errors detected a.out(69716) malloc: *** error for object 0x30001002002e0: pointer being freed was not allocated *** set a breakpoint in malloc_error_break to debug Abort trap

3 3

[intrusive] rtti_base class proposition
by Ireneusz Szpilewski 22 Oct '09

22 Oct '09

Hi, Here is my idea for this little class: class rtti_base { virtual void _dummy() {} }; Every class deriving from rtti_base can be queried by means of RTTI, in particular rtti_base class and dynamic_cast can be used in similar way as IUnknown and QueryInterface() in COM Object Model rtti_base* could be used as a "smart" void* pointer - we can get type information, and use it in heterogenic containers as in: std::list<rtti_base*> beings; we can iterate through beings and call Cat::GiveMilk() for cats but Girl::Kiss() for girls. :-) The main purpose of this class is to set some standard name for that pointer type. Ireneusz Szpilewski

7 27

Re: [boost] linking on OSX
by David M. Cotter 22 Oct '09

22 Oct '09

>> please be explicit, are you saying i should type exactly this: >> >> ./bjam macosx-version-min=10.4 architecture=combined >> linkflags="-Wl,-force_cpusubtype_ALL" --with-thread -a -n install > > I don't know how to use bjam, nor do I have any wish to learn, so I > can't help you with its command line arguments. > Did doing that give you -Wl,-force_cpusubtype_ALL for the g++ > command that creates libboost_thread.dylib? apparently the extra -Wl is not necessary, since when i leave it off, it still gets sent, probably due to the macosx-min-version flag. WITH: > ./bjam macosx-version-min=10.4 architecture=combined linkflags="-Wl -force_cpusubtype_ALL" --with-thread -a -n install "g++" -dynamiclib -Wl,-single_module -install_name "libboost_thread.dylib" -o "bin.v2/libs/thread/build/darwin-4.2.1/ release/architecture-combined/macosx-version-min-10.4/threading-multi/ libboost_thread.dylib" "bin.v2/libs/thread/build/darwin-4.2.1/release/ architecture-combined/macosx-version-min-10.4/threading-multi/pthread/ thread.o" "bin.v2/libs/thread/build/darwin-4.2.1/release/architecture- combined/macosx-version-min-10.4/threading-multi/pthread/exceptions.o" "bin.v2/libs/thread/build/darwin-4.2.1/release/architecture-combined/ macosx-version-min-10.4/threading-multi/pthread/once.o" - headerpad_max_install_names -mmacosx-version-min=10.4 -Wl,-dead_strip - no_dead_strip_inits_and_terms -arch i386 -arch ppc -Wl - force_cpusubtype_ALL note: see it's in there TWICE? is the problem that i'm missing a comma? WITHOUT: > ./bjam macosx-version-min=10.4 architecture=combined linkflags="- force_cpusubtype_ALL" --with-thread -a -n install "g++" -dynamiclib -Wl,-single_module -install_name "libboost_thread.dylib" -o "bin.v2/libs/thread/build/darwin-4.2.1/ release/architecture-combined/macosx-version-min-10.4/threading-multi/ libboost_thread.dylib" "bin.v2/libs/thread/build/darwin-4.2.1/release/ architecture-combined/macosx-version-min-10.4/threading-multi/pthread/ thread.o" "bin.v2/libs/thread/build/darwin-4.2.1/release/architecture- combined/macosx-version-min-10.4/threading-multi/pthread/exceptions.o" "bin.v2/libs/thread/build/darwin-4.2.1/release/architecture-combined/ macosx-version-min-10.4/threading-multi/pthread/once.o" - headerpad_max_install_names -mmacosx-version-min=10.4 -Wl,-dead_strip - no_dead_strip_inits_and_terms -arch i386 -arch ppc -force_cpusubtype_ALL

2 3

[conversion] Release v0.3 : Changing the order of assign_to parameters + `tie' function
by vicente.botet 22 Oct '09

22 Oct '09

Hi, I have just released the version 0.3 of Boost.Conversion , which includes since my last publicly announced version 0.1: Version 0.3.0, Oct 22, 2009 Changing the order of to and from parameters on assign_to + Added `tie' function Incopatibility: * Changing the order of to and from parameters on assign_to. * Now boost/conversion/convert_to.hpp and boost/conversion/assign_to.hpp files are separated. New Features: * Added <boost/conversion.hpp> global file. * Added mca() function. * Added convert_to_via function. Test: * Added test for the new features Version 0.2.0, Mai 16, 2009 Adding array + fusion::tuples + Adaptation to Boost 1.39 New Features: * conversion between boost::array of explicitly convertible types. * conversion between Boost.Fusion sequences of explicitly convertible types. You can found all the detail for dowloading, documentation, ... in http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Conve… I'd appreciate it if people could take a look, test it on their compiler and give me some feedback. Best regards, _____________________ Vicente Juan Botet Escribá

1 0

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

please be explicit, are you saying i should type exactly this: ./bjam macosx-version-min=10.4 architecture=combined linkflags="-Wl,- force_cpusubtype_ALL" --with-thread -a -n install cuz that didn't do anything On Oct 21, 2009, at 11:03 AM, Peter O'Gorman wrote: > On 10/21/2009 12:26 PM, David M. Cotter wrote: >> you can see that the build system is in fact emitting the correct >> command for linking, however it is apparently being ignored on PPC > >> >> malkier:lib davec$ otool -f -v ./libboost_thread.dylib >> Fat headers >> fat_magic FAT_MAGIC > >> architecture *ppc7400* >> cputype CPU_TYPE_POWERPC >> cpusubtype *CPU_SUBTYPE_POWERPC_7400* >> capabilities 0x0 > >> >> so i'm dead in the water on this project. any insight or help that >> solves this would win you free mac Karaoke software. :) and my >> gratitude. >> > > Change it to -Wl,-force_cpusubtype_ALL, the flag is not passed along > by gcc to the linker. > > If you build all your object files with the -mmacosx-version-min > flag, as far as I know, you shouldn't be getting ppc7400 in the > cpusubtype. > > Peter > -- > Peter O'Gorman > http://pogma.com

2 2

[BGL] Multithread problem inserting edges and exploring the same graph
by Cosimo Calabrese 21 Oct '09

21 Oct '09

Hi to all, I've a problem on BGL. My environment is WinXP, Visual Studio 2005, Boost 1.37. I'm trying to use BGL in the following way. I've a single graph in my application, that is an adjacency_list< vecS, vecS, ... >, and I've 2 kind of threads that work on the graph: - some "Explorer" threads, that executes a Dijkstra's algorithm repeatedly; - some "Integrator" thread, that call the add_edge() function repeatedly. The program often crashes, because it cannot dereference some graph elements, some auto_ptr... The crash isn't sistematic, so I think there's a concurrency problem. I think that the problem is in the use of the vectors in the implementation of the graph. In general, if I've an iterator 'it' that point on an vector's element A, and I insert another element B before A, then the iterator is now invalid. I suppose that it happens something of similar in the graph. If I read the out-edge list of a vertex at the same time that I add another out-edge to the same vertex, the reading may be inconsistent. So I've tried with an adjacency_list< listS, vecS, ... >, because if I add an element to a list, the previous reference are still valid, but I've experienced the same problem again. If what I've said is correct, then I think that with an adjacency_matrix I will not have problems, but I've approximately 5 millions of vertices, and the graph is sparse. I think that is a waste of memory. And what about the exploring time? Another question: if I launch *only* a set of Explorer thread, it seems that there aren't problems with EdgeList = listS and EdgeList = vecS too. Can someone confirm to me that the exploring algorithms, like Dijkstra, don't modify the graph structure? Are they read-only algorithms? Can I safely launch multiple exploration threads simultaneously? Can someone help me? Many thanks in advance, Cosimo Calabrese.

5 24

Re: [boost] Preliminary submission: generic linear algebra algorithms library Boost LA
by Daniel Pfeifer 21 Oct '09

21 Oct '09

Hi Emil, I had a look at the documentation and examples of your library and I think it is awesome so far. Your library could be a C++ complement to the builtin vector and matrix types and functions of GLSLang. (see http://www.opengl.org/registry/doc/GLSLangSpec.1.50.09.pdf pages: 23, 53ff, 60, 81ff). Since you already have mastered swizzling, implementing the rest should be peanuts. My wishlist: * component wise multiplication and division of two vectors implemented as operators (as in GLSL). * all the vector and matrix related functions described in chapter 8 of the GLSL spec. * operator[] As for the name: If LA is too misleading, I would propose "kd-math" or "math-kd". There already is another project called math3d, and since your library is not limited to three dimensions, kd (as in kd-tree) suits quite well in my opinion. cheers, Daniel Emil Dotchevski wrote: > I remember some past discussions on this mailing list about the need > for similar library in Boost, so I hope it is OK to skip the interest > query and request a preliminary review for Boost LA. > > Boost LA provides a set of generic linear algebra algorithms, > primarily for working with vectors and matrices of static size. The > library also defines vector and matrix data types, however it allows > users to introduce their own types by specializing the vector_traits > and matrix_traits templates. > > Documentation and source code available at > http://www.revergestudios.com/boost-la, released under the Boost > Software License. > > Thanks, > Emil Dotchevski > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

okay i've stared at the doc for bjam but can find NOTHING which indicates how to tell it to build for 10.4 anyone have an idea on that? >>> This load command (see mach-o/loader.h) is LC_DYLD_INFO_ONLY. >>> >>> I can only guess, but did you compile boost with -mmacosx-version- >>> min=10.6, but built your app with an earlier deployment target, >>> and when you attempt to run it, you're doing so on Leopard? >> >> i did not specify a min version when i built. so what should i >> do? this is what i suspect: >> >> re-build boost using -mmacosx-version-min=10.4 >> >> and all will be well? > > Should work, though I don't know if you'll also have to point boost > at the 10.4 SDK with -isysroot. I suspect not.

4 17

BOOST_FOREACH like macro for map
by mobi phil 21 Oct '09

21 Oct '09

Hello, new to this list... did not find anything similar on net. One of the annoyances with std::map is that if you work with const maps, then there is no "one line" code to get an element knowing the key. given the map const map<string, string> aStringMap; I cannot write const string &s = aStringMap["key"]; process(s); I should write: map<string, string>::const_iterator it=aStringMap.find("key") if( it != aStringMap.end() ) { process(it->second) } so would be nice to have a macro like BOOST_CONSTMAPFIND(aStringMap, "key", data) { processResult( data ); } the version if(BOOST_CONSTMAPFIND(l_map, l_key, l_data) ) { } Seems to be impossible to implement -- rgrds, mobi phil being mobile, but including technology http://mobiphil.com

4 10

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

okay we now know what the problem is, the question for the BOOST folk is: how do i do this with bjam? On Oct 20, 2009, at 7:23 PM, Chris Suter wrote: > Hi David, > > On Wed, Oct 21, 2009 at 1:03 PM, David M. Cotter <me(a)davecotter.com> > wrote: > okay. everything is working fantastically, however, it won't run on > G3 machine running 10.4.11 > it works perfectly on a G4 PPC machine also running 10.4.11 > > is there some way to "tune" bjam to emit G3-compatible code? > cuz i'm getting this: > > Host Name: TAZ-2 > Date/Time: 2009-10-20 05:56:18.099 -0700 > OS Version: 10.4.11 (Build 8S165) > Report Version: 4 > > Command: FooBar Pro > Path: /Applications/FooBar Pro.app/Contents/MacOS/FooBar Pro > Parent: WindowServer [310] > > Version: FooBar Pro 1.0d50r33 (1.0) > > PID: 445 > Thread: Unknown > > Link (dyld) error: > > Library not loaded: @loader_path/../SharedSupport/ > libboost_thread.dylib > Referenced from: /Applications/FooBar Pro.app/Contents/MacOS/ > FooBar Pro > Reason: no suitable image found. Did find: > /Applications/FooBar Pro.app/Contents/MacOS/../SharedSupport/ > libboost_thread.dylib: no matching architecture in universal wrapper > /Applications/FooBar Pro.app/Contents/MacOS/../SharedSupport/ > libboost_thread.dylib: no matching architecture in universal wrapper > > This is most likely because you're only building for G4 machines and > greater. If you run otool -f -v <binary>, you'll probably see > cpusubtype set to CPU_SUBTYPE_POWERPC_7400 (which basically means G4 > or greater). > > To fix, as a minimum, you need to make sure that your deployment > target is set to 10.4 or less and make sure your architecture > setting is ppc rather than ppc7400. > > Kind regards, > > Chris

1 0

[interprocess] new problem with move-aware containers
by Thorsten Ottosen 20 Oct '09

20 Oct '09

Hi Ion, I'm using the boost::interprocess::multiset from trunk with vc9. After updating, some of my code stopped working. I use a set like multiset<const Node*,SomePredicate> and when calling set.insert( &obj ) I get compile errors. Specifically in interprocess\detail\move.hpp(79) I don't understand the details of these move-emulation tricks, but the compiler complains that T=U* for some U is not a legal base class. AFAICT, the compiler is right: template <class T> class rv : public T { rv(); ~rv(); rv(rv const&); void operator=(rv const&); }; -Thorsten

2 1

bzip with spreadsort
by Steven Ross 20 Oct '09

20 Oct '09

I've added fasterbzip2-1.0.5.zip to the Boost Vault as an example application of the Spreadsort hybrid radix sorting algorithm. As bzip is written in C, I couldn't use the template library directly and had to modify the source. Using the Spreadsort algorithm causes a measurable speed improvement on Windows for the first 100MB of wikipedia from: http://cs.fit.edu/~mmahoney/compression/textdata.html<http://cs.fit.edu/%7Emmahoney/compression/textdata.html> along with other data I tested. Please note that bzip doesn't spend all its time compressing, already has two stages of radix sort, and has specialized and manually inlined comparison functions, so it's heavily optimized to begin with and improvements are minor.

1 0

[mpl] Is there anyone working on mpl with variadic templates ?
by luozhiyuan 20 Oct '09

20 Oct '09

Is it possible that BOOST_MPL_LIMIT_/seq/_SIZE can be removed when we have variadic templates ?

2 1

[bitfield] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi all, I have adapted the Boost.Bitfield library from Emile Cormier with its permision and I have requested the Review Wizards to include Boost.Bitfield on the review schedule. The library is now quite stable. Even if there were not too much interest in the Boost ML, only 140 dowloads from the Boost Vault, the version on which it is based had more that 1500 downloads, so I suppose that the subject interest a lot of people. I really think Boost.Bitfield is the complement the Boost.Endian library to manage with all the endian issue, allowing to mange not only endian interger issues, but also endian bitfield issues. I hope that including it on the review schedule will generate more interest and help me to improve the library. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment is wellcome. BTW, I'm looking for a review manager. Thanks for all, Vicente Boost.Bitfield Author(s): Vicente J. Botet Escribá, Emile Cormier Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bitfie…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/bitfield Documentation: https://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.ht… Html doc also included the Vault package Categories: Portability, Integer Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Example declaration: struct Rgb565 { uint16_t storage; BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, red, 0, 4); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, green, 5, 10); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, blue, 11,15); }; Example usage: Rgb565 r; r.storage= 0xffff; // Write to a bitfield. Note that parenthesis are needed around the bitfield r.red() = 23; // Read from a bitfield unsigned char b = r.blue(); In a near future the library could add the following if the users consider it useful. * Add bitfields group * Used to easily manipulate groups of bitfields the same way as does C bitfields, but in a portable manner. Example declaration: struct Rgb565 { struct red {}; struct green {}; struct blue {}; typedef bitfields<mpl::vector< member<unsigned char, red, 5>, member<unsigned char, green, 6>, member<unsigned char, blue, 5> > > type; }; Example usage: Rgb565::type r = make_bitfields<Rgb565::type, 1,2,3>; // Write to a bitfield. r.get<Rgb565::red>() = 23; //or r.set<Rgb565::red>(23); // Read from a bitfield Rgb565::at<Rgb565::blue>::value_type b = r.get<Rgb565::blue>(); * Add pointer_plus_bits * Based on a.. The article of Joaquin Optimizing red-black tree color bits, b.. the implementation of Ion pointer_plus_bits from Boost.Intrusive , and c.. Clang's QualType smart pointer This class will allows to use the unsused bits of a pointer to reduce the size of the nodes containing pointers and bits and sometimes improving also the performances. I have not reached yet the interface I would like to have. For the moment we can do typedef pointer_plus_bits<int*,1,bool>::type pint_and_bool; int i=0; pint_and_bool v1; ASSERT_EQUALS(v1.pointer(),0); ASSERT_EQUALS(v1.small_int(),false); pint_and_bool v2(&i, true); ASSERT_EQUALS(v2.pointer(),&i); ASSERT_EQUALS(v2.small_int(),true); v1.pointer()=v2.pointer(); v1.small_int()=true; ASSERT_EQUALS(v1.pointer(),&i); ASSERT_EQUALS(v1.small_int(),true); typedef pointer_plus_bits< pointer_plus_bits<int*,1,bool>::type ,1, bool>::type pint_and_bool_bool pint_and_bool_bool v1; ASSERT_EQUALS(v1.small_int(),false); ASSERT_EQUALS(v1.pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().small_int(),false);

1 0

[interthreads] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi, I have requested the Review Wizards to include Boost.Interthreads library on the review schedule. Even if there were not too much interest for this library on this ML, there were more than 1000 dowloads from the Boost Vault. I'm open to reduce the scope of the library, if there are some parts that are not enough generic. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment will help me a lot to improve the library. BTW, I'm looking for a review manager. Thanks in advance, Vicente InterThreads __________ :Author: Vicente J. Botet Escribá :Review Manager: ??? :Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=intert…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/interthreads Documentation: https://svn.boost.org/svn/boost/sandbox/interthreads/libs/interthreads/doc/… Html doc also included the Vault package :Description: Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz.

1 0

[spirit] Support for one-pass iterators?
by Andrey Semashev 19 Oct '09

19 Oct '09

Hi, I'm trying to use Boost.Spirit.Classic to parse a text file content (or, to be more generic, a content that is read from an STL stream). I created a grammar that would fit the content, but I'm not sure which iterator I should pass to the parse function. The parser does not guarantee that it will read the content only in one pass, and I'm sure my actors will want to read the content themselves as they are called. So, obviously, istream_iterator/istreambuf_iterator will not work. Is there a tool in Boost.Spirit that would provide content buffering during the parse? If not, what can be suggested to solve this problem? BTW, the content is line-aligned, i.e. each line is syntactically distinct from others. I was thinking about writing a loop of readline/parse combo but I'm not sure how efficient it would be with regard to the grammar definition construction/destruction within the parse function. Are these concerns valid? Thanks.

7 31

Re: [boost] C# LINQ-like library: Boost.Qlang.
by Germán Diago 18 Oct '09

18 Oct '09

> Hi, > I read you mail on boost concerning QLang. I just wanted to say I was > wondering (not very seriously) how to do such system, and you come with a > very clean first try. > Basically it's done with some metaprogramming to get the exact return type of a query. For example, if I put as an argument in a select a pointer to member data, I extract that pointer to member's type and put it in a tuple, without const, volatile and removing the reference. I also use filter_iterator and transform_iterator from boost to filter sequences based on the where lambda. Just a suggestion : it would be great if the user of the qlang could select > a tuple of value as a return value. (let's say I want to select the string > member "_name", a copy of the pointeur "this", and an int "_age" for example > from a set of objects. I suppose returning a tuple for example (or some > other type than those of the members) could be very interesting. > I don't know very well what you mean by returning a tuple of value as a return value. For now, what the libraries does is, if you write: from(somerange).select(full_object); it will return a select_ object which will generate a copy of the full object. if you write: from(somerange).select(&MyStruct::a_, &MyStruct::b_); it will return a select_ object which will return a std::tuple<type of a_ without const and without reference, type of b_ without const and without reference>. Boost.Qlang allows you to return tuples right now, the problem is that those tuples (for now) are just 1-element tuples. But in the future they will be arbitrary tuples. A copy of the this pointer does not make sense I think. Since every piece of data is immutable (data is always generated based on the select arguments), if you want the this pointer, you will have to return full_object (a copy). So you cannot get the this pointer directly. You can manipulate that query and write it back where it belongs if you want to modify some object.

1 2

[filesystem] truncate() function?
by Beman Dawes 18 Oct '09

18 Oct '09

There was a request on the users list for a file truncate() function similar to the POSIX function of the same name. Since Windows provides a function with virtually identical semantics, this seems like a reasonable request. The POSIX spec includes: "If the request would cause the file size to exceed the soft file size limit for the process, the request shall fail and the implementation shall generate the SIGXFSZ signal for the process." I have no knowledge of or experience with POSIX signals, so need advice. Does the POSIX implementation need to do anything to cope with the possibility of a SIGXFSZ signal? If so what? Thanks, --Beman

7 12

[build] How to ignore Jamfiles?
by Sergey Zubkovsky 17 Oct '09

17 Oct '09

Hi, I there a way to ignore Jamfiles that are located in some subdirectories at a whole project's directory layout? Regargs, Sergey Zubkovsky

2 2

[Proto][MPL]Missing ADL barrier in MPL
by Joel Falcou 17 Oct '09

17 Oct '09

I've just hit a spurrious ADL resolution using MPL and Proto. I made a new function called size that took a proto expression and I get the compiler to complain about ambiguity between mpl::size<T> and my own size() function. I tried to add ADL Barrier to size by looking at how it was used in other MPL components but it still fail to resolve the proper symbol under gcc 4.3. Any idea on what to do to fix that ?

4 6

[1.41] Release Notes
by Daniel James 17 Oct '09

17 Oct '09

Hello everyone, Since we've more or less entered feature freeze, it's time to add any updates to the release notes. As always, you can just email me a line or two and I'll add it, ideally including the Trac tickets that have been fixed. Or if you want to do it yourself, the release notes directory is: https://svn.boost.org/svn/boost/website/public_html/beta/feed/history/ It would be best if you could do this before Sunday so that your changes will be included in the beta notes. thanks, Daniel

2 1

Re: [boost] [1.40.0] Compilation errors in Visual Studio
by jeremyShiers 17 Oct '09

17 Oct '09

I had the same problem the options you have listed include /Za which means disable language extensions (c/c++ ; Language ; Disable Lanauge Extensions = yes in visual studio) I changed this and it compiled who knows why changing from boost_1_39 to 1_40 should expose this. cheers Jeremy Yes, I join to this question. My setup: - VS2005 and try to compile QuantLib. - boost_1_40 Yes, I join to this question. My setup: - VS2005 and try to compile QuantLib. - boost_1_40 -- View this message in context: http://www.nabble.com/-1.40.0--Compilation-errors-in-Visual-Studio-tp253364… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0