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

[thread] Why is thread_interrupted not derived from thread_exception or std::exception?
by Boris Schaeling 07 Feb '09

07 Feb '09

Why is thread_interrupted not derived from thread_exception or std::exception? It might easily slip through a try/catch-block, and if I hadn't looked up the header file now it might have slipped through mine. Boris

4 3

[thread_pool|range_ex|bind] Extrange behaviour with fibonacci example and parallel_sort
by vicente.botet 07 Feb '09

07 Feb '09

Hi, I have tried to do a parallel_sort using the Boost.ThreadPool library and I get some realy extrange. I have copied the fibonacci example and adapted it to do a parallel sort. See attached file. When I set the defines FIBO this works some times, don't finish others and crash the others. I have added some traces (define COUT) and I get better results but not always correct. I suspected that the threads in the thread pool needs to be stoped. I have added a pool shutdown but nothing changes. Oliver, could you take a look? When I define X_SORT the compilation even do not finish. What is wrong on my definition of parallel_sort? Am I using boost:bind incorrectly? Is there some issue with binding function templates? Can some one help me? Thanks in advance, Vicente P.S. I'm using Boost 1.37 + The file compiles only with the lates version of the Boost.Range library http://www.boostpro.com/vault/index.php?action=downloadfile&filename=range_… and the Boost.ThreadPool version 17 http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-… $ gcc --version gcc (GCC) 3.4.4 (cygming special, gdc 0.12, using dmd 0.125) Copyright (C) 2004 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Debug session $ gdb x_sort2 GNU gdb 6.8.0.20080328-cvs (cygwin-special) Copyright (C) 2008 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "i686-pc-cygwin"... (gdb) help List of classes of commands: aliases -- Aliases of other commands breakpoints -- Making program stop at certain points data -- Examining data files -- Specifying and examining files internals -- Maintenance commands obscure -- Obscure features running -- Running the program stack -- Examining the stack status -- Status inquiries support -- Support facilities tracepoints -- Tracing of program execution without stopping the program user-defined -- User-defined commands Type "help" followed by a class name for a list of commands in that class. Type "help all" for the list of all commands. Type "help" followed by command name for full documentation. Type "apropos word" to search for commands related to "word". Command name abbreviations are allowed if unambiguous. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3056.0x128] [New thread 3056.0x68c] std::sort: reverse 0..100000 0.05 s [New thread 3056.0xfe4] [New thread 3056.0x1c8] 55 Program exited normally. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 4028.0xd48] [New thread 4028.0xef4] std::sort: reverse 0..100000 0.03 s [New thread 4028.0x9ec] [New thread 4028.0x5bc] [New thread 4028.0x3bc] [Switching to thread 4028.0x3bc] Quit (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 2220.0x4dc] [New thread 2220.0xe58] std::sort: reverse 0..100000 0.05 s [New thread 2220.0x9b0] [New thread 2220.0x778] [New thread 2220.0x264] Program received signal SIGINT, Interrupt. [Switching to thread 2220.0x264] 0x7c87635d in KERNEL32!GetConsoleCharType (Quit (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3964.0xf40] [New thread 3964.0xedc] std::sort: reverse 0..100000 0.05 s [New thread 3964.0x320] [New thread 3964.0xe44] [New thread 3964.0x544] [Switching to thread 3964.0x544] Quit (gdb) q The program is running. Exit anyway? (y or n) y Vicente@viboes1 ~/SVN/bin.v2/vbe_interthreads/libs/interthreads/test/x_sort2.tes t/gcc-3.4.4/debug/link-static/threading-multi $ gdb x_sort2 GNU gdb 6.8.0.20080328-cvs (cygwin-special) Copyright (C) 2008 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "i686-pc-cygwin"... (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 1076.0x31c] [New thread 1076.0x9b8] std::sort: reverse 0..100000 0.05 s [New thread 1076.0xaec] [New thread 1076.0xdc0] 19239 [unknown (0xDC0)] x_sort2 1076 _cygtls::handle_exceptions: Exception: ST ATUS_ACCESS_VIOLATION 59227 [unknown (0xDC0)] x_sort2 1076 open_stackdumpfile: Dumping stack trace t o x_sort2.exe.stackdump Program received signal SIGSEGV, Segmentation fault. [Switching to thread 1076.0xdc0] 0x610b6132 in pthread_cond::~pthread_cond () from /usr/bin/cygwin1.dll (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 1876.0x8dc] [New thread 1876.0x938] std::sort: reverse 0..100000 0.05 s [New thread 1876.0x624] [New thread 1876.0xe28] 55 Program exited normally. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3240.0xef8] [New thread 3240.0xfb8] std::sort: reverse 0..100000 0.05 s [New thread 3240.0x5d4] [New thread 3240.0xe04] [New thread 3240.0x884] [Switching to thread 3240.0x884] Quit (gdb) q The program is running. Exit anyway? (y or n) y

1 0

Re: [boost] [lexical_cast] A suggestion
by Anders Dalvander 07 Feb '09

07 Feb '09

