- Boost - lists.boost.org

[1.38.0] branches/release frozen
by Beman Dawes 08 Feb '09

08 Feb '09

I plan to do the actual release Sunday. Please make no further commits to branches/release. If there are any known showstoppers, please let me know right away. Thanks, --Beman

6 12

[statechart] rebind -> exception_translator error
by k-oli＠gmx.de 08 Feb '09

08 Feb '09

Hello, I get following compile time error (using gcc version 4.3.1 on Debian/Lenny) for a test async_state_machine: /opt/boost/include/boost-1_37/boost/detail/allocator_utilities.hpp:149: error: no class template named 'rebind' in 'class boost::statechart::exception_translator<boost::statechart::exception_thrown>' regards, Oliver

2 1

build system testing
by Neil Groves 08 Feb '09

08 Feb '09

Hello, I have noticed that work is going ahead to introduce CMake, and possibly SCons build systems alongside bjam. Does this not introduce an explosion in required testing combinations, and is this already being addressed? I fully appreciate the attraction of adding CMake, but would like to ensure we do not add too many build systems due to the potentially excessive requirement on library developer to install a plethora of tools, and perform an enormous amount of testing. I wonder if a static analysis tool might be able to help determine the consistency of bjam to the other build systems. Anyhow, I haven't seen much discussion about testing, and if it's not tested it's probably broken! (At least if I've written it!) Regards, Neil Groves

4 3

[random] Patch for ticket 2703
by Steven Watanabe 08 Feb '09

08 Feb '09

AMDG In lagged_fibonacci_01, the overload of seed that takes a pair of iterators does not always detect the end of the range correctly. The attached patch fixes this and adds a test case. Ok to commit? In Christ, Steven Watanabe

2 1

[format] please add operator String()
by Thorsten Ottosen 08 Feb '09

08 Feb '09

Hi, In code like this: std::string columns() const { return (boost::format("%7s, %7s, %7s, %7s") % "testCost" % "optimalEcr" % "efficiecyEcr" % "testCostEcr").str(); } it is very annoying to have to put () around the whole expression and then call .str() (Just imagine that we are creating a string on the fly to a function). Therefore I suggest that we add operator string_type() const { return str(); } to the interface of basic_format<>. Any comments? -Thorsten

7 8

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

07 Feb '09

> These seem like reasonable requests, although I'd have to check the > std::back_inserter to be 100% sure. > I have checked this using a wrapper around path as follows template<class String, class Traits> struct rob_basicpath : boost::filesystem::basic_path<String, Traits> { typedef string_type& reference; typedef const string_type& const_reference; inline void push_back(const_reference path) { *this /= path; } }; This allowed me to use the following code as expected (which strips . characters from the path) const boost::filesystem::path path("dir1/./dir2/./dir3"); rob_path rpath; std::remove_copy(path.begin(), path.end(), std::back_inserter(rpath), "."); > Note however that path has some but not all of the characteristics of > a standard container. I'd want to see persuasive use cases for adding > functionality - just making path more like a std container without > good reason is likely to lead to interface bloat without offsetting > benefits. My reasoning for this is as follows: 1. path is wrapper around a string, which is what would be used in the absence of path object. String supports this interface and using path should not be a step backwards. 2. A variety of tasks I envisage on a path can be neatly and succinctly implemented using std algorithms. In particular, I have several uses for copy or remove_copy to create similar paths with a slight difference. The ability to use a back_inserter allow paths to be built up from other paths or any container of strings. Without this, my solution for removing '.' involved the same code but I had to insert into a vector first and later iterate through this to create the new path. > A use case would make this [pop_back()] more compelling. My code above to remove '.' was part of a 'canonicalize' function which removed both '.' and '..' where possible. (This may be a candidate for a convenience function within the library?) My solution was as follows std::vector<std::wstring> parts; BOOST_FOREACH(std::wstring part, path) { if (L"." == part) continue; if (L".." == part && parts.size() && L".." != parts.back()) parts.pop_back(); else parts.push_back(part); } boost::filesystem::wpath simple; BOOST_FOREACH(std::wstring part, parts) simple /= part; return simple; Whilst this is IMO reasonably elegant, I still have the extra step of building my new path in a vector, then creating the path from this. The addition of pop_back() to path would allow the path to be built up without the vector. Given that path allows the path to be considered as a container of path elements, I would like to see this extended. A reverse iterator would be nice to step back from the given path up to the root. Pop_back would equate to stepping back to the parent directory and seems a useful feature. Given that there exists a function to remove the filename, this also seems to be relatively easy to implement (as an inlined function?) I have only recently discovered filesystem::path and, given my current project's requirements for directory manipulation, this is a fantastic help. Cheers Rob

5 5

[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