November 2006 - Boost - lists.preview.boost.org

Serialization fails to build with BBv2 and borland 5.8.2
by Nicola Musatti 17 Nov '06

17 Nov '06

Hallo, I just built a snapshot of the RC_1_34_0 branch with BBv2 and Borland's 5.8.2 compiler. Things appear to work as they used to with BBv1, except for the Serialization library, which fails to build. This appears to be due to the fact that the machinery which recognized the need for including an external version of Spirit seems not to have been ported to BBv2. However I'm a bit puzzled because if this is the case how can the regression tests run without problems? Cheers, Nicola Musatti

1 0

Re: [boost] Asio multithreaded server
by Christopher Kohlhoff 17 Nov '06

17 Nov '06

Hi Giovanni, Giovanni Piero Deretta <gpderetta(a)gmail.com> wrote: > I'm curious and interested. I don't have time right now to expand on it in great detail (hopefully later), but here's the problem in a nutshell. First, use the very latest asio in boost CVS, with the following diff applied (to undo my workaround): --- boost/asio/detail/win_iocp_io_service.hpp 17 Nov 2006 11:40:48 -0000 1.6 +++ boost/asio/detail/win_iocp_io_service.hpp 17 Nov 2006 12:45:01 -0000 @@ -260,7 +260,7 @@ LPOVERLAPPED overlapped = 0; ::SetLastError(0); BOOL ok = ::GetQueuedCompletionStatus(iocp_.handle, &bytes_transferred, - &completion_key, &overlapped, block ? 1000 : 0); + &completion_key, &overlapped, block ? INFINITE : 0); DWORD last_error = ::GetLastError(); if (!ok && overlapped == 0) And here's a simplified test program: //-------------------------------------------------------------------- #include <boost/asio.hpp> #include <boost/bind.hpp> #include <boost/thread.hpp> #include <iostream> #include <ostream> #include <windows.h> void handle_read() { while (true) ; } void handle_accept_2nd() { std::cout << "handle_accept_2nd\n"; } void handle_accept_1st( boost::asio::ip::tcp::socket* socket1, boost::asio::ip::tcp::acceptor* acceptor, boost::asio::ip::tcp::socket* socket2) { std::cout << "handle_accept_1st\n"; static char buffer[1024]; socket1->async_read_some( boost::asio::buffer(buffer), boost::bind(handle_read)); acceptor->async_accept(*socket2, boost::bind(handle_accept_2nd)); } void do_nothing() { } void post_nothing(boost::asio::io_service* io_service) { for (;;) { ::Sleep(10000); io_service->post(do_nothing); } } int main() { try { boost::asio::io_service io_service; boost::asio::ip::tcp::endpoint endpoint( boost::asio::ip::tcp::v4(), 0); boost::asio::ip::tcp::acceptor acceptor( io_service, endpoint); std::cout << "Listening on "; std::cout << acceptor.local_endpoint(); std::cout << "\n"; boost::asio::ip::tcp::socket socket1(io_service); boost::asio::ip::tcp::socket socket2(io_service); acceptor.async_accept(socket1, boost::bind(handle_accept_1st, &socket1, &acceptor, &socket2)); boost::thread run_thread1( boost::bind(&boost::asio::io_service::run, &io_service)); boost::thread run_thread2( boost::bind(&boost::asio::io_service::run, &io_service)); //boost::thread post_nothing_thread( // boost::bind(post_nothing, &io_service)); run_thread1.join(); run_thread2.join(); //post_nothing_thread.join(); } catch (std::exception& e) { std::cout << "Exception: " << e.what() << "\n"; } return 0; } //-------------------------------------------------------------------- I ran the test on a uniprocessor system with Windows XP SP 2, using the following steps: - Run the server - Use telnet to connect one client - Observe "handle_accept_1st" in server output - Type one character into telnet - Observe that CPU usage is now 100% - Start a second telnet to connect another client - The "handle_accept_2nd" never happens Now uncomment the lines to start the post_nothing thread and run the test again. This time you should see the "handle_accept_2nd" message (probably after a delay). What seems to be happening is that the completion event for an asynchronous operation is "queued" to the thread that started the operation (i.e. the one that called AcceptEx in this case). If that thread is busy (the infinite loop in handle_read) then the completion event is never delivered, even if another thread is blocked on GetQueuedCompletionStatus. However, if you wake up the second thread using a timeout (which is my workaround) or by using PostQueuedCompletionStatus (which happens when you uncomment the post_nothing thread) then the second thread picks up the accept completion event off the queue and delivers it. (Note 1: I came to the conclusion about a completion event being queued to the thread that started the operation by observing the behaviour of a more complex test program than the one above.) (Note 2: The I/O completion port is being created with NumberOfConcurrentThreads set to 0xFFFFFFFF, which means that it allows multiple active threads. A simple test using a thread pool calling io_service::run(), and posting multiple CPU bound tasks into it confirms that this is working correctly.) (Note 3: The handle_read function runs on the same thread as handle_accept_1st because I/O completion ports use LIFO for choosing the thread to run an available completion event.) Cheers, Chris

1 0

Re: [boost] Asio multithreaded server
by Christopher Kohlhoff 17 Nov '06

17 Nov '06

berserker_r <berserker_r(a)hotmail.com> wrote: > I have tried the patch but with no success...do I need any > change to server.cpp file in order to make it works? Do I > need a per session io_service? No, don't. That approach has very poor scalability. I spent some time investigating this today and it smells a lot like a bug in the way Windows implements I/O completion ports. I can go into more detail if anybody's actually interested, but in any case I will be constructing a small test case in order to report the problem. I have just committed a workaround into CVS that should fix the problem you are seeing. If you can use the latest version from CVS please do, otherwise let me know what version you are using and i'll see if I can give you a patch to try. Cheers, Chris

3 2

Re: [boost] Asio multithreaded server
by Christopher Kohlhoff 17 Nov '06

17 Nov '06

berserker_r <berserker_r(a)hotmail.com> wrote: > I'm using 0.3.7 with boost 1.33.1. Try this change to win_iocp_io_service.hpp in addition to the previous patch: @@ -125,10 +125,13 @@ #endif LPOVERLAPPED overlapped = 0; ::SetLastError(0); - ::GetQueuedCompletionStatus(iocp_.handle, &bytes_transferred, - &completion_key, &overlapped, INFINITE); + BOOL ok = ::GetQueuedCompletionStatus(iocp_.handle, + &bytes_transferred, &completion_key, &overlapped, 1000); DWORD last_error = ::GetLastError(); + if (!ok && overlapped == 0 && last_error == WAIT_TIMEOUT) + continue; + if (overlapped) { // We may have been passed a last_error value in the completion_key. Note that I haven't tested that it even compiles. Cheers, Chris

1 0

Re: [boost] Asio multithreaded http server
by berserker_r 17 Nov '06

17 Nov '06

Pedro Lamarão wrote: > You can rework your read handler to do all I/O necessary, and to submit > the obtained data to a work queue somewhere else. > Another thread would then dispatch work items from this work queue to > worker threads. > After the work is finished, the item would be moved to an exit queue, > with a response for the peer, or something. I tried to process the read handler operation in an another thread but any other operation (for example accepting new connections in the server) is still locked until the session's work is done... Can you snip a sample based on http://asio.cvs.sourceforge.net/asio/asio/src/tests/performance/server.cpp?… I'm missing something...I have also tried the patch that Chris has suggested but with no success... Thanks

1 0

[Boost-bugs] [ boost-Bugs-1598153 ] top-level configure is broken
by SourceForge.net 17 Nov '06

17 Nov '06

Bugs item #1598153, was opened at 2006-11-16 20:53 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1598153&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: build Group: release 1.34.0 Status: Open Resolution: None Priority: 5 Private: No Submitted By: eponym (eponym) Assigned to: Nobody/Anonymous (nobody) Summary: top-level configure is broken Initial Comment: The top-level configure script in the RC1.34.0 release is broken. This script starts out as: #!/bin/sh which implies that it is a Bourne-shell script. But now almost all of tests in the file have been converted to look like the following: 220 if test "x$LIBDIR" == x; then 221 LIBDIR="$EPREFIX/lib" 222 fi where (in 1.33.1) they used to look like this: 217 if test "x$LIBDIR" = "x" ; then 218 LIBDIR="$EPREFIX/lib" 219 fi The problem is that "==" is not a valid Bourne-shell test-command operator, so the entire build breaks immediately on any platform which uses a true Bourne shell as sh. The fix is to either convert all of these operators to "=", or to stop claiming the script is a Bourne shell script and use "#!/bin/bash" instead. But the latter approach is not recommended because there are many older machines without bash in that location. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1598153&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys - and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Bugs-1598141 ] top-level configure is broken
by SourceForge.net 17 Nov '06

17 Nov '06