> some bashing snipped... Why not compromise? 1. Make the lexical_cast changes for optional that Andrew Troschinetz suggested. 2. Add the following convert_to.hpp file: #include <boost/lexical_cast.hpp> #include <boost/optional.hpp> namespace boost { template <typename Target, typename Source> inline Target convert_to(const Source& arg) { return lexical_cast< optional<Target> >(arg).get_value_or(Target()); } template <typename Target, typename Source> inline Target convert_to(const Source& arg, const Target& fallback) { return lexical_cast< optional<Target> >(arg).get_value_or(fallback); } } 3. Use convert_to instead of lexical_cast. 4. Everyone happy? Regards, Anders Dalvander

1 0

[config] [random] usage of BOOST_NO_MEMBER_TEMPLATE_FRIENDS
by Steven Watanabe 07 Feb '09

07 Feb '09

AMDG Boost.Random uses BOOST_NO_MEMBER_TEMPLATE_FRIENDS to decide whether it is safe to define the stream operators. #if !defined(BOOST_NO_OPERATORS_IN_NAMESPACE) && !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template<class CharT, class Traits> friend std::basic_ostream<CharT,Traits>& operator<<(std::basic_ostream<CharT,Traits>& os, const uniform_int& ud); template<class CharT, class Traits> friend std::basic_istream<CharT,Traits>& operator>>(std::basic_istream<CharT,Traits>& is, uniform_int& ud); #endif However, the documentation of BOOST_NO_MEMBER_TEMPLATE_FRIENDS says that BOOST_NO_MEMBER_TEMPLATE_FRIENDS is defined if the compiler doesn't support template<class P> friend class frd; It seems from https://svn.boost.org/trac/boost/ticket/1068 that these do not correspond exactly. Are there any compilers that we still care about, that don't support this use of friend? Also, it sounds to me like the use of BOOST_NO_OPERATORS_IN_NAMESPACE is wrong because it is documented as "Compiler requires inherited operator friend functions to be defined at namespace scope" and there is no inheritance here. Is this right? In Christ, Steven Watanabe

2 1

Re: [boost] [date_time] Time zone improvements
by Rutger ter Borg 07 Feb '09

07 Feb '09

Jeff Garland wrote: > Very cool :-) One question -- is there a portable solution where a user > could deploy a files onto a Windows system or is it a Unix only solution? Portable, big endian binary files. The variant I'm proposing is also based on the POSIX standard http://www.opengroup.org/onlinepubs/000095399/basedefs/xbd_chap08.html: "TZ This variable shall represent timezone information. The contents of the environment variable named TZ shall be used by the [snip] functions, and by various utilities, to override the default timezone. The value of TZ has one of the two forms (spaces inserted for clarity): :characters or: std offset dst offset, rule " The second variant is what's currently in Boost.Date_Time as Posix Time Zone, having a direct specification of the time zone. I'll be talking about the first variant, containing :characters. Although this is implementaiton specific, most POSIX-compatible systems have implemented the Zoneinfo database for this variant, e.g., Linux-based systems, many BSDs, Mac OS X, etc. The :characters point to any other zoneinfo-compatible binary file, either with an absolute or relative path. A natural step for changing Boost.Date_Time would be to make changes such that the Posix Time Zone supports both formats. I.e., variant 1) posix_time_zone( ":/etc/localtime" ); or posix_time_zone( ":/usr/share/zoneinfo/Europe/Amsterdam" ); variant 2) posix_time_zone( "EST-5EDT,M4.1.0,M10.5.0" ); I think both should work as it is from the same standard, and seems to be a natural and consistent starting point to look at changing the interface. Do you agree? > Actually, I believe the abstract timezone is able to support this, but > there > isn't a concrete implementation. It would be great to have the concrete > implementation to prove out the abstraction (obviously from the text below > you think there needs to be changes). As far as I can tell, the abstract time zone class currently is not able to represent variant 1): the abstract zone class is geared towards a single-lined definition of a time zone, whereas variant 1) may be regarded as a series of definitions, i.e., a map of < transition_time_point_in_utc, { gmt_offset, abbreviation, is_dst, ... } > looking up utc_to_local is a matter of doing a lower_bound search on the transition time points. The right-hand side of the map above is widely implemented with a struct called ttinfo. A proposal from my side would be to change the abstract time zone class in such way that it is able to represent both variants. The easiest approach here is probably to introduce the ttinfo structure, and make the current library working with that. variant 1): has a map of transition points, returns a (pointer to a) ttinfo structure. May hold more than 2 different ttinfo structures. variant 2): always has 2 ttinfo structures (std/dst). Uses dst-calculations/functions to lookup the transitions point, returns the right (pointer to a) ttinfo structure. What do you think? Cheers, Rutger

2 3

[filesystem] relative path from arbitrary file system location?
by Kenny Riddile 07 Feb '09

07 Feb '09

Is there any existing functionality for getting a relative path from a full path, where the desired relative path is relative to an arbitrary directory path? If not, I'm assuming I would just have to walk up both full paths until I find their intersection...etc

2 4

