- Boost - lists.boost.org

[constrained] constrained_vector
by Neal Becker 09 Feb '09

09 Feb '09

I'm interested in something like constrained, but applied to a vector of values. The case I'm interested in is a homogeneous vector of bounded int values, with bounds set at runtime. It is trivial to have a vector<bounded<int> >, but this would not be space efficient in the case where the policies, bounds on all the values are the same. I'm thinking that maybe some parts of constrained (such as policies) could be reused, independent of the rest of constrained. Has anyone looked into the idea of constrained vector?

3 4

[1.38.0] beta 2 release candidate
by Beman Dawes 09 Feb '09

09 Feb '09

The beta 1 release candidate from earlier in the week had enough issues that I decided not to push it out to sourceforge. Most (all?) of those issues have been corrected, and a new release candidate is up at http://boost.cowic.de/rc/ If no showstoppers surface I plan to move this beta to sourceforge tomorrow (Friday) and announce it here, the users list, and the announce list. The final 1.38.0 release would then come about week later. There are pending bug fixes for Boost.Python and Boost.Asio that are not in the beta but Dave and Chris are planning to have ready for the final release. --Beman

10 28

[constrained_value] Review version
by Robert Kawulak 09 Feb '09

09 Feb '09

Hi all, I've made some minor changes to the Boost Constrained Value library: - reorganized the structure of header files, - renamed saturating/saturating_int into clipping/clipping_int, - using boost::swap where applicable (if you don't have it, you need to get it from http://svn.boost.org/svn/boost/branches/release/boost/utility/swap.hpp) - made no_constraint policy public, - now the stream operators are not defined if BOOST_NO_IOSFWD macro is defined, - fixed identifiers containing "__" (not allowed by C++), - fixed minor language errors in the docs. The library is ready for the formal review, which starts this monday (1.12). It is only missing the detailed regression tests, which will be added after the review. Currently the examples file (libs\constrained_value\doc\src\examples.cpp) can be used instead -- it uses most of the functionality of the library and should compile and run returning 0. As usually, the code and documentation can be downloaded here: http://rk.go.pl/f/constrained_value.zip The documentation is also available online here: http://rk.go.pl/r/constrained_value Any comments and problem reports for platforms that has not been tested yet are very welcome. Best regards, Robert Kawulak -=##############=- "I know not with what weapons World War III will be fought, but World War IV will be fought with sticks and stones." - Albert Einstein

3 4

[constrained_value] serialization
by Neal Becker 09 Feb '09

09 Feb '09

constrained_value does not currently support serialization. 1. Should it be added to the lib? 2. What would be a suggested implementation?

3 5

[threadpool] new version - supporting future library (C++0x) from Anthony Williams
by k-oli＠gmx.de 09 Feb '09

09 Feb '09

Hello, I've uploaded a new version of boost.threadpool (v17) at http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-…. It uses the future implementation of Anthony Williams (C++0x - available at http://www.justsoftwaresolutions.co.uk/files/n2561 future.hpp). Please save it as file 'future'. best regards, Oliver

3 10

[interthreads] Library under development v0.4
by vicente.botet 09 Feb '09

09 Feb '09

