- Boost - lists.boost.org

can't use replace_all under solaris
by Amr Shahin 17 Dec '07

17 Dec '07

hello im trying to use the replace_all function defined in boost/algorithm/string.hpp header, but when i try to compile it under solaris, i get following error: "/usr/include/boost/algorithm/string/detail/sequence.hpp", line 34: Error: Could not find a match for std::string::insert(char*, std::deque<char>::iterator, std::deque<char>::iterator) needed in boost::algorithm::detail::insert<std::string, std::deque<char>::iterator>(std::string &, char*, std::deque<char>::iterator, std::deque<char>::iterator) this is the source code: #include<cstring> #include<iostream> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main( ) { string s = "Amr Yassir Shahin"; replace_all( s , "Yassir" , "Adel" ); cout << "s now: " << s << endl; return 0; } and this is the command i use to compile g++ file.cpp my machine is : SunOS suntest 5.9 Generic_118558-26 sun4u sparc SUNW,Sun-Fire-V240 anyone can help ?

1 0

[iterator, test] Patches for PA_RISC HP-UX 11.11 compatibility
by Jurko Gospodnetić 17 Dec '07

17 Dec '07

[I am repeating this post as no one replied to it and I guess it could have gotten overlooked in the original thread.] Hi. I'm attaching two patches - one for the Boost test and one for the Boost iterator library to make them compatible with HP-UX PA_RISC 11.11 system headers. These headers define global preprocessor macros R1, R2, ... so the patches rename similarly named identifiers in Boost code. Patches have been prepared based on SVN revision 41987. They are simple local variable and template parameter renames which should not cause any problems. New names are a bit more verbose to eliminate possible conflicts with headers on other system. Could someone please apply them? And could they be applied to the 1.35 branch as well? These patches in additional to two slight tweaks inside Boost ASIO will allow Boost ASIO to compile and pass all tests on this platform. Hope this helps. Best regards, Jurko Gospodnetić --- C:\Documents and Settings\Jurko\Desktop\SVN_41987\boost\iterator\iterator_facade.hpp 2007-12-12 11:50:30.000000000 +-0100 +++ C:\Documents and Settings\Jurko\Desktop\Modified\boost\iterator\iterator_facade.hpp 2007-12-12 12:13:51.000000000 +-0100 @@ -428,34 +428,34 @@ }; } // namespace detail // Macros which describe the declarations of binary operators # ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY -# define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ - template < \ - class Derived1, class V1, class TC1, class R1, class D1 \ - , class Derived2, class V2, class TC2, class R2, class D2 \ - > \ - prefix typename mpl::apply2<result_type,Derived1,Derived2>::type \ - operator op( \ - iterator_facade<Derived1, V1, TC1, R1, D1> const& lhs \ - , iterator_facade<Derived2, V2, TC2, R2, D2> const& rhs) +# define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ + template < \ + class Derived1, class V1, class TC1, class Reference1, class Difference1 \ + , class Derived2, class V2, class TC2, class Reference2, class Difference2 \ + > \ + prefix typename mpl::apply2<result_type,Derived1,Derived2>::type \ + operator op( \ + iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs \ + , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs) # else -# define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ - template < \ - class Derived1, class V1, class TC1, class R1, class D1 \ - , class Derived2, class V2, class TC2, class R2, class D2 \ - > \ - prefix typename boost::detail::enable_if_interoperable< \ - Derived1, Derived2 \ - , typename mpl::apply2<result_type,Derived1,Derived2>::type \ - >::type \ - operator op( \ - iterator_facade<Derived1, V1, TC1, R1, D1> const& lhs \ - , iterator_facade<Derived2, V2, TC2, R2, D2> const& rhs) +# define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ + template < \ + class Derived1, class V1, class TC1, class Reference1, class Difference1 \ + , class Derived2, class V2, class TC2, class Reference2, class Difference2 \ + > \ + prefix typename boost::detail::enable_if_interoperable< \ + Derived1, Derived2 \ + , typename mpl::apply2<result_type,Derived1,Derived2>::type \ + >::type \ + operator op( \ + iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs \ + , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs) # endif # define BOOST_ITERATOR_FACADE_PLUS_HEAD(prefix,args) \ template <class Derived, class V, class TC, class R, class D> \ prefix Derived operator+ args --- C:\Documents and Settings\Jurko\Desktop\SVN_41987\boost\test\test_tools.hpp 2007-12-12 11:49:19.000000000 +-0100 +++ C:\Documents and Settings\Jurko\Desktop\Modified\boost\test\test_tools.hpp 2007-12-12 12:27:50.000000000 +-0100 @@ -643,24 +643,24 @@ //____________________________________________________________________________// template <class Left, class Right> inline predicate_result bitwise_equal_impl( Left const& left, Right const& right ) { - predicate_result res( true ); + predicate_result res( true ); std::size_t left_bit_size = sizeof(Left)*CHAR_BIT; std::size_t right_bit_size = sizeof(Right)*CHAR_BIT; - static Left const L1( 1 ); - static Right const R1( 1 ); + static Left const leftOne ( 1 ); + static Right const rightOne( 1 ); std::size_t total_bits = left_bit_size < right_bit_size ? left_bit_size : right_bit_size; for( std::size_t counter = 0; counter < total_bits; ++counter ) { - if( ( left & ( L1 << counter ) ) != ( right & ( R1 << counter ) ) ) { + if( ( left & ( leftOne << counter ) ) != ( right & ( rightOne << counter ) ) ) { res = false; res.message() << "\nMismatch in a position " << counter; } } if( left_bit_size != right_bit_size ) {