Bugs item #1598141, was opened at 2006-11-16 19:46 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1598141&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: build Group: release 1.34.0 Status: Open Resolution: None Priority: 5 Private: No Submitted By: eponym (eponym) Assigned to: Nobody/Anonymous (nobody) Summary: top-level configure is broken Initial Comment: The top-level configure script in the RC1.34.0 release is broken. This script starts out as: #!/bin/sh which implies that it is a Bourne-shell script. But now almost all of tests in the file have been converted to look like the following: 220 if test "x$LIBDIR" == x; then 221 LIBDIR="$EPREFIX/lib" 222 fi where (in 1.33.1) they used to look like this: 217 if test "x$LIBDIR" = "x" ; then 218 LIBDIR="$EPREFIX/lib" 219 fi The problem is that "==" is not a valid Bourne-shell test-command operator, so the entire build breaks immediately on any platform which uses a true Bourne shell as sh. The fix is to either convert all of these operators to "=", or to stop claiming the script is a Bourne shell script and use "#!/bin/bash" instead. But the latter approach is not recommended because there are many older machines without bash in that location. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1598141&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys - and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

I think using spinlocks to simulate an atomic shared_ptr is deadlock-prone, or inefficient.
by Talbot, George 17 Nov '06

17 Nov '06

I've been playing around with the atomic_shared example class that I posted, and I'm not entirely happy with a spinlock-based solution to a shared_ptr type class. To implement operator= for a class like this has two issues: 1) operator= for an atomic shared_ptr can only be "best effort". If another thread wins out, so be it. I'm going to, for the purposes of this discussion, assume that this is OK, and that if you don't like it, you'll use compare_and_set/swap to do a better job. 2) Without any sort of 2-pointer-wide atomic assignment in hardware, operator= really looks like this: lock the source pointer make a local copy of it release the source pointer lock the destination set the value of the destination from the copy unlock the destination This won't deadlock, but has to make an extra copy of the pointer locally. To avoid the copy, we would have to lock both the source and destination before the assignment of the underlying shared_ptr, which, in the code I sent I did, but is deadlock-prone. See the implementation of swap for even more inefficiency. However, what is the "right" way to do this? I read the stuff from Chris Thommason and I have to admit that I'm not too sure how I'd wrap shared_ptr with it to make this work. Can I have a bit of brainstorming assistance? P.S. Appended is a version of atomic_shared using spinlocks that I don't think deadlocks, but I could be wrong. Can I get a bit of help looking at it from more experienced eyes? P.S. Peter Dimov: Is it OK that I put your name on this as one of the authors? You had told me in previous posts to the list how the operations should likely work with a spinlock, so it seemed appropriate. -- George T. Talbot <gtalbot(a)locuspharma.com> /** \file atomic_shared.h * * \author George T. Talbot * \author Peter Dimov * * \brief This file defines a template class that can wrap * boost::shared_ptr and provide thread-safe atomic * read/write operations. * * (C) Copyright George Talbot, Peter Dimov 2006. * * 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) */ #ifndef ATOMIC_SHARED_H #define ATOMIC_SHARED_H #include <boost/shared_ptr.hpp> #include <pthread.h> #include <stdexcept> #include <cerrno> #include <cassert> #ifdef ATOMIC_ABORT_ON_ERROR #define ATOMIC_SHARED_ABORT ::abort(); #else #define ATOMIC_SHARED_ABORT #endif /** A wrapper for shared_ptr that implements atomic assignments and compare_and_swap. */ template<class T> class atomic_shared { typedef boost::shared_ptr<T> base_ptr; /** Lock a spinlock protecting an atomic pointer. * * @param l Spinlock to lock. * @param should_throw If true, thrown an exception if lock fails. */ static void lock(pthread_spinlock_t& l, bool should_throw = true) { int rv = ::pthread_spin_lock(&l); if (rv) { errno = rv; ATOMIC_SHARED_ABORT if (should_throw) { throw std::logic_error("can't lock spinlock"); } } } /** Unlock a spinlock protecting an atomic pointer. */ static void unlock(pthread_spinlock_t& l) { int rv = ::pthread_spin_unlock(&l); if (rv) { ATOMIC_SHARED_ABORT errno = rv; throw std::logic_error("can't lock spinlock"); } } /** Initialize a spinlock protecting an atomic pointer. */ static void init(pthread_spinlock_t& l) { int rv = ::pthread_spin_init(&l, PTHREAD_PROCESS_PRIVATE); if (rv) { ATOMIC_SHARED_ABORT errno = rv; throw std::logic_error("can't initialize spinlock"); } } public: typedef typename base_ptr::element_type element_type; ///< Type of element to which pointer points. typedef typename base_ptr::value_type value_type; ///< Same as element_type. typedef typename base_ptr::pointer pointer; ///< Pointer to refcounted object. typedef typename base_ptr::reference reference; ///< Reference to refcounted object. /** Initialize an empty spinlock. */ atomic_shared() { init(spinlock); } /** Create a managed pointer from a bare one. */ template<class Y> explicit atomic_shared(Y* p) : ptr(p) { init(spinlock); } /** Create a managed pointer from a bare one, and a custom deleter. */ template<class Y, class D> atomic_shared(Y * p, D d) : ptr(p, d) { init(spinlock); } atomic_shared(const base_ptr& p) : ptr(p) { init(spinlock); } atomic_shared(const atomic_shared<T>& p) { init(spinlock); lock(p.spinlock); ptr = p.ptr; unlock(p.spinlock); } atomic_shared<T>& operator=(atomic_shared<T> p) // local copy to avoid deadlock. { if (&p != this) { lock(spinlock); ptr = p.ptr unlock(spinlock); } return *this; } template<class Y> atomic_shared(const atomic_shared<Y>& p) { init(spinlock); lock(p.spinlock); ptr = p.ptr; unlock(p.spinlock); } template<class Y> atomic_shared<T>& operator=(atomic_shared<Y> p) // local copy to avoid deadlock. { lock(spinlock); ptr = p.ptr unlock(spinlock); return *this; } ~atomic_shared() { // Lock the spinlock to hold off all other copiers. lock(spinlock, false); // Destroy the spinlock--this should cause all other copiers to // either assert or throw. int rv = ::pthread_spin_destroy(&spinlock); // For debugging, drop us into the debugger if we can't destroy the // spinlock. if (rv) { ATOMIC_SHARED_ABORT } } /** Reset the pointer to an empty pointer. */ void reset() { lock(spinlock); ptr.reset(); unlock(spinlock); } /** Reset the pointer and replace it with a new bare pointer. */ template<class Y> void reset(Y* p) { lock(spinlock); ptr.reset(p); unlock(spinlock); } /** Reset the pointer and replace it with a new bare pointer with custom deleter. */ template<class Y, class D> void reset(Y* p, D d) { lock(spinlock); ptr.reset(p, d); unlock(spinlock); } reference operator*() const { return ptr.operator*(); } T* operator->() const { return ptr.operator->(); } T* get() const { return ptr.get(); } operator bool() const { return ptr; } bool operator!() const { return !ptr; } bool unique() const { return ptr.unique(); } long use_count() const { return ptr.use_count(); } /** Atomically swap the pointer with another pointer. */ void swap(atomic_shared<T>& other) { atomic_shared<T> temp(*this); atomic_shared<T> temp2(other); lock(spinlock); ptr = temp2.ptr; unlock(spinlock); lock(other.spinlock); other = temp.ptr; unlock(other.spinlock); } /** Attempt to set the value of the pointer with another pointer, but only if the * pointer is the same as a previously sampled value of the pointer. * * @return true if the swap was successful. */ bool compare_and_set(const atomic_shared<T>& cmp, atomic_shared<T> xchg) // Note that xchg is a local copy. { int rv = ::pthread_spin_trylock(&spinlock); switch (rv) { case EBUSY: if ((void*)&xchg < (void*)this) unlock(xchg.spinlock); return false; case 0: break; default: ATOMIC_SHARED_ABORT errno = rv; throw std::logic_error("can't pthread_spin_trylock"); } bool r = ptr == cmp.ptr; if (r) ptr.swap(xchg.ptr); unlock(spinlock); return r; } private: template<class Y> friend class atomic_shared; base_ptr ptr; mutable pthread_spinlock_t spinlock; }; // atomic_shared #endif

3 2

atomic_ops library
by Neal Becker 17 Nov '06

17 Nov '06

Perhaps of some interest: http://www.hpl.hp.com/research/linux/atomic_ops/

3 5

[proposal] Atomically Thread-Safe Static Initialization For Boost...
by Chris Thomasson 16 Nov '06

16 Nov '06