[who's using boost] matlap!
by Thorsten Ottosen 07 Feb '09

07 Feb '09

Hi follow boosters, I'm just installing matlap 2008, and looked in the bin/win32 directory. It contains nothing less than boost_date_time-vc80-mt-1_34_1.dll boost_filesystem-vc80-mt-1_34_1.dll boost_graph-vc80-mt-1_34_1.dll boost_iostreams-vc80-mt-1_34_1.dll boost_prg_exec_monitor-vc80-mt-1_34_1.dll boost_program_options-vc80-mt-1_34_1.dll boost_regex-vc80-mt-1_34_1.dll boost_serialization-vc80-mt-1_34_1.dll boost_signals-vc80-mt-1_34_1.dll boost_unit_test_framework-vc80-mt-1_34_1.dll boost_wave-vc80-mt-1_34_1.dll boost_wserialization-vc80-mt-1_34_1.dll :-) best regards Thorsten

5 6

[New Feature Suggestion] Fast RTTI Implementation
by 류인환 07 Feb '09

07 Feb '09

Hello there. Let me introduce the fast rtti system. Many other library and system(ex. game engines) has there own rtti system. But normally their rtti system consume Big O(n) for dynamic casting another type. So, I implemented fast rtti Big O(1) time consuming rtti system. I used bit signature for class inhertance hierarchy expression. Thanks for reviewing my mail and source code

5 4

[filesystem] : basic_path : Feature request
by Rob 06 Feb '09

06 Feb '09

Whilst using filesystem::path (v1.37) , I found I wanted the following functionality: Typedefs added for reference and const_reference and a push_back function, as follows typedef string_type& reference; typedef const string_type& const_reference; inline void push_back(const_reference path) { *this /= path; } This would allow use of std::back_inserter with stl algorithms such as Boost::filesystem::path src("dir1/./dir2"); Boost::filesystem::path target; Std::remove_copy(src.begin(), src.end(), std::back_inserter(target), "."); I would also like to see pop_back() but this may not be as simple to implement, I'll have to check the code Rob PS - My first post so I hope I'm on the right list, right message format, etc.

4 4

Using Boost::Thread in DLL fails on LoadLibrary
by Michael Mzik 06 Feb '09

06 Feb '09

Hi there, I am rather new to Boost and this is my first trouble (win32 debug): I am using Boost::Thread inside a DLL which is loaded by my main program via LoadLibrary(..), but doing so leads to a "Debug Assertion" in "dllinit.cpp" (only in debug configuration!). my DLL links with: #pragma comment( lib, "libboost_thread-vc80-mt-gdp-1_37" ) #pragma comment( lib, "libboost_date_time-vc80-mt-gdp-1_37" ) #pragma comment( lib, "stlportstld.5.0" ) with preprocessor defines: _STLP_DEBUG BOOST_ALL_DYN_LINK BOOST_THREAD_USE_DLL BOOST_LIB_DIAGNOSTIC I am using STLport 5.0.1 and I have boost compiled successfully against STLport (at least I hope so..), I am not using pthreads. No release/debug DLL mixups, all DLLs are available (I checked with the dependency walker). The only thing that bugs me is that there is no "libboost_thread-vc80-mt-gdp-1_37.DLL" generated during boost-build.. but honestly I havent the smallest clue whats going wrong.. Hopefully anyone of you can help me out.. thank a lot in advance and greetings, Michael

1 0

[pool] an O(1) implementation of object_pool::destroy()
by Ben Muzal 06 Feb '09

06 Feb '09

I was looking at object_pool and noticed that there is a way to make object_pool::destroy() an O(1) operation instead of an O(n) operation. If I understand the problem correctly, object_pool::destroy() is O(n) because it keep the free list sorted. It keeps the free list sorted so that object_pool::~object_pool() runs in O(n) time instead of in O(n^2) time. However, I believe there is an implementation of object_pool::~object_pool() that will run in O(n) time without requiring a sorted free list. My suggestion is that ~object_pool() could use a mark-sweep strategy: It would first step through the free list and mark each free chunk as such. It would then go back and examine each chunk in the pool and call the destructor on the ones not marked as free. The each chunk's 'next' pointer could be used to store the marked-as-free flag so that no extra memory is needed. This may be related to Ticket #290. A similar mark-sweep method could be used for pool::release_memory(). The free list would have to be reconstructed afterworlds but that is also easy. Just step back through all of the chunks and connect the ones that are marked as free. While I am on the subject of the pool library, I would also like to see a pool constructor that allows the user to set the initial size of the pool and whether or not the pool was allowed to grow. This would be very useful for the memory limited, real time environments in which memory pools are popular. Any thoughts on these suggestions? If asked, I could help work on an implementation. --Ben

3 3

[threads] API Design Question
by Alexander Bernauer 06 Feb '09

06 Feb '09

Hello Why is it, that the wait and timed_wait functions of the condition_variable class do not encapsulate the problem of spurious wakeups? I wonder whether there are good reasons. I have seen libraries which do so. Do they miss a corner case? For illustration here is a sketch of a wrapper class ---8<--- class save_condition_variable { public: save_condition_variable() : waiting(0), wakeup(0) { } void notify_one() { if (wakeup < waiting) { ++wakeup; } cond.notify_one(); } void notify_all() { wakeup = waiting; cond.notify_all(); } void wait(unique_lock<mutex>& lock) { ++waiting; do { cond.wait(lock) } while (wakeup==0); --waiting; --wakeup; } bool timed_wait(unique_lock<mutex>& lock, system_time const& abs_time) { ++waiting; bool res = true; while(wakeup==0 and res) { res = cond.timed_wait(lock, abs_time); } --waiting; if (res) --wakeup; return res; } private: condition_variable cond; int waiting; int wakeup; }; --->8--- Having the spurious wakeup problem handled by the library is a significant increase of comfort for both developers and maintainers. regards Alex

5 9

support for gcc hidden visibility in shared libraries
by Stjepan Rajko 06 Feb '09

06 Feb '09

Hello, Many (almost all?) linked boost libraries don't work as shared libraries when compiled with the -fvisibility=hidden switch on gcc version>=4. I am wondering whether there is interest in making them work under these circumstances, as it might not be too hard to do, and there seems to be some benefit to it. To my limited understanding, making a symbol visible in a shared library using, say, __attribute__ ((visibility("default"))) on gcc, is analogous to using __declspec(dllexport) on windows. Many boost libraries already use macros that apply __declspec(dllexport) on windows - so these macros could set to expand to __attribute__ ((visibility("default"))) on gcc. Even better, a boost-wide macro could be added to the config headers. More information on this can be found here: http://gcc.gnu.org/wiki/Visibility Just to note, I have very limited understanding of compiling/linking and I might not have a full grasp of everything involved here. Also, my only reason for thinking that -fvisibility=hidden should be supported is that for a long time now, I haven't been able to use boost shared libraries on my os x platform, and only now I realized that the reason for this is that I had stuck -fvisibility=hidden in my user-config.jam a long time ago to suppress some warnings. Nonetheless, it seems like there are benefits to supporting it that go beyond preventing people like me from accidentally shooting themselves in the foot. Kind regards, Stjepan

6 16

Boost Lambda Expressions Serialization
by Emad Soroush 06 Feb '09

06 Feb '09

Hello there, I am using boost lambda library to show some type of expressions. I am trying to send the lambda expression remotely. Is there anyway to serialized the boost lambda expression? I am aware of the Boost:Serialization library, but it doesn't seem be able to serialize expressions Thanks Emad

2 1

Coverity Static Code Analysis
by Michael Fawcett 05 Feb '09

05 Feb '09

Purely out of curiosity, how come Boost isn't at Rung 1 in the Coverity Scan Ladder? http://scan.coverity.com/ Boost and Boost.Build are both listed in Rung 0, so it appears that the only step left is selecting a Boost/Coverity liaison. http://scan.coverity.com/newproj.html --Michael Fawcett

14 25

[svn] sandbox access
by Kasra 05 Feb '09

05 Feb '09

Hi, I have requested a svn access to the sandbox for my crypto library. However, I haven't received my e-mail's reply yet. How long should I expect to wait?? With Best Regards Mr. Kasra Nassiri Department of Mathematics & Computer Science Imperial College London

1 0

[build] Using 'distcc' with bjam
by Dean Michael Berris 04 Feb '09

04 Feb '09

Hi Everyone, Has anybody tried using distcc instead of GCC with Boost.Build and Boost.Jam? Thanks in advance. -- Dean Michael C. Berris Software Engineer, Friendster, Inc.

2 1

[python] Expose a struct with a std::vector<std::string> member
by Tiago Coutinho 04 Feb '09

04 Feb '09

Hello all, I am new to boost::python. I have access to a C++ library which I want to expose to python using boost. One of the structs I want to expose is something like: #include <vector> struct ExampleStruct { std::vector<std::string> elements; }; I would like to expose this class but I like to avoid having to write a wrapper that would inefficiently have to copy the vector contents to a boost::python::list member. Is there a way to do this? Thank you very much in advance Cheers Tiago

2 4

[mpl]iter_fold_if use of apply1 instead of iter_apply1 maybe bug?
by Larry Evans 04 Feb '09

04 Feb '09

The following code line: https://svn.boost.org/trac/boost/browser/trunk/boost/mpl/iter_fold_if.hpp#L… shows apply1<Predicate,Iterator>; however, shouldn't this be iter_apply1<Predicate,Iterators> because, just from the name, Iterator is an iterator and needs to be deref'ed. Also, the previous line: not_< is_same<Iterator,LastIterator> > further suggests that Iterator is actually an iterator. I know it works presently; however, I really don't understand why.

2 1

Any real-world need for static_cast_iterator, const_cast_iterator, dynamic_cast_iterator?
by Nigel Stewart 04 Feb '09

04 Feb '09

In addition to the specialised adaptors in the boost iterator library, does it make any sense to add: static_cast_iterator const_cast_iterator dynamic_cast_iterator ...iterator adaptors providing embedded static_cast<>, const_cast<> or dynamic_cast<> when dereferencing? (Rather than just throwing them straight on the scrap heap...) - Nigel ---------------------------------------------- template<typename T, typename I> class static_cast_iterator : public boost::transform_iterator < T (*)(const typename I::reference), I > { private: typedef typename I::reference F; typedef typename boost::transform_iterator< T (*)(const F), I> B; public: static_cast_iterator() {} static_cast_iterator(const I &i) : B(i,&doCast) {} operator const I &() const { return B::base(); } static_cast_iterator &operator++() { B::operator++(); return *this; } static_cast_iterator &operator--() { B::operator--(); return *this; } private: static T doCast(const F val) { return static_cast<T>(val); } }; template<typename I> class const_cast_iterator : public boost::transform_iterator < typename boost::remove_const<typename I::reference>::type (*)(const typename I::reference), I > { private: typedef typename I::reference F; typedef typename boost::remove_const<F>::type T; typedef typename boost::transform_iterator< T (*)(const F), I> B; BOOST_STATIC_ASSERT(boost::is_const<F>::value); BOOST_STATIC_ASSERT(!boost::is_const<T>::value); public: const_cast_iterator() {} const_cast_iterator(const I &i) : B(i,&doCast) {} operator const I &() const { return B::base(); } const_cast_iterator &operator++() { B::operator++(); return *this; } const_cast_iterator &operator--() { B::operator--(); return *this; } private: static T doCast(const F val) { return const_cast<T>(val); } }; template<typename T, typename I> class dynamic_cast_iterator : public boost::transform_iterator < T (*)(const typename I::reference), I > { private: typedef typename I::reference F; typedef typename boost::transform_iterator< T (*)(const F), I> B; BOOST_STATIC_ASSERT(boost::is_pointer<F>::value || boost::is_reference<F>::value); BOOST_STATIC_ASSERT(boost::is_pointer<T>::value || boost::is_reference<T>::value); public: dynamic_cast_iterator() {} dynamic_cast_iterator(const I &i) : B(i,&doCast) {} operator const I &() const { return B::base(); } dynamic_cast_iterator &operator++() { B::operator++(); return *this; } dynamic_cast_iterator &operator--() { B::operator--(); return *this; } private: static T doCast(const F val) { return dynamic_cast<T>(val); } };

3 5

warnings from gcc-4.3.3 -Wall
by John Salmon 04 Feb '09

04 Feb '09

I recently upgraded to gcc/4.3 and started seeing warnings from gcc-4.3.3 -Wall suggesting parentheses around && within ||. It would be great if boost/1.38 could repair these by adding a few pairs of parentheses before the final release. N.B. I did not do an exhaustive compilation of everything in boost with gcc -Wall. The three cases below are the ones that my code base just happens to hit. Thanks, John Salmon /proj/desres/root/Linux/x86_64/boost/1_37_0-14/Release/include/boost/tuple/tuple_comparison.hpp:73: warning: suggest parentheses around && within || /proj/desres/root/Linux/x86_64/boost/1_37_0-14/Release/include/boost/iostreams/filter/symmetric.hpp:126: warning: suggest parentheses around && within || /proj/desres/root/Linux/x86_64/boost/1_37_0-14/Release/include/boost/iostreams/detail/streambuf/indirect_streambuf.hpp:285: warning: suggest parentheses around && within ||

2 1

[mpl] holder class for types with external linkage (similar to integral contants)
by klaus triendl 04 Feb '09

04 Feb '09

Recently, I've been in need of a holder class for strings with external linkage but I didn't find an mpl datatype that could wrap an externally defined entity. Instead of creating a quick solution working for my needs I thought the mpl library could benefit from a generic holder class similar to the integral constant holders. <code> template<typename T, T N> struct external_c { // make it a nullary metafunction typedef external_c type; typedef T value_type; // correct? requirements? typedef integral_c_tag tag; // can't make a static compile time constant but only a static // function static value_type value() { return N; } // implicitly convertible to its runtime type value operator value_type() const { return this->value(); } }; // e.g. extern const char string1[]; const char string1[] = "string1"; extern const std::string string2; const std::string string2("string2"); int main() { external_c<const char* const, string1> x1; external_c<const std::string&, string2> x2; std::cout << x1 << "\n"; std::cout << x2.value() << "\n"; return 0; } </code> The name 'external_c' is just a quick idea and would have to be changed anyway with c++09's possibility to use types with internal linkage in template programming. Would it be reasonable to integrate this into the mpl? Any comments? Klaus Triendl

1 0

[Serialization] Need help with binary archive deserialization error
by George van Venrooij 04 Feb '09

04 Feb '09

Hi, I just ran into an issue with serialization which is very peculiar. When serializing a complex class structure to an archive all goes well without errors. However, when trying to read back the data it works with all xml and text archive types, but when using binary archives I get an archive exception while loading. The exception occurs while loading an array of 3 doubles. From what I can make up out of the code, the archive says there are 20 bytes to load, while the library expects 24. Apparently I'm doing something that has no effect for text-based serialization, but does for binary. Since I didn't find any posts or tickets for this issue I assume I have made a mistake somewhere, only I have been looking for hours and cannot seem to find it. So any suggestions on where to look would be welcome, even the obvious ones ;-) Regards, George van Venrooij

4 4

[interprocess] Severe bug in sp_counted_impl.hpp!
by Lars Hagström 04 Feb '09

04 Feb '09

Hi, I believe that there is a bug in sp_counted_impl_pd::destroy(). Currently the method looks like this: void destroy() // nothrow { //Self destruction, so get a copy of the allocator //(in the future we could move it) this_allocator a_copy(*this); BOOST_ASSERT(a_copy == *this); this_pointer this_ptr (this); //Do it now! scoped_ptr<this_type, scoped_ptr_dealloc_functor<this_allocator> > (this_ptr, a_copy); typedef typename this_allocator::value_type value_type; detail::get_pointer(this_ptr)->~value_type(); } What I think is wrong is on the deallocator functor line. I believe that it should read scoped_ptr<this_type, scoped_ptr_dealloc_functor<this_allocator> > DEALLOCATOR(this_ptr, a_copy); The missing thing is the name for the scoped_ptr instance (the one I called DEALLOCATOR, to make it stand out). And since the name is missing it will become an anonymous instance, which will be destroyed *before* the destructor is called on this_ptr. The upshot is that with the bug we deallocate the memory and then call the destructor, rather than the opposite. If you're unlucky some other thread/process has allocated that memory for some other use, and you will then be running the destructor on that instead... I'm writing a ticket on this as well, just so it doesn't get overlooked. (If I'm wrong about all this my face will be red for a while...) Cheers Lars

4 6

boost serialization and alignment
by meir shoham 04 Feb '09

04 Feb '09

Hi, When I'm setting struct member alignment as 1 BYTE in visual studio 2005 project environment (C++), I receive alignment error coming from boost serialization library (STATIC_ASSERT) at compilation time. This problem does not happen when I wrap the structures containing the boost serialization template methods using #pragma pack(push,1) and #pragms pack(pop). I'm using boost only to serialize/deserialize strctures and classes to/from XML. Is there a problem for boost serialization library to handle alignment other then the default one? Thanks, Meir

1 0

Re: [boost] Coverity Static Code Analysis
by Michael Fawcett 03 Feb '09

03 Feb '09

On Tue, Feb 3, 2009 at 3:10 PM, Marshall Clow <marshall(a)idio.com> wrote: > > fixed, but I think that someone with a bit of legal training needs to look > at the license that Coverity wants people to agree to before using the scan > results. [ It looks pretty harmless to me, but IANAL ] > > <http://scan.coverity.com/policy.html#license> I agree. Doesn't Boost have access to just that sort of support? --Michael Fawcett

1 0

Interest in a library for building simulations of dynamical systems?
by Jay Graham 03 Feb '09

03 Feb '09

Is there interest in a library for building simulations of dynamical systems represented by time-based differential equations? The proposed library would implement ideas found in the C++ Model Developer (CMD) library developed by Ray Sells, but in a more generic way. For example, the proposed library would support the use of user defined data types when defining states and their derivatives. Other CMD features to be included in the proposed library are: 1. The ability to mix both continuous and discrete events. 2. Support for a simulation structure that makes it easy to go from a mathematical description of a system to code. 3. Support for time-varying system topologies (e.g., multi-stage missiles). 4. User extendable set of numerical integration algorithms. For more information on CMD see: http://www.dtic.mil/srch/doc?collection=t2&id=ADA433836 and http://rocket.itsc.uah.edu/u/education/files/R/IPT_Producer/AIAA/Sells/Sell… Code snippet: // Define states and their derivatives struct x_pos : state< double, // state type double // derivative type > {}; struct y_pos : state< double, double > {}; // Define a simulation object struct Ball: obj< rk4, // fourth-order Runge-Kutta numerical integration algorithm mpl::vector< x_pos, y_pos > // State vector > { Ball(double x, double y, double vx, double vy) { // Initial state s_<x_pos>().value = x; s_<y_pos>().value = y; this->vx = vx; this->vy = vy; // Integrators add_integrator<x_pos>(this->vx); add_integrator<y_pos>(this->vy); } template< typename S, typename C > inline void update(S &sim, C &clock) { // Update the derivatives vx = 0.8*vx; vy = 0.8*vy; // Use a discrete event to stop the simulation // after 10 seconds if (clock.event(10.0)) { sim.halt(); } } template< typename C > void report(C &clock) { // Report current state at 1 second intervals if (clock.sample(1.0)) { std::cout << "Ball" << clock.t << " " << s_<x_pos>().value << " " << s_<y_pos>().value << "\n"; } } double vx; double vy; }; // Define the integration time-step struct dts { typedef double time_type; static time_type value() { return 0.01; } }; // Define a simulation stage struct stage_1 : stage< dts, mpl::vector<Ball> > {}; main() { // Create a simulation object Ball ball(0.0, 0.0, 10.0, 5.0); // Create the simulation execution object sim< mpl::vector< stage_1 > > sim(); // Initialize the simulation stage sim.stage_<stage_1>().obj_<Ball>() = &ball; // Run the simulation run(sim); }

7 7

[parallel_sort] Proposal
by Edouard A. 03 Feb '09

03 Feb '09

Howdy, I just finished the first working version of parallel_sort. It seems there is a lot of interest for this function in the C++ community, and in the boost community specifically, which is the motivation for this post. ;) My implementation is somewhat very different in nature from the one present in Intel's TBB. It's designed to take advantages of a multi-core user machine, it's not designed to run on a grid for massive sorting operation. It only uses the STL and the boost library. It doesn't have any fancy prerequisites, except having several cores to unleash its power! Current benchmarks on my Q6600 vs2008-64-bit default allocator: 2 threads : 160 % faster 4 threads : 260 % faster Keep in mind the Q6600 is not a real equivalent to a quad-cpu machine and that the default memory allocator is not multithreading friendly. It can be heavily customized. I already offer the possibility to choose between quick sorting and merge sorting, and for quick sorting I offer two pivot algorithms : fast or secure. Then you can of course specify a predicate and a fallback sorting algorithm for when you run out of threads. If you don't care to customize, no problem! Just write: parallel_sort<2>(v.begin(), v.end()); // sort with 2 threads There is still some work to be done, especially in the documentation area. Nevertheless, I think it's time to open up the code and start getting feedback. J As an added bonus I also offer to add my implementation of the smoothsort algorithm (with some hints from Steven). This algorithm is faster on sorted input but slower on random input. Cheers -- EA