Hi, I have just released the version 0.4, which includes since my last publicly announced version 0.3.0: Version 0.4.0, Fevrary 8, 2009 Improvements + bug fixes New Features: * New free functions for all the AsynchronousCompletionToken operations, providing a higher degree of freedom. * Missing have_all_values(), have_all_exception() and are_all_ready() functions on AsynchronousCompletionToken fusion tuples. * get_all: getting all the values from a tuple of AsynchronousCompletionToken works now. * fork_after overloaded for a single dependency * wait_all overloaded for a single ACT. * wait_for_all evaluate one of its elements on the current thread * No need to use wait_and_get() on thread_specific_shared_ptr<> to synchronize with the decoration if the thread is created using a AsynchronousExecutor decorator. In this case the synchro is done before returning the AsynchronousCompletionToken. See the tutorial and the mono_thread_id example. Fixed Bugs: v0.2#1: ae::get_all do not work yet. get_all() do not work because fusion transform sequence function can not take non const sequences. I have emulated it using set_all() and a transformation for a tuple of _ACT to a tuple of result_type. v0.3.1#1: keep alive mechanism crash when setting set_on_dead_thread() before enabling the mechanism. This was due to the fact that there were no default data for the backup. v0.3.1#2: keep alive mechanism do not detect dead threads. We need to reset the counters only when the period is 0. v0.3.1#3: The set_on_dead_thread() setting is not recovered by embeeding kep_alive enablers/disablers. The problem is that the on_dead() the function and the thread pointer were stored on the backup. It is enough to store them on the thread_keep_alive_ctx and make the functions thread_safe. Version 0.3.1, January 25, 2009 bug fixes Fixed Bugs: v0.3#3: scheduler::do_test_fork_after_wait do not work yet. To solve this issue it enough to define boost::move for tp::task v0.3#2: scheduler::do_test_fork_after_get do not work yet. To solve this issue it enough to define boost::move for tp::task v0.3#1: scheduler::do_test_wait_for_any do not work yet. Not reproductible v0.2#2: Some trouble with the use of tp::pool directly, use scheduler instead. Four issues. The parameter to fork on tp:pool was a const F& instead of a F. Direct use of fork_all resolved for the other AsynchronousExecutor by ADL, which could not be the case for the tp::pool. fork specialization for tp::pool incorrect. use of the default handle instead of asynchronous_completion_token traits class For those who don't know the library yet here are some of its features: * An asynchronous execution framework working with AsynchronousExecutor and AsynchronousCompletionToken. It includes some generic functions working on AsynchronousExecutor and AsynchronousCompletionToken concepts: * fork and fork_all to execute functions asynchronously. * fork_after: request an AsynchronousExecutor to execute a function asynchronously once each one of AsynchronousCompletionToken in the dependency tuple parameter are ready. It is similar to the async_with_dependencies proposed Peter Dimov. * generic wait_for_all, wait_for_any to execute asynchronously functions and wait for the completion of all or any of them. * generic get, join, ... free functions to synchroyze on an AsynchronousCompletionToken * generic get_all, join_all, ... free functions to synchroyze on multiple AsynchronousCompletionTokens * Some AsynchronousExecutors and AsynchronousCompletionTokens models * basic_threader: can be seen as a thread factory executing asynchronously a function on the returned thread. * launchers: Lanchers can be seen as a future factory executing asynchronously a function on a hiden thread. * threader/joiner: A Threader runs a unary function in its own thread. A Threader can be seen as a Joiner factory executing asynchronously a function on a thread encapsulated on the returned Joiner. The joiner is used to synchronise with and pick up the result from a function or to manage the encapsulated thread. * tp::pool and tp::task customization as an AsynchronousExecutor and an AsynchronousCompletionToken respectively. tp::pool can be seen as a tp::task factory executing asynchronously a function on a pool of threads. a generic asynchronous_executor_decorator which allows to decorate the function to be evaluated asynchronously. * Some thread extension * A thread_decoration class allowing to define setup/cleanup functions which will be called only once by thread (if the thread function is decorated with thread_decorator): setup before the thread function and cleanup at thread exit. It is used together with asynchronous_executor_decorator * A thread_decorator/thread_decorate class/function which decorate a thread function in order to call the setup and the cleanup of all the thread_decorations. * A thread specific shared pointer which is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * A thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. The library is available at Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/interthreads and Boost Vault: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=intert… Includes every thing on the Sandbox + Html documentation + Boost.Futures + Boost.ThreadPool adaptations I'd appreciate it if people could take a look, test it on their compiler and give me some feedback. Best regrads, Vicente Juan Botet Escribá

1 0

[1.38][any][thread] Release notes
by Daniel James 08 Feb '09

08 Feb '09

Hi, I've added release notes for these libraries. I don't really know the story behind these changes, so if the libraries' maintainers or an interested user wants to check them, they're at: http://beta.boost.org/users/news/version_1_38_0#version_1_38_0.updated_libr… thanks, Daniel

5 5

[1.38] CMake support added to release branch?
by John Maddock 08 Feb '09

08 Feb '09

I see from the 1.38 news section that experimental CMake support has been added to the release: I thought we were going to have a review before this happened? John Maddock.

8 11

function dispatch mismatch in graph_traits
by Sandeep Gupta 08 Feb '09

08 Feb '09

Hi, I am having trouble making leda_graph wrapper for GRAPH<vtype, etype> class. In leda_graph.hpp the wrapper is defined as template<class vtype, class etype> ... vertices(const leda::GRAPH<vtype, etype>& g) { do_something; } Given this definition the right (and only way i think) to invoke it by expression vertices<vtype, etype>(G) My problem is that all internal graph routines invoke the function by expression vertices(G) I would appreciate any ideas about how can i redirect vertices(G) to vertices<vtype, etype>(G) where vtype = vrec etype = erec G = leda::GRAPH<vrec, erec> I am afraid that i might have to rewrite a wrapper for specifically leda::GRAPH<vrec, erec>. Can this be avoided. Thanks sandeep

2 2

Review Request: Boost.Log
by Andrey Semashev 08 Feb '09

08 Feb '09

Hi, I'd like to ask for a formal review for the Boost.Log library. The archive with the library source code, tests and docs is available in the Vault: http://tinyurl.com/cm9lum The online docs are also available on the SourceForge page: http://boost-log.sourceforge.net The latest code snapshot can be downloaded from CVS on the SourceForge project page: http://sourceforge.net/projects/boost-log

1 0