Here is the C++ pseudo-code: namespace atomic { template<typename T> class var; template<typename T> class once; namespace mb { enum naked_e { naked }; enum fence_e { fence }; enum release_e { release }; enum depends_e { depends }; enum acquire_depends_e { acquire_depends }; } namespace externlib_api { class hashed_mutex; template<typename T> extern T load(T volatile*, mb::naked_e) const throw(); template<typename T> extern T load(T volatile*, mb::depends_e) const throw(); template<typename T> extern void store(T volatile*, T const&, mb::release_e) throw(); template<typename T> extern void store(T volatile*, T const&, mb::naked_e) throw(); template<typename T> extern bool cas(T volatile*, T const&, T const&, mb::acquire_depends_e) throw(); template<typename T> extern bool cas(T volatile*, T const&, T const&, mb::fence_e) throw(); } template<typename T> class var { mutable T volatile m_state; public: var() throw() {} var(T const &state) throw() : m_state(state) {} public: inline T load(mb::depends_e) const throw() { return externlib_api::load(&m_state, mb::depends); } inline T load(mb::naked_e) const throw() { return externlib_api::load(&m_state, mb::naked); } public: inline void store(T const &xchg, mb::fence_e) throw() { externlib_api::store(&m_state, xchg, mb::fence); } inline void store(T const &xchg, mb::naked_e) throw() { externlib_api::store(&m_state, xchg, mb::naked); } public: inline bool cas(T const &cmp, T const &xchg, mb::fence_e) throw() { return externlib_api::cas(&m_state, cmp, xchg, mb::fence); } inline bool cas(T const &cmp, T const &xchg, mb::acquire_depends_e) throw() { return externlib_api::cas(&m_state, cmp, xchg, mb::acquire_depends); } }; template<typename T> class once { var<T*> m_state; var<intword_t> m_count; public: once() throw() : m_state(0), m_count(1) {} ~once() throw() { if (try_dec()) { try { delete local; } catch(...) { assert(false); throw; } } } private: bool try_dec() throw() { intword_t local; do { local = m_count.load(mb::naked); if (! local || local < 1) { return false; } // use mb::fence to cover *both acquire and release // wrt the result of the decrement } while(! m_count.cas(local, local - 1, mb::fence)); return (local == 1); } bool try_inc() throw() { intword_t local; do { local = m_count.load(mb::naked); if (! local || local < 1) { return false; } } while(! m_count.cas(local, local + 1, mb::acquire_depends)); return true; } public: // atomic load / thread-saftey: strong T* load() const { T *local = m_state.load(mb::depends); if (! local) { externlib_api::hashed_mutex::guard_t const &lock(this); if (! try_inc()) { return 0; } local = m_state.load(mb::naked); if (! local) { // call try_dec on exceptions... local = new T; m_state.store(local, mb::release); } } else if(! try_inc()) { return 0; } return local; } // dec the refcount void dec() { if (try_dec()) { delete local; } } }; } okay, here is sample usage now: static atomic::once<foo> g_foo; void some_threads(...) { for(;;) { // whatever... foo *myfoo = g_foo.load(); if (myfoo) { // use myfoo... // okay, we are finished with myfoo g_foo.dec(); } } } This should be a workable solution to the static initialization problem... What do you all think?

3 25

Re: [boost] Review Request: Boost Exception
by Matthew Herrmann 16 Nov '06

16 Nov '06

> > Message: 5 > Date: Tue, 14 Nov 2006 20:38:43 +0200 > From: "Peter Dimov" <pdimov(a)mmltd.net> > Subject: Re: [boost] Review Request: Boost Exception > To: <boost(a)lists.boost.org> > Message-ID: <00ee01c7081c$1f94f230$6607a8c0@pdimov2> > Content-Type: text/plain; format=flowed; charset="iso-8859-1"; > reply-type=original > > David Abrahams wrote: > >> > "Peter Dimov" <pdimov(a)mmltd.net> writes: >> > >> >>> >> David Abrahams wrote: >>> >>>> >>> "Peter Dimov" <pdimov(a)mmltd.net> writes: >>>> >>> >>>> >>>>> >>>> Moving the catch clause to a destructor doesn't seem an improvement >>>>> >>>> to me. >>>>> >>>> >>> >>>> >>> Using a catch clause to add information to a propagating exception >>>> >>> feels syntactically heavy to me, but of course others may disagree. >>>> >>> And it may also be that without language support, there's not >>>> >>> really a good way to avoid that weight. I'm just expressing an >>>> >>> aesthetic preference here. >>>> >>> >> >>> >> Won't you need to prepare all the extra information even if nothing >>> >> throws? >>> >> > >> > No, you could do it lazily. >> > > I'm afraid that I need to be shown an example in order to "get it". :-) > I think Mr Abrahams is referring to an idea similar to this: (please ignore the class name, it is a placeholder only) void read_file() { boost::exception_info e(..., filename, current_pos, is_connected); ... e.success(); return; } e.success() sets a flag to true, which prevents the generation of error information when the object is destroyed. To remove the e.success(), you'd need to detect whether the stack was being unwound due to an exception or due to a natural return. This is where language support (or compiler-dependent tricks) would be required. Nested exceptions complicate that picture. The other issue is how to handle return values cleanly. You could make success() a pass-through function so you could handle return values with a shorter syntax: int sum(int a, int b) { error_info e; ... return e.success(a+b); } template <typename T> T& error_info::success(T& value) { flag = true; return rhs; } (special care needed to avoid copying and to handle references/temporaries etc). Ultimately, this approach is cleaner when there are more exit points due to exceptions than from return statements. Otherwise, you could forget to call success() at one of the return sites and hit a performance issue as it generates the exception info. Regards, Matthew Herrmann

8 11

Re: [boost] [fusion] comparing iterators with is_same?
by dan marsden 16 Nov '06

16 Nov '06

Steven Watanabe wrote: > >In accumulate and fold I see > >is_same< > typename result_of::begin<Sequence const>::type > , typename result_of::end<Sequence const>::type>() > >shouldn't this be result_of::equal_to<...>()? > You're correct, that is a defect. Now fixed in CVS. Thanks for picking this up Cheers Dan Send instant messages to your online friends http://uk.messenger.yahoo.com

1 0

Re: [boost] Asio multithreaded http server
by Christopher Kohlhoff 16 Nov '06

16 Nov '06

berserker_r <berserker_r(a)hotmail.com> wrote: > Actually the server looks to be "locked" to accept new > connections until the current session has finished its work > even calling io_service::run from multiple threads. What OS are you using? Is the session's work CPU bound? Cheers, Chris

4 3

Boost inspection notification (2006-11-16/RC_1_34_0) *X*
by Rene Rivera 16 Nov '06

16 Nov '06

Boost Inspection Report Run Date: 17:04:06 UTC, Thursday 16 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11424 files scanned 891 directories scanned (including root) 254 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 176 broken links 32 unlinked files 7 file/directory names issues 1 files with tabs 0 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) bind (1) boost-root (1) build (2) date_time (1) doc (2) filesystem (37) fusion (1) graph (3) inspect (1) interprocess (1) iostreams (15) lambda (4) more (66) mpl (1) multi_array (2) numeric (1) parameter (2) program_options (1) ptr_container (1) python (7) regex (1) regression (14) serialization (1) signals (1) test (81) tuple (1) type_traits (1) utility (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* name exceeds 31 characters boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |boost-root| index.htm: *A* broken link: ../doc/html/signals.html |build| tools/build/v2/example/make/main.cpp.pro: *N* name contains more than one dot character ('.') tools/build/v2/test/test_system.html: *A* unlinked file |date_time| libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/jam.html: *A* unlinked file |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/i18n.html: *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: ../build/Jamfile *A* broken link: convenience.htm *A* broken link: fstream.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#directory_iterator *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Grammar *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq *A* broken link: path.htm#synopsis libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note |fusion| libs/fusion/index.html: *A* broken link: doc/html/index.html |graph| boost/graph/maximum_cardinality_matching.hpp: *N* name exceeds 31 characters libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* name exceeds 31 characters libs/graph/doc/sorted_erdos_renyi_generator.html: *N* name exceeds 31 characters |inspect| tools/inspect/index.html: *A* broken link: build/Jamfile |interprocess| libs/interprocess/index.html: *A* broken link: doc/html/index.html |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file libs/iostreams/doc/guide/text_processing.html: *A* unlinked file libs/iostreams/doc/installation.html: *A* broken link: ../../../tools/build/v1/build_system.htm libs/iostreams/doc/tutorial/container_device.html: *A* unlinked file libs/iostreams/doc/tutorial/dictionary_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/dual_use_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/filter_usage.html: *A* unlinked file libs/iostreams/doc/tutorial/line_wrapping_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/multichar_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/shell_comments_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/tab_expanding_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/unix2dos_filters.html: *A* unlinked file libs/iostreams/doc/tutorial/writing_devices.html: *A* unlinked file |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 libs/lambda/doc/index.html: *A* broken link: ../../LICENSE_1_0.txt |more| more/getting_started.html: *A* broken link: ../Jamfile *A* broken link: ../tools/build/v1/borland-tools.html *A* broken link: ../tools/build/v1/build_system.htm *A* broken link: ../tools/build/v1/build_system.htm#build *A* broken link: ../tools/build/v1/como-tools.html *A* broken link: ../tools/build/v1/cw-tools.html *A* broken link: ../tools/build/v1/darwin-tools.html *A* broken link: ../tools/build/v1/dmc-stlport-tools.html *A* broken link: ../tools/build/v1/dmc-tools.html *A* broken link: ../tools/build/v1/edg-tools.html *A* broken link: ../tools/build/v1/gcc-nocygwin-tools.html *A* broken link: ../tools/build/v1/gcc-stlport-tools.html *A* broken link: ../tools/build/v1/gcc-tools.html *A* broken link: ../tools/build/v1/intel-linux-tools.html *A* broken link: ../tools/build/v1/intel-win32-tools.html *A* broken link: ../tools/build/v1/kcc-tools.html *A* broken link: ../tools/build/v1/kylix-tools.html *A* broken link: ../tools/build/v1/mingw-stlport-tools.html *A* broken link: ../tools/build/v1/mingw-tools.html *A* broken link: ../tools/build/v1/mipspro-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html *A* broken link: ../tools/build/v1/msvc-tools.html *A* broken link: ../tools/build/v1/sunpro-tools.html *A* broken link: ../tools/build/v1/tru64cxx-tools.html *A* broken link: ../tools/build/v1/vacpp-tools.html *A* broken link: ../tools/build/v1/vc-7_1-stlport-tools.html *A* broken link: ../tools/build/v1/vc-7_1-tools.html *A* broken link: ../tools/build/v1/vc-8_0-tools.html *A* broken link: ../tools/build/v1/vc7-stlport-tools.html *A* broken link: ../tools/build/v1/vc7-tools.html more/version_history.html: *A* broken link: ../tools/build/v1/intel-linux-tools.html *A* broken link: ../tools/build/v1/intel-win32-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html |mpl| boost/mpl/alias.hpp: *U* unnamed namespace at line 17 |multi_array| boost/multi_array/base.hpp: *U* unnamed namespace at line 69 libs/multi_array/test/generative_tests.hpp: *U* unnamed namespace at line 57 |numeric| libs/numeric/conversion/index.html: *A* broken link: ../../LICENSE_1_0.txt |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |program_options| libs/program_options/doc/index.html: *A* broken link: ../.../../LICENSE_1_0.txt |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |python| libs/python/doc/building.html: *A* broken link: ../../../tools/build/v1/build_system.htm *A* broken link: ../../../tools/build/v1/build_system.htm#user_globals *A* broken link: ../../../tools/build/v1/build_system.htm#variants libs/python/doc/tutorial/index.html: *A* broken link: ../../../LICENSE_1_0.txt libs/python/doc/v2/May2002.html: *A* broken link: ../../../../tools/build/v1/build_system.htm *A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py libs/python/doc/v2/faq.html: *A* broken link: ../../../../tools/build/v1/build_system.htm |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" is not alphabetic tools/regression/index.htm: *A* broken link: build/Jamfile tools/regression/xsl_reports/xsl/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html: *A* unlinked file |serialization| libs/serialization/src/basic_xml_grammar.ipp: *U* unnamed namespace at line 43 |signals| boost/signals/detail/named_slot_map.hpp: *T* |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 206 *U* unnamed namespace at line 228 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 255 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 52 *U* unnamed namespace at line 61 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* name exceeds 31 characters libs/test/doc/components/prg_exec_monitor/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/prg_exec_monitor/index.html: *A* broken link: ../../../../../boost/test/cpp_main.hpp libs/test/doc/components/test_tools/index.html: *A* broken link: ../../tests/boost_check_equal_str.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_CLOSE.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_MESSAGE.html: *A* broken link: BOOST_MESSAGE.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_SMALL.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/tools_list.html: *A* broken link: ../../btl1.gif *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/utf/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/utf/components/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/components/test_case/abstract_interface.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/auto_register_facility.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/tc_template.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/custom_log_formatter.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_result/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_suite/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/index.html: *A* broken link: getting_started/index.html libs/test/doc/components/utf/parameters/build_info.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/catch_system_errors.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/detect_memory_leaks.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/no_result_code.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/output_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/random.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_format.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/show_progress.html: *A* broken link: ../../btl1.gif libs/test/doc/examples/unit_test_example1.html: *A* broken link: ../../example/unit_test_example1.cpp libs/test/doc/examples/unit_test_example2.html: *A* broken link: ../../example/unit_test_example2.cpp libs/test/doc/examples/unit_test_example3.html: *A* broken link: ../../example/unit_test_example3.cpp libs/test/doc/examples/unit_test_example4.html: *A* broken link: ../../example/unit_test_example4.cpp libs/test/doc/examples/unit_test_example5.html: *A* broken link: ../../example/unit_test_example5.cpp *A* broken link: ../../example/unit_test_example5.input libs/test/doc/tests/auto_unit_test_test.html: *A* broken link: ../../test/auto_unit_test_test.cpp libs/test/doc/tests/auto_unit_test_test_mult.html: *A* broken link: ../../test/auto_unit_test_test_mult1.cpp *A* broken link: ../../test/auto_unit_test_test_mult2.cpp libs/test/doc/tests/unit_test_suite_ex_test.html: *A* broken link: ../../test/unit_test_suite_ex_test.cpp libs/test/doc/tutorials/hello_the_testing_world.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../execution_monitor/index.html libs/test/doc/tutorials/new_year_resolution.html: *A* broken link: ../../../../../../LICENSE_1_0.txt |tuple| libs/tuple/index.html: *A* broken link: ../../site/LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file |utility| libs/utility/index.html: *A* broken link: ../../site/LICENSE_1_0.txt

1 0

Boost inspection notification (2006-11-16/RC_1_34_0) *LC*
by Rene Rivera 16 Nov '06

16 Nov '06

Boost Inspection Report Run Date: 17:04:17 UTC, Thursday 16 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11424 files scanned 891 directories scanned (including root) 1267 problems reported Problem counts: 832 files missing Boost license info or having wrong reference text 435 files missing copyright notice Summary: any (1) archive (1) array (1) assign (2) boost-root (4) boostbook (2) build (58) compatibility (2) concept_check (22) conversion (5) detail (4) disjoint_sets (2) doc (2) filesystem (2) format (8) function (1) functional (8) inspect (1) integer (9) iostreams (2) lambda (10) libs (6) logic (2) math (1) more (30) mpl (419) multi_array (13) numeric (198) optional (1) people (22) pool (30) program_options (35) property_map (15) ptr_container (111) python (6) quickbook (11) random (20) range (18) rational (5) regex (4) regression (64) release (2) serialization (16) smart_ptr (8) test (5) timer (1) tokenizer (9) tr1 (2) tuple (5) utility (19) variant (42) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |any| libs/any/doc/ any.xml: *L* |archive| boost/archive/detail/ utf8_codecvt_facet.hpp: *L* |array| libs/array/doc/ array.xml: *L* |assign| libs/assign/doc/ style.css: *L* libs/assign/ index.html: *L* |boost-root| / README: *C* boost.css: *C* *L* rst.css: *L* |boostbook| tools/boostbook/xsl/ fo.xsl: *C* *L* |build| tools/build/v2/build/ build-request.jam: *L* modifiers.jam: *L* tools/build/v2/doc/ Jamfile.v2: *C* *L* tools/build/v2/doc/src/ advanced.xml: *C* *L* architecture.xml: *C* *L* catalog.xml: *C* *L* extending.xml: *C* *L* faq.xml: *C* *L* howto.xml: *C* *L* install.xml: *C* *L* recipes.xml: *C* *L* reference.xml: *C* *L* standalone.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* tools/build/v2/example/python_modules/ python_helpers.jam: *C* *L* python_helpers.py: *C* *L* tools/build/v2/test/ abs_workdir.py: *C* *L* dependency_property.py: *L* dependency_test.py: *C* *L* direct_request_test.py: *C* *L* dll_path.py: *L* double_loading.py: *L* duplicate.py: *L* echo_args.jam: *C* *L* empty.jam: *C* *L* expansion.py: *L* explicit.py: *L* gcc_runtime.py: *L* tools/build/v2/test/project-test3/lib3/ Jamfile: *C* *L* tools/build/v2/test/ readme.txt: *C* *L* svn_tree.py: *L* tag.py: *L* test_system.html: *L* tools/build/v2/tools/ sun.jam: *L* xsltproc.jam: *L* |compatibility| libs/compatibility/ generate_cpp_c_headers.py: *L* index.html: *L* |concept_check| libs/concept_check/ bibliography.htm: *L* concept_check.htm: *L* concept_covering.htm: *L* creating_concepts.htm: *L* libs/concept_check/doc/ Jamfile.v2: *C* *L* libs/concept_check/doc/reference/ Assignable.xml: *L* BidirectionalIterator.xml: *L* CopyConstructible.xml: *L* DefaultConstructible.xml: *L* EqualityComparable.xml: *L* ForwardIterator.xml: *L* InputIterator.xml: *L* LessThanComparable.xml: *L* OutputIterator.xml: *L* RandomAccessIterator.xml: *L* SignedInteger.xml: *L* concepts.xml: *L* libs/concept_check/ implementation.htm: *L* prog_with_concepts.htm: *L* reference.htm: *L* using_concept_check.htm: *L* |conversion| libs/conversion/ cast.htm: *L* index.html: *C* *L* lexical_cast.htm: *L* libs/conversion/test/ Jamfile.v2: *L* |detail| boost/detail/ algorithm.hpp: *L* endian.hpp: *L* limits.hpp: *L* utf8_codecvt_facet.hpp: *L* |disjoint_sets| libs/disjoint_sets/ bibliography.html: *L* disjoint_sets.html: *L* |doc| doc/html/ reference.css: *C* *L* |filesystem| libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* |format| libs/format/benchmark/ bench_format.cpp: *C* results.txt: *C* *L* libs/format/doc/ choices.html: *L* format.html: *C* libs/format/ index.html: *C* *L* libs/format/test/ Jamfile.v2: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* |functional| boost/ functional.hpp: *L* libs/functional/ binders.html: *L* function_test.cpp: *L* function_traits.html: *L* index.html: *L* mem_fun.html: *L* negators.html: *L* ptr_fun.html: *L* |inspect| tools/inspect/build/ Jamfile.v2: *L* |integer| libs/integer/ cstdint.htm: *C* *L* libs/integer/doc/ integer_mask.html: *L* static_min_max.html: *L* libs/integer/ index.html: *C* *L* integer.htm: *L* integer_traits.html: *C* *L* |iostreams| libs/iostreams/doc/ menu.html: *C* libs/iostreams/test/detail/ utf8_codecvt_facet.hpp: *L* |lambda| libs/lambda/doc/ Jamfile.v2: *C* *L* libs/lambda/doc/detail/ README: *C* *L* lambda_doc.xsl: *C* *L* lambda_doc_chunks.xsl: *C* *L* libs/lambda/test/ Makefile: *C* *L* |libs| libs/ expected_results.xml: *C* *L* maintainers.txt: *C* *L* platform_maintainers.txt: *C* *L* |logic| libs/logic/doc/ Jamfile.v2: *C* *L* |math| boost/math/ common_factor_rt.hpp: *L* |more| more/ borland_cpp.html: *C* *L* count_bdy.htm: *L* discussion_policy.htm: *C* error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* microsoft_vcpp.html: *C* *L* moderators.html: *C* regression.html: *C* *L* report-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *L* |mpl| libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Runtime.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* for_each.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* refmanual.py: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/example/fsm/ README.txt: *C* *L* libs/mpl/test/ Jamfile.v2: *C* *L* |multi_array| libs/multi_array/doc/ iterator_categories.html: *C* *L* reference.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/test/ Jamfile.v2: *L* |numeric| boost/numeric/ublas/ banded.hpp: *L* blas.hpp: *L* boost/numeric/ublas/detail/ concepts.hpp: *L* config.hpp: *L* definitions.hpp: *L* documentation.hpp: *L* duff.hpp: *L* iterator.hpp: *L* matrix_assign.hpp: *L* raw.hpp: *L* temporary.hpp: *L* vector_assign.hpp: *L* boost/numeric/ublas/ exception.hpp: *L* expression_types.hpp: *L* functional.hpp: *L* fwd.hpp: *L* hermitian.hpp: *L* io.hpp: *L* lu.hpp: *L* matrix.hpp: *L* matrix_expression.hpp: *L* matrix_proxy.hpp: *L* matrix_sparse.hpp: *L* operation.hpp: *L* operation_blocked.hpp: *L* operation_sparse.hpp: *L* storage.hpp: *L* storage_sparse.hpp: *L* symmetric.hpp: *L* traits.hpp: *L* triangular.hpp: *L* vector.hpp: *L* vector_expression.hpp: *L* vector_of_vector.hpp: *L* vector_proxy.hpp: *L* vector_sparse.hpp: *L* libs/numeric/conversion/test/ Jamfile.v2: *C* *L* test_helpers.cpp: *C* test_helpers2.cpp: *C* test_helpers3.cpp: *C* traits_test.cpp: *C* udt_example_0.cpp: *C* udt_support_test.cpp: *C* libs/numeric/interval/doc/ checking.htm: *L* comparisons.htm: *L* examples.htm: *L* guide.htm: *L* includes.htm: *L* interval.htm: *L* numbers.htm: *L* policies.htm: *L* rounding.htm: *L* todo.htm: *L* libs/numeric/ublas/bench1/ bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ bench4.cpp: *L* bench41.cpp: *L* bench42.cpp: *L* bench43.cpp: *L* libs/numeric/ublas/doc/ Release_notes.txt: *C* *L* array_adaptor.htm: *C* *L* banded.htm: *L* blas.htm: *L* bounded_array.htm: *C* *L* container_concept.htm: *L* doxygen.css: *C* *L* expression_concept.htm: *L* hermitian.htm: *L* index.htm: *L* iterator_concept.htm: *L* matrix.htm: *L* matrix_expression.htm: *L* matrix_proxy.htm: *L* matrix_sparse.htm: *L* operations_overview.htm: *L* overview.htm: *L* products.htm: *L* range.htm: *C* *L* libs/numeric/ublas/doc/samples/ banded_adaptor.cpp: *L* banded_matrix.cpp: *L* bounded_array.cpp: *L* compressed_matrix.cpp: *L* compressed_vector.cpp: *L* coordinate_matrix.cpp: *L* coordinate_vector.cpp: *L* hermitian_adaptor.cpp: *L* hermitian_matrix.cpp: *L* identity_matrix.cpp: *L* map_array.cpp: *L* mapped_matrix.cpp: *L* mapped_vector.cpp: *L* matrix.cpp: *L* matrix_binary.cpp: *L* matrix_binary_scalar.cpp: *L* matrix_column.cpp: *L* matrix_column_project.cpp: *L* matrix_matrix_binary.cpp: *L* matrix_matrix_solve.cpp: *L* matrix_range.cpp: *L* matrix_range_project.cpp: *L* matrix_row.cpp: *L* matrix_row_project.cpp: *L* matrix_slice.cpp: *L* matrix_slice_project.cpp: *L* matrix_unary.cpp: *L* matrix_vector_binary.cpp: *L* matrix_vector_range.cpp: *L* matrix_vector_slice.cpp: *L* matrix_vector_solve.cpp: *L* range.cpp: *L* slice.cpp: *L* symmetric_adaptor.cpp: *L* symmetric_matrix.cpp: *L* triangular_adaptor.cpp: *L* triangular_matrix.cpp: *L* unbounded_array.cpp: *L* unit_vector.cpp: *L* vector.cpp: *L* vector_binary.cpp: *L* vector_binary_outer.cpp: *L* vector_binary_redux.cpp: *L* vector_binary_scalar.cpp: *L* vector_range.cpp: *L* vector_range_project.cpp: *L* vector_slice.cpp: *L* vector_slice_project.cpp: *L* vector_unary.cpp: *L* vector_unary_redux.cpp: *L* zero_matrix.cpp: *L* zero_vector.cpp: *L* libs/numeric/ublas/doc/ storage_concept.htm: *C* *L* storage_sparse.htm: *L* symmetric.htm: *L* triangular.htm: *L* types_overview.htm: *L* ublas.css: *C* *L* unbounded_array.htm: *C* *L* vector.htm: *L* vector_expression.htm: *L* vector_proxy.htm: *L* vector_sparse.htm: *L* libs/numeric/ublas/test/ README: *C* *L* concepts.cpp: *L* test1.cpp: *L* test1.hpp: *L* test11.cpp: *L* test12.cpp: *L* test13.cpp: *L* test2.cpp: *L* test2.hpp: *L* test21.cpp: *L* test22.cpp: *L* test23.cpp: *L* test3.cpp: *L* test3.hpp: *L* test31.cpp: *L* test32.cpp: *L* test33.cpp: *L* test4.cpp: *L* test4.hpp: *L* test42.cpp: *L* test43.cpp: *L* test5.cpp: *L* test5.hpp: *L* test52.cpp: *L* test53.cpp: *L* test6.cpp: *L* test6.hpp: *L* test62.cpp: *L* test63.cpp: *L* test7.cpp: *L* test7.hpp: *L* test71.cpp: *L* test72.cpp: *L* test73.cpp: *L* |optional| libs/optional/test/ Jamfile.v2: *L* |people| people/ darin_adler.htm: *C* *L* dietmar_kuehl.htm: *C* *L* ed_brey.htm: *C* *L* gennadiy_rozental.htm: *C* *L* joaquin_lopez.htm: *C* *L* jonathan_turkanis.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_moore.htm: *C* *L* ronald_garcia.htm: *C* *L* vesa_karvonen.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *L* |program_options| boost/program_options/detail/ utf8_codecvt_facet.hpp: *L* libs/program_options/build/ Jamfile.v2: *C* *L* libs/program_options/doc/ Jamfile.v2: *C* *L* acknowledgements.xml: *C* *L* changes.xml: *C* *L* design.xml: *C* *L* glossary.xml: *C* *L* howto.xml: *C* *L* overview.xml: *C* *L* post_review_plan.txt: *C* *L* todo.txt: *C* *L* tutorial.xml: *C* *L* libs/program_options/example/ Jamfile.v2: *C* *L* libs/program_options/test/ Jamfile.v2: *C* *L* program_options_size_test.py: *C* *L* ucs2.txt: *C* *L* utf8.txt: *C* *L* winmain.py: *C* *L* |property_map| libs/property_map/ LvaluePropertyMap.html: *L* ReadWritePropertyMap.html: *L* ReadablePropertyMap.html: *L* WritablePropertyMap.html: *L* associative_property_map.html: *L* const_assoc_property_map.html: *L* libs/property_map/doc/ dynamic_property_map.html: *C* *L* dynamic_property_map.rst: *C* *L* libs/property_map/ example2.cpp: *L* identity_property_map.html: *L* iterator_property_map.html: *L* property_map.html: *L* vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/ Jamfile.v2: *C* *L* associative_ptr_container.html: *L* associative_ptr_container.rst: *L* comp.sh: *C* *L* comp_all.sh: *C* *L* comp_assoc_ptr_container.sh: *C* *L* comp_conventions.sh: *C* *L* comp_examples.sh: *C* *L* comp_faq.sh: *C* *L* comp_guidelines.sh: *C* *L* comp_headers.sh: *C* *L* comp_indirect_fun.sh: *C* *L* comp_ptr_array.sh: *C* *L* comp_ptr_container.sh: *C* *L* comp_ptr_deque.sh: *C* *L* comp_ptr_list.sh: *C* *L* comp_ptr_map.sh: *C* *L* comp_ptr_map_adapter.sh: *C* *L* comp_ptr_multimap.sh: *C* *L* comp_ptr_multimap_adapter.sh: *C* *L* comp_ptr_multiset.sh: *C* *L* comp_ptr_multiset_adapter.sh: *C* *L* comp_ptr_sequence_adapter.sh: *C* *L* comp_ptr_set.sh: *C* *L* comp_ptr_set_adapter.sh: *C* *L* comp_ptr_vector.sh: *C* *L* comp_reference.sh: *C* *L* comp_rever_ptr_container.sh: *C* *L* comp_tutorial.sh: *C* *L* conventions.html: *L* conventions.rst: *L* default.css: *L* examples.rst: *L* faq.html: *L* faq.rst: *L* guidelines.html: *L* guidelines.rst: *L* headers.html: *L* headers.rst: *L* indirect_fun.html: *L* indirect_fun.rst: *L* intro.xml: *C* *L* ptr_array.html: *L* ptr_array.rst: *L* ptr_container.xml: *L* ptr_deque.html: *L* ptr_deque.rst: *L* ptr_list.html: *L* ptr_list.rst: *L* ptr_map.html: *L* ptr_map.rst: *L* ptr_map_adapter.html: *L* ptr_map_adapter.rst: *L* ptr_multimap.html: *L* ptr_multimap.rst: *L* ptr_multimap_adapter.html: *L* ptr_multimap_adapter.rst: *L* ptr_multiset.html: *L* ptr_multiset.rst: *L* ptr_multiset_adapter.html: *L* ptr_multiset_adapter.rst: *L* ptr_sequence_adapter.html: *L* ptr_sequence_adapter.rst: *L* ptr_set.html: *L* ptr_set.rst: *L* ptr_set_adapter.html: *L* ptr_set_adapter.rst: *L* ptr_vector.html: *L* ptr_vector.rst: *L* reference.html: *L* reference.rst: *L* reversible_ptr_container.html: *L* reversible_ptr_container.rst: *L* style.css: *C* *L* todo.txt: *C* *L* tutorial.html: *L* tutorial.rst: *L* libs/ptr_container/test/ Jamfile.v2: *C* *L* sequence_point.cpp: *C* *L* |python| libs/python/doc/ internals.html: *L* internals.rst: *L* libs/python/test/ operators_wrapper.cpp: *C* *L* operators_wrapper.py: *C* *L* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile.v2: *C* *L* libs/random/ wg21-proposal.html: *C* *L* |range| libs/range/doc/ boost_range.html: *L* example.cpp: *C* *L* examples.html: *L* faq.html: *L* headers.html: *L* history_ack.html: *L* intro.html: *L* portability.html: *L* range.html: *L* style.css: *C* *L* style.html: *L* utility_class.html: *L* libs/range/test/ TODO: *C* *L* compat1.cpp: *C* *L* |rational| boost/ rational.hpp: *L* libs/rational/ index.html: *L* rational.html: *L* rational_example.cpp: *L* rational_test.cpp: *L* |regex| libs/regex/build/ gcc-shared.mak: *C* *L* libs/regex/example/timer/ input_script.txt: *C* *L* |regression| tools/regression/build/ Jamfile.v2: *C* *L* tools/regression/detail/ tiny_xml_test.txt: *C* *L* tools/regression/ index.htm: *C* *L* run_tests.sh: *C* *L* tools/regression/test/ test.bat: *C* *L* tools/regression/xsl_reports/ empty_expected_results.xml: *C* *L* tools/regression/xsl_reports/runner/ __init__.py: *C* *L* default.css: *L* instructions.html: *L* instructions.rst: *C* *L* tools/regression/xsl_reports/test/ common.py: *C* *L* expected_results.xml: *C* *L* generate_test_results.py: *C* *L* generate_test_results_v1.py: *C* *L* restrict_to_library.xsl: *C* *L* run_notes_regression.py: *C* *L* run_v1.py: *C* *L* test.py: *C* *L* test_boost_wide_report.py: *C* *L* tools/regression/xsl_reports/ test_results.xsd: *C* *L* tools/regression/xsl_reports/utils/ __init__.py: *C* *L* accept_args.py: *C* *L* char_translation_table.py: *C* *L* check_existance.py: *C* *L* checked_system.py: *C* *L* libxslt.py: *C* *L* log.py: *C* *L* makedirs.py: *C* *L* send_mail.py: *C* *L* sourceforge.py: *C* *L* tar.py: *C* *L* zip.py: *C* *L* tools/regression/xsl_reports/xsl/v2/ expected_to_1_33_format.xsl: *C* *L* |release| tools/release/ utils.py: *C* *L* |serialization| libs/serialization/doc/ style.css: *C* *L* libs/serialization/example/ demo_output.txt: *C* *L* demo_save.xml: *C* *L* demofile.txt: *C* *L* libs/serialization/test/ run_archive_test.bat: *C* *L* runtest.bat: *C* *L* runtest.sh: *C* *L* libs/serialization/vc7ide/ readme.txt: *C* *L* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* weak_ptr.htm: *L* |test| boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/example/ unit_test_example_01.cpp: *C* *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ timer.htm: *L* |tokenizer| libs/tokenizer/ char_delimiters_separator.htm: *L* char_separator.htm: *L* escaped_list_separator.htm: *L* index.html: *L* introduc.htm: *L* offset_separator.htm: *L* token_iterator.htm: *L* tokenizer.htm: *L* tokenizerfunction.htm: *L* |tr1| boost/tr1/ tuple.hpp: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/test/ README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* call_traits.htm: *L* compressed_pair.htm: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* libs/utility/test/ Jamfile.v2: *L* libs/utility/ utility.htm: *L* value_init.htm: *L* value_init_test.cpp: *C* value_init_test_fail1.cpp: *C* value_init_test_fail2.cpp: *C* value_init_test_fail3.cpp: *C* |variant| libs/variant/doc/ Jamfile.v2: *C* *L* biblio.xml: *C* *L* design.xml: *C* *L* introduction.xml: *C* *L* misc.xml: *C* *L* libs/variant/doc/reference/ apply_visitor.xml: *C* *L* bad_visit.xml: *C* *L* concepts.xml: *C* *L* get.xml: *C* *L* recursive_variant.xml: *C* *L* recursive_wrapper.xml: *C* *L* reference.xml: *C* *L* static_visitor.xml: *C* *L* variant.xml: *C* *L* variant_fwd.xml: *C* *L* visitor_ptr.xml: *C* *L* libs/variant/doc/tutorial/ advanced.xml: *C* *L* basic.xml: *C* *L* tutorial.xml: *C* *L* libs/variant/doc/ variant.xml: *L* libs/variant/ index.html: *C* *L* libs/variant/test/ Jamfile.v2: *L*

1 0

Boost regression notification (2006-11-16 [RC_1_34_0])
by Douglas Gregor 16 Nov '06

16 Nov '06

Boost Regression test failures Report time: 2006-11-16T12:36:22Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 203 failures in 22 libraries date_time (2) filesystem (1) graph (2) io (1) iostreams (10) iterator (3) lambda (1) math (24) mpl (3) numeric/interval (2) optional (1) parameter (1) python (119) random (1) regex (4) serialization (9) signals (4) spirit (3) statechart (4) test (6) thread (1) utility (1) |date_time| testduration: borland-5.8.2 testgenerators_dll: gcc-4.1.0_linux |filesystem| fstream_test: msvc-6.5 |graph| adj_list_cc: qcc-3.3.5_gpp bfs: intel-linux-9.0 |io| ios_state_test: borland-5.8.2 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 file_descriptor_test: cw-9.4 finite_state_filter_test: cw-9.4 gzip_test: msvc-7.1 msvc-8.0 mapped_file_test: cw-9.4 newline_test: borland-5.8.2 zlib_test: msvc-7.1 msvc-8.0 |iterator| filter_iterator_test: borland-5.8.2 lvalue_concept_fail: borland-5.8.2 msvc-7.1 |lambda| bind_tests_simple: intel-linux-9.0 |math| common_factor_test: borland-5.8.2 cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6 gcc-3.3.6_linux gcc-3.4.4 gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc hp_cxx-71_006_tru64 intel-linux-9.0 intel-vc71-win-9.1 intel-vc8-win-9.1 msvc-6.5 msvc-7.0 msvc-7.1 msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 |mpl| int: borland-5.8.2 integral_c: borland-5.8.2 size_t: borland-5.8.2 |numeric/interval| mul: borland-5.8.2 test_float: borland-5.8.2 |optional| optional_test: borland-5.8.2 |parameter| python_test: msvc-8.0 |python| andreas_beyer: msvc-7.0 msvc-8.0 args: msvc-7.0 msvc-8.0 auto_ptr: msvc-7.0 msvc-8.0 back_reference: msvc-7.0 msvc-8.0 ben_scott1: msvc-7.0 msvc-8.0 bienstman1: msvc-7.0 msvc-8.0 bienstman2: msvc-7.0 msvc-8.0 bienstman3: msvc-7.0 msvc-8.0 builtin_converters: msvc-7.0 msvc-8.0 callbacks: msvc-7.0 msvc-8.0 const_argument: msvc-7.0 msvc-8.0 crossmod_exception: msvc-7.0 msvc-8.0 crossmod_opaque: msvc-7.0 msvc-8.0 data_members: msvc-7.0 msvc-8.0 defaults: msvc-7.0 msvc-8.0 dict: msvc-7.0 msvc-8.0 docstring: msvc-7.0 msvc-8.0 enum: msvc-7.0 msvc-8.0 exception_translator: msvc-7.0 msvc-8.0 extract: msvc-7.0 msvc-8.0 implicit: msvc-7.0 msvc-8.0 injected: msvc-7.0 msvc-8.0 iterator: msvc-7.0 msvc-8.0 keywords: msvc-7.0 msvc-8.0 list: msvc-7.0 msvc-8.0 long: msvc-7.0 msvc-8.0 map_indexing_suite: msvc-7.0 msvc-8.0 minimal: msvc-7.0 msvc-8.0 multi_arg_constructor: msvc-7.0 msvc-8.0 nested: msvc-7.0 msvc-8.0 numpy: msvc-7.0 msvc-8.0 object: msvc-7.0 msvc-8.0 opaque: msvc-7.0 msvc-8.0 operators: msvc-7.0 msvc-8.0 pearu1: msvc-7.0 msvc-8.0 pickle1: msvc-7.0 msvc-8.0 pickle2: msvc-7.0 msvc-8.0 pickle3: msvc-7.0 msvc-8.0 pickle4: msvc-7.0 msvc-8.0 pointer_vector: msvc-7.0 msvc-8.0 polymorphism: msvc-7.0 msvc-8.0 polymorphism2: msvc-7.0 msvc-8.0 polymorphism2_auto_ptr: darwin-4.0.1 intel-vc8-win-9.1 msvc-6.5 msvc-7.0 msvc-8.0 properties: msvc-7.0 msvc-8.0 raw_ctor: msvc-7.0 msvc-8.0 return_arg: msvc-7.0 msvc-8.0 shared_ptr: msvc-7.0 msvc-8.0 slice: msvc-7.0 msvc-8.0 staticmethod: msvc-7.0 msvc-8.0 stl_iterator: msvc-7.0 msvc-8.0 str: msvc-7.0 msvc-8.0 test_pointer_adoption: msvc-7.0 msvc-8.0 try: msvc-7.0 msvc-8.0 tuple: msvc-7.0 msvc-8.0 vector_indexing_suite: msvc-7.0 msvc-8.0 virtual_functions: msvc-7.0 msvc-8.0 voidptr: msvc-7.0 msvc-8.0 wrapper_held_type: msvc-7.0 msvc-8.0 |random| random_test: intel-linux-9.0 |regex| regex_regress: borland-5.8.2 regex_regress_dll: borland-5.8.2 regex_regress_threaded: borland-5.8.2 test_grep: msvc-6.5 |serialization| test_derived_class_binary_archive_dll: msvc-8.0 test_null_ptr_text_warchive_dll: msvc-8.0 test_reset_object_address: msvc-7.0 test_reset_object_address_dll: msvc-7.0 test_utf8_codecvt: borland-5.8.2 test_variant_xml_archive: borland-5.8.2 test_variant_xml_archive_dll: borland-5.8.2 test_variant_xml_warchive: borland-5.8.2 test_variant_xml_warchive_dll: borland-5.8.2 |signals| deletion_test: msvc-6.5 ordering_test: msvc-6.5 signal_n_test: msvc-6.5 trackable_test: msvc-6.5 |spirit| switch_tests_single_debug: intel-linux-9.0 symbols_add_null: msvc-7.1 symbols_add_null_debug: msvc-7.1 |statechart| TransitionTestBoth: qcc-3.3.5_gpp qcc-3.3.5_gpp TransitionTestRelaxed: qcc-3.3.5_gpp qcc-3.3.5_gpp |test| boost_check_equal_str: borland-5.8.2 msvc-7.1 test_case_template_test: borland-5.8.2 test_fp_comparisons: cw-9.4 test_tools_test: borland-5.8.2 msvc-7.1 |thread| test_tss_lib: borland-5.8.2 |utility| operators_test: gcc-3.4.5_linux_x86_64

1 0

Re: [boost] I think using spinlocks to simulate an atomicshared_ptr...
by Talbot, George 16 Nov '06

16 Nov '06

Thanks for looking at that. I was also thinking--does enable_shared_from_this need to have an "enable_atomic_from_this" version? That would also imply an atomic_weak type. -- George T. Talbot <gtalbot(a)locuspharma.com> > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Peter Dimov > Sent: Wednesday, November 15, 2006 11:42 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] I think using spinlocks to simulate an > atomicshared_ptr... > > Sorry for the brief response, no time... > > Talbot, George wrote: > > > 2) Without any sort of 2-pointer-wide atomic assignment in hardware, > > operator= really looks like this: > > > > lock the source pointer > > make a local copy of it > > release the source pointer > > > > lock the destination > > set the value of the destination from the copy > > unlock the destination > > > > This won't deadlock, but has to make an extra copy of the pointer > > locally. > > There's no extra copy. shared_ptr::operator= does: > > shared_ptr( r ).swap( *this ); > > and the above does: > > lock source > shared_ptr tmp( src ); > unlock > > lock dest > dest.swap( tmp ); > unlock > > so the two are equivalent (modulo spinlock order). > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] Asio multithreaded server
by berserker_r 16 Nov '06

16 Nov '06

Christopher Kohlhoff wrote: > Anyway, I have just committed a fix to CVS head for this. If you > want to patch your own copy with a temporary fix, make the > following change to asio/detail/win_iocp_io_service.hpp: > // Constructor. > win_iocp_io_service(asio::io_service& io_service) > : asio::io_service::service(io_service), > - iocp_(::CreateIoCompletionPort(INVALID_HANDLE_VALUE, 0, 0, 0)), > + iocp_(::CreateIoCompletionPort(INVALID_HANDLE_VALUE, 0, 0, ~0)), > outstanding_work_(0), > interrupted_(0), > shutdown_(0) I have tried the patch but with no success...do I need any change to server.cpp file in order to make it works? Do I need a per session io_service? Thanks again

1 0

Re: [boost] Asio multithreaded server
by Christopher Kohlhoff 16 Nov '06

16 Nov '06

berserker_r <berserker_r(a)hotmail.com> wrote: > Christopher Kohlhoff wrote: > > What OS are you using? Is the session's work CPU bound? > > I'm on Windows XP, Great, that confirmed what I suspected was the cause of the problem. > sry but I can't understand what you mean with the second > question... "CPU bound" means that the thing that the code doesn't perform any blocking I/O or other operation that might cause the thread to sleep for a time. Anyway, I have just committed a fix to CVS head for this. If you want to patch your own copy with a temporary fix, make the following change to asio/detail/win_iocp_io_service.hpp: // Constructor. win_iocp_io_service(asio::io_service& io_service) : asio::io_service::service(io_service), - iocp_(::CreateIoCompletionPort(INVALID_HANDLE_VALUE, 0, 0, 0)), + iocp_(::CreateIoCompletionPort(INVALID_HANDLE_VALUE, 0, 0, ~0)), outstanding_work_(0), interrupted_(0), shutdown_(0) Cheers, Chris

2 1

Re: [boost] [system] Was: Re: [asio] Breaking changescommittedtocvs HEAD
by Christopher Kohlhoff 16 Nov '06

16 Nov '06

Hi Johan, Johan Nilsson <r.johan.nilsson(a)gmail.com> wrote: > I'd be happy enough if such wrappers would be documented and > existed in <boost/system/convenience.hpp> or similar. Here's the sort of convenience wrapper that I would be happy to see (just a 4-argument Windows version that I hacked up): template < typename R, typename A1, typename A2, typename A3, typename A4> R system_call(R (__stdcall *f)(A1, A2, A3, A4), typename boost::mpl::identity<A1>::type a1, typename boost::mpl::identity<A2>::type a2, typename boost::mpl::identity<A3>::type a3, typename boost::mpl::identity<A4>::type a4, boost::system::error_code& ec, typename boost::mpl::identity<R>::type failure_retval = R()) { R r = f(a1, a2, a3, a4); if (r == failure_retval) { DWORD last_error = ::GetLastError(); ec = boost::system::error_code( last_error, boost::system::native_ecat); } else { ec = boost::system::error_code(); } return r; } template < typename R, typename A1, typename A2, typename A3, typename A4> R system_call(R (__stdcall *f)(A1, A2, A3, A4), typename boost::mpl::identity<A1>::type a1, typename boost::mpl::identity<A2>::type a2, typename boost::mpl::identity<A3>::type a3, typename boost::mpl::identity<A4>::type a4, typename boost::mpl::identity<R>::type failure_retval = R()) { boost::system::error_code ec; R r = system_call(f, a1, a2, a3, a4, ec, failure_retval); if (ec) throw boost::system::system_error(ec); return r; } And you can use it like this: system_call(::MessageBox, hwnd, "A", "B", MB_OK); or: boost::system::error_code ec; system_call(::MessageBox, hwnd, "A", "B", MB_OK, ec); It seems pretty convenient to use, does not have the issues with thread-specific error codes that I am concerned about, and provides a portable interface over the top of platform-specific error handling APIs. It'll even save people from making the error of forgetting to set the error_code out parameter 'ec'. Cheers, Chris

1 0

Re: [boost] Asio multithreaded server
by berserker_r 16 Nov '06

16 Nov '06

Christopher Kohlhoff wrote: > What OS are you using? Is the session's work CPU bound? I'm on Windows XP, sry but I can't understand what you mean with the second question... Just take your sample in "server.cpp": I need to be able to change the code (in the session or server object, dunno where...) so that the server is always free to accept (and process) a new connections even if there are one or more active sessions taking a very long time to generate and send theirs response. For example: void Session::handle_read(const asio::error_code& err, size_t length) { --op_count_; if (!err) { read_data_length_ = length; ++unsent_count_; if (unsent_count_ == 1) { very_very_long_operation(); // Process the client request op_count_ += 2; std::swap(read_data_, write_data_); async_write(socket_, buffer(write_data_, read_data_length_), strand_.wrap( boost::bind(&session::handle_write, this, placeholders::error))); socket_.async_read_some(buffer(read_data_, block_size_), strand_.wrap( boost::bind(&session::handle_read, this, placeholders::error, placeholders::bytes_transferred))); } } if (op_count_ == 0) io_service_.post(boost::bind(&session::destroy, this)); } Session::very_very_long_operation() takes a lot of time I need in the meanwhile to be able in the server to accept new connections, how can I do that? I tried calling ios.run() from multiple threads as the documentation said but the server is always locked until the session's operation is completed... P.S.: be patient plz my english is not very good

1 0

Boost.Test feature request
by John Maddock 16 Nov '06

16 Nov '06

I have a couple of annoying issues with Boost.Test's output on failed tests: 1) The printing code doesn't restore the iostream's original precision after it's changed it for formatted output. It's a minor issue but very annoying at times :-) Looks trivial to patch in print_log_value as well? 2) If the type has no numeric_limits support, say if it's a composite type, like std::complex<double> then you don't get enough digits to tell what the problem is. Could the code default to whatever digits long-double has? Again a minor change to print_log_value (in my experience std lib's ignore requests for more digits than a type really has anyway, so it should be harmless?). 3) If a BOOST_CHECK_CLOSE fails, you get the two values, but not what the % difference between them was. And it's the % difference that matters :-) I know this has come up before, but it's still bugging me. Here's the problem: if the type is say a 128-bit long double then you get two very long 35-digit numbers printed out: which have two many digits for the average calculator, so you can't even calculate the % difference manually to see how far off you were! Many thanks, John.