6 20

SCons script for building Boost
by Sergey Popov 03 Feb '09

03 Feb '09

I've searched the ML archive and found out that scons wasn't considered for adoption because nobody offered to reimplement boost build instructions in terms of SCons. I'd like to work on this. Is there a chance I'll be given commit access so I could make a boost-SCons branch? ;) I've attached my early WIP build script to this posting.

4 4

Re: [boost] Review process question
by Christophe Henry 03 Feb '09

03 Feb '09

"John Maddock" schrieb im Newsbeitrag news:<343DA106BE604F22B7EF1BFF0A8515B8@acerlaptop>... > >> It is enough to specify which revision that is to be reviewed. > > > > Is it possible to change it after the submission request? It would allow > > me > > to make some bugfixes (if necessary) while being in the queue. > > I think bugfixes at that stage are fine: as long as there is a stable > version available somewhere, and as long as all the reviewers are refering > to the same version during the review - in other words try and keep things > stable during the review itself. > > HTH, John. > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > I think I got it now. Thanks! Christophe

1 0

[typeof] BOOST_AUTO and move semantic emulation
by vicente.botet 03 Feb '09

03 Feb '09

Hi, given T&& f(); which is the type of v in auto v = f(); Is there any plan to adapt Boost.Typeof with move semantics, so the following works? BOOST_TYPEOF_REGISTER_TEMPLATE(boost::detail::thread_move_t, 1) BOOST_TYPEOF_REGISTER(T) boost::detail::thread_move_t<T> f(); BOOST_AUTO(v, f()); Thanks, Vicente