4 12

[functional/forward]howto do Abraham's new_ attached to review post
by Larry Evans 17 Dec '07

17 Dec '07

I've been trying, unsuccessfully, to use the forward library to do what the template<class T> inline std::auto_ptr<T> new_ (/*variadic number args passed to T CTOR/*) function shown in the attachment to: http://lists.boost.org/Archives/boost/2007/12/131251.php However, so far all I've got is shown in the attachment. But that's not what, AFAICT, Abraham's new_does. Could someone show me how to do Abraham's new with functional/forward?

1 2

[patch] mersenne_twister serialization
by Neal Becker 17 Dec '07

17 Dec '07

This is an improved patch for mt serialization, using the serialization collection stuff

1 0

Trac open bug summary mailings missing new tickets
by David Abrahams 17 Dec '07

17 Dec '07

http://svn.boost.org/trac/boost/report/9 shows that although I have accepted 9 tickets, my libraries have many more open tickets than that against them. I think the total number is more interesting than the number I've actually accepted. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

2 1

[iterator] lvalue-ness resurrection in transform_iterator?
by shunsuke 17 Dec '07

17 Dec '07

Hi, Assume a base iterator is an InputIterator with RandomAccessTraversalTag. boost::make_zip_iterator often returns such iterators. boost::transform_iterator sometimes resurrects lvalue-ness of its base iterator. For example, char & to_lvalue(boost::tuple<char &, int &> const &t) { return boost::get<0>(t); } can return a lvalue from zip_iterator dereference. Therefore, if boost::transform_iterator extracts "pure" traversal tag from its base iterator, it can be not an InputIterator but a RandomAccessIterator. The patch will be something like this: template <class UnaryFunc, class Iterator, class Reference, class Value> struct transform_iterator_base { // ... typedef iterator_adaptor< transform_iterator<UnaryFunc, Iterator, Reference, Value> , Iterator , cv_value_type - , use_default // Leave the traversal category alone + , typename pure_traversal_tag<typename iterator_traversal<Iterator>::type>::type , reference > type; }; } Is there any pitfalls? Regards, -- Shunsuke Sogame

2 5

[Announce] Boost Testing Integrated with Trac
by David Abrahams 16 Dec '07

16 Dec '07

Pursuant to the conclusions of http://lists.boost.org/Archives/boost/2007/08/125724.php that our reporting system ought to be integrated with Trac, Daniel Wallin and I have installed a modified Bitten plugin (http://bitten.edgewall.org/) on the boost-consulting Trac server. We are using it with a few slave machines to test (a mirror of) the Boost subversion repository. You can see the results at: https://boost-consulting.com/trac/projects/boost/build https://boost-consulting.com/trac/projects/boost/build/trunk https://boost-consulting.com/trac/projects/boost/build?view=inprogress and by following the obvious links on those pages. Some features (I'm probably forgetting something; please poke around and see what you can discover): * runs tests for each atomic Boost checkin. * slaves can run incremental or from-scratch tests * failure markup is processed very quickly in Python on the machine doing the testing and used to alter the effect of failures, with no horrendous and time-consuming XSLT step * no tests are run for libraries that are marked unusable on a given os/compiler * no unreliable jam log processing is involved: Boost.Build is directly generating XML which is processed by python and shipped up to the Trac server * only failed tests that aren't marked up are shown in most views * a record of each build run is kept in the Trac server's database * reorganizing the system so that several machines can contribute to a single test run with a given OS/toolset is fairly straightforward. There are obviously a few rough edges and things we could do better in the UI, but I really believe this overall approach is a winner. Daniel and I are fairly competent Trac and Bitten hackers, so we should be able to make this system do whatever Boost needs, feed back the improvements to the Bitten community, and leave us with a maintainable codebase that isn't permanently tied to one or two people. It's time to open a discussion of exactly how the system should evolve, what features we want to see in the UI, etc. I hope those of you with an interest in the quality of Boost testing tools will join us on the boost-testing list to discuss this project's future. If anyone wants to run an additional testing slave, please let me know; once you have Python on your system, it's extremely easy to set up. Regards, Dave Postscript: Quick Overview of Bitten for Boost people ===================================================== Bitten is a continuous integration system that's integrated with Trac. Testing machines (called "slaves") run a Python script (part of the Bitten distribution) that checks periodically with the server to see if anything needs to be tested. The server manages a set of testing "recipes," each of which is associated with a directory in the subversion repository and a set of slave criteria (such as "are you running Linux?"). If a recipe has criteria matching the inquiring slave and there have been changes in the associated part of the repository, the slave executes the recipe. A recipe is divided into a series of "steps," each of which is composed of commands (http://bitten.edgewall.org/wiki/Documentation/commands.html) Slaves report back to the server as they execute each step, so the server can tell you about the progress of each slave. If any step fails, the build fails and the slave stops. Recipes are expressed in XML and stored in the server's Trac database. Trac users with the right privileges can create, edit, and delete recipes. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

3 4

[vault] Suspicious file: madshell.phtml
by Peter Dimov 16 Dec '07

16 Dec '07

There's a file called 'madshell.phtml' in the Vault that is probably an exploit. I see a few other .phtml's as well. -- Peter Dimov http://www.pdimov.com

2 1

Suggestion to lexical_cast library
by Márcio Gil 16 Dec '07

16 Dec '07

Hello, I suggest this add on lexical_cast library: a lexical_cast_def function, which work's like the AnsiString's ToIntDef method (from Borland VCL). Reason: the use of a lexical_cast without a try ... catch block, if the source is not guaranteed to be safe. Example: string source; int x = lexical_cast_def<int>( source, 0 ); In opposite of: string source; int x; try { x = lexical_cast<int>( source ); } catch(...) { x = 0; } Soon I can write this function in my project: template<typename Target, typename Source> Target lexical_cast_def(Source arg, Target def) { Target result; try { result = lexical_cast<Target>(Source); } catch (..) { result = def; } return result; } Otherwise we can post in the library this simplest and fastest function: template<typename Target, typename Source> Target lexical_cast_def(Source arg, Target def) { detail::lexical_stream<Target, Source> interpreter; Target result; if(!(interpreter << arg && interpreter >> result)) return def; return result; } And the call-by-const reference version. Thanks, Marcio Gil. P.S.: This is my first post in this list, soon excuse my bad English, I don't speak English, is that used only for reading.

2 1

[spirit] Causes a blizzard of warning from Boost.Format under MSVC?
by John Maddock 15 Dec '07

15 Dec '07

I'm at a loss to explain this, but this program: #include <boost/math/special_functions.hpp> int main() { boost::math::erf(2); } Compiles cleaning with MSVC-8, but as soon as I add a particular spirit #include: #include <boost/math/special_functions.hpp> #include <boost/spirit/utility/distinct.hpp> int main() { boost::math::erf(2); } Then Boost.Format (used internally be Boost.Math for error message formatting) issues a whole blizzard of warnings, that I actually thought I had fixed. I've checked Spirit for mismatched #pragma push/pop declarations, but they all look OK to me. Does anyone have any ideas what may be going on here, 'cos I'm stumped and the warnings are really very annoying! Many thanks, John.

4 9