10 19

[fusion] comparing iterators with is_same?
by Steven Watanabe 16 Nov '06

16 Nov '06

AMDG In accumulate and fold I see is_same< typename result_of::begin<Sequence const>::type , typename result_of::end<Sequence const>::type>() shouldn't this be result_of::equal_to<...>()? In Christ, Steven Watanabe

1 0

Re: [boost] [BLL] Nesting STL algorithms and mutable iterators
by Steven Watanabe 16 Nov '06

16 Nov '06

AMDG MuTPu4 wrote: > While using standart algorithm wrappers (::boost::lambda::ll) I find out > that > there is no way to call non-constant versions of begin/end without defining > new > helper functors in the user code. In other words, algorithms like ll::sort > as- > is are unusable. > I think it would be nice to add a pair of non-const helper functors, i.e. > call_mutable_begin and call_mutable_end to the library. > Perhaps deducing the iterator type from the constness of the parameter would be even better? template<class T> struct get_iterator { typedef typename T::iterator type; }; template<class T> struct get_const_iterator { typedef typename T::const_iterator type; }; struct call_begin { template<class Args> struct sig { typedef typename boost::tuples::element<1, Args>::type arg_type; typedef typename boost::mpl::eval_if<boost::is_const<arg_type>, get_const_iterator<arg_type>, get_iterator<arg_type> >::type type; }; template<class T> typename T::iterator operator()(T& t) const { return(t.begin()); } template<class T> typename T::const_iterator operator()(const T& t) const { return(t.begin()); } }; In Christ, Steven Watanabe