1 0

[1.38][flyweight] permission to merge to release
by JOAQUIN M. LOPEZ MUÑOZ 02 Feb '09

02 Feb '09

Hi, I've just commited the following trivial fix to the trunk: https://svn.boost.org/trac/boost/changeset/50974 which only adds a missing std:: to a call to strcpy. The fix hasn't still cycled trough the trunk regression testers, but I've tested it locally with MSVC++ 8.0 and GCC 3.4.4 and everything's fine. Can I merge to release now? Do I wait for a trunk test cycle? No permission at all? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[LibrariesUnderConstruction] Thanks!
by Christophe Henry 02 Feb '09

02 Feb '09

Hi, I realized this morning that I didn't add Msm to the LibrariesUnderConstruction Wiki page. And what do I see? Already done! And with description and link to the Vault! I have no idea who did it, but I want to thank him! And offer him a bottle of Bordeaux wine (if I manage to pass it through the customs ;-) ) at the next occasion (Aspen?). Thanks a lot, Christophe

3 4

[accumulators] why not operator+=?
by Neal Becker 02 Feb '09

02 Feb '09

A nit perhaps, but why not overload += to process samples?

6 8

What happens when a Boost library is unmaintained?
by Peter Simons 02 Feb '09

02 Feb '09

Hi, suppose that an accepted and officially distributed Boost library has become unmaintained, meaning that a) the code is not developed any further, b) reported bugs are not fixed, confirmed, or otherwise responded to, and c) questions on the mailing list aren't answered, then what is the procedure to deal with that situation? Take care, Peter

4 3

Boost::Graph --- why does this program not compile?
by Oliver Kullmann 02 Feb '09

02 Feb '09

Hello, in parallel to trying to get 1_34_1 compiling again, I'll also try to understand why the code won't compile with 1_37_0. Now I found the following program which actually compiles neither with 1_34_1 nor with 1_37_0, but it should: ------------------- #include <utility> #include <vector> #include <boost/graph/adjacency_list.hpp> template <class Graph> inline Graph orthogonality_relation() { typedef std::pair<unsigned int, unsigned int> edge_type; std::vector<edge_type> ev; Graph g(ev.begin(), ev.end(), 0, 0); return g; } typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS> UndirectedGraph; int main () { orthogonality_relation<UndirectedGraph>(); } ------------------- The abbreviated error-message from gcc (version 4.1.2) is: Error.cpp:17: instantiated from here Boost/1_37_0+4.1.2/include/boost-1_37_0/boost/graph/detail/adjacency_list.hpp:2113: error: invalid type argument of ‘unary *’ where line 17 is the last line of the main-function. Oliver

3 7

Re: [boost] Review process question
by Christophe Henry 02 Feb '09

02 Feb '09

> It is enough to specify which revision that is to be reviewed. Is it possible to change it after the submission request? It would allow me to make some bugfixes (if necessary) while being in the queue.