1 0

Re: [boost] Review Request: Boost Exception
by Matthew Herrmann 15 Nov '06

15 Nov '06

> > Message: 9 > Date: Tue, 14 Nov 2006 18:06:03 -0800 > From: "Emil Dotchevski" <emildotchevski(a)hotmail.com> > Subject: Re: [boost] Review Request: Boost Exception > To: <boost(a)lists.boost.org> > Message-ID: <BAY125-DAV966A5057842FC29C1782BD4EA0(a)phx.gbl> > Content-Type: text/plain; format=flowed; charset="iso-8859-1"; > reply-type=original > >> > >> > No, that's not quite what I meant. >> > >> > void tag_exception(boost::exception& x) >> > { >> > // do something to x >> > } >> > >> > void read_file() >> > { >> > boost::adorn_exception e( boost::bind( tag_exception, _1 ) ); >> > ... >> > } >> > > Could you provide more detail on the "do something to x" part? It seems to > me that it would require something similar to the boost::exception::pimpl > class, in that it must be able to store arbitrary values, but unlike > boost::exception::pimpl it would have to keep some kind of proxy for each > stored object, to be evaluated later if something throws. > > Wouldn't that amount to executing a lot of code and using a lot of storage, > even if nothing throws? Here's how it would work: > void tag_exception(boost::exception& x, std::string* filename) > { > // append filename tag to exception here > } > > void read_file(const std::string& filename) > { > boost::adorn_exception e( boost::bind( tag_exception, _1, &filename) ); > ... > } There is a (small) fixed cost of creating the functor for boost::bind and copying the pointer. By using pointers (or references, though the syntax is heavier), you avoid hidden copy-construction costs. Since boost::adorn_exception has to be declared after the variables it refers to, the pointers will still be valid when it is destroyed. Regards, Matthew Herrmann

1 0