2 1

Review process question
by Christophe Henry 02 Feb '09

02 Feb '09

Hi, I just read the submission process page and being a bit new to this, I have some questions. The page states that all the files making up a library should be compressed into a zip file and posted in the Vault upon submission. - Wouldn't it be better to use the Sandbox for this? After all, this seems to be quite the goal of SVN. It would also allow bugfixes who might appear between submission and review. This leads us to the next question. - Does it mean that while the library is in the review queue, it cannot be changed? I understand this is a long process and it would be nice to correct problems which might appear during this time. It would be also sad to stop development too early. Sorry if I ask stuff which is already broadly known. Christophe

3 2

Re: [boost] [LibrariesUnderConstruction] Thanks!
by Christophe Henry 01 Feb '09

01 Feb '09

Hi Vicente, Then you are the winner of a bottle of wine. And no I will definitely not forget :) Thank you again, it was very nice from you to even look into the Msm documentation to add a description! BTW, this wiki page is very useful, great idea! Christophe

1 0

Forwarded Message: tokenizer feature request
by Kasra 01 Feb '09

01 Feb '09

Hi, what sort of hash function are you requesting? -- Kasra

1 0

test--please ignore
by Sean Farrow 01 Feb '09

01 Feb '09

1 0

tokenizer feature request
by Sean Farrow 01 Feb '09

01 Feb '09

Hi: I would like to request a hash function for tokenizer be implemented. I'm not sure how doable this is, but need to use this for a project I'm involved in. Cheers Sean.

1 0

Interest check: memoization
by James Porter 01 Feb '09

01 Feb '09

After hacking around with some simple dynamic programming, it occurred to me that it should be possible to write a simple class template to handle memoization of functions. With the changes in C++0x that help solve the forwarding problem, writing a generic memoizer should be fairly straightforward. (Or so I thought!) The interface is straightforward, so I'll let the following code snippet speak for itself: memoizer<int (int,int)> memo(my_func); int ret = memo(i,j); As you'd expect, this creates a memoizer that caches results of calls to my_func. Pretty simple, right? Well, not exactly. :) (If you'd rather not read about the implementation, you can skip ahead to the end, where there is a link to download the source.) There are a number of issues that make this a fairly complicated problem, even with the improved generic programming facilities in C++0x. Chief among these is copying. With the naive implementation of the memoizer, I found that calculating the result of an unmemoized value created 3 copies (one for creating a tuple to search a map for, and two to insert the tuple into the map), and returning a memoized value created 1 copy (to create a tuple to search the map). To make a long story short, I set about trying to reduce the number of copies to the expected amount: 1 copy for unmemoized values and 0 for memoized values. I'm happy to say that this was a success! The trick was creating a tuple that holds references to each argument and can be upgraded to hold the arguments by value. In this way, we can compare by reference and store by value. This is simple on the surface, but requires some care when dealing with rvalue references. There are also issues with passing convertible types to the memoizer (e.g. passing floats when the function expects ints). For complicated types, you certainly wouldn't want to copy them more than once, and you'd want to use move constructors where possible. This is resolved with some creative manipulation of template types (lines 52-58 of memoizer.hpp). There are still a number of things missing in this code, such as the ability to use function objects with the memoizer, or the ability to specify the map type, but I believe that the most important issues are resolved: * Minimizes copying of arguments * Supports move constructors wherever possible * Safely converts arguments to the appropriate types The full source code for this is available here (requires gcc 4.3 or a compiler that supports variadic templates and rvalue refs): http://www.teamboxel.com/misc/memoizer.tar.gz Comments and criticisms are welcome. If there's interest, I will - of course - work on a version that supports the current C++ standard. - Jim

5 21

Numeric constants
by John Maddock 01 Feb '09

01 Feb '09

Folks, someone's just filed a feature request asking for more numeric constants to be added to Boost.Math (these are currently an implementation detail, albeit a semi-documented one: http://www.boost.org/doc/libs/1_37_0/libs/math/doc/sf_and_dist/html/math_to…) but we know what troubles we had agreeing on anything last time this came up for review! Even so it appears to be time to fearlessly open up this particular can of worms again ;-) So, it appears that there is still interest, but as you know last time we tried this there was no agreement on interface, some folks felt a template interface was essential: template <class T> T pi(); leading to: template <class T> T circumference(T r) { return 2 * boost::math::constants::pi<T>() * r; } While others were absolutely adament that they wouldn't use a syntax other than: template <class T> T circumference(T r) { return 2 * pi * r; } Various attempts were made to solve this conundrum via expression templates and/or overloaded operators, but all introduced their own new issues as well, and IMO none were wholly satisfactory (not least due to the complexity introduced, a complexity that becomes all too apparent to the user if they do get a compiler error due to an unsupported use case). So.... here's what I think Paul Bristow and I might be persuaded to submit: * A library based on the existing Boost.Math code, with pi<T>() as the main interface / use case. * Possibly add constants of specific precision in alternative namespaces, so we could have: double circumference(double r) { using namspace boost::math::double_constants; return 2 * pi * r; } And that's pretty much it: no overly complex stuff, just a really simple library with a few constants in it, that makes it really easy to add new constants when required. Thoughts? Regards, John.

11 27