- Boost-users - lists.boost.org

Invitation to connect on LinkedIn
by Shon Pritchett 26 May '10

26 May '10

LinkedIn ------------Shon Pritchett requested to add you as a connection on LinkedIn: ------------------------------------------ Hermann, I'd like to add you to my professional network on LinkedIn. - Shon Accept invitation from Shon Pritchett http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… View invitation from Shon Pritchett http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… ------------------------------------------ DID YOU KNOW you can be the first to know when a trusted member of your network changes jobs? With Network Updates on your LinkedIn home page, you'll be notified as members of your network change their current position. Be the first to know and reach out! http://www.linkedin.com/ ------ (c) 2010, LinkedIn Corporation

1 0

Review Wizard Report for May 2010
by Ronald Garcia 26 May '10

26 May '10

============================================== Review Wizard Status Report for May 2010 ============================================== News ==== Boost 1.42 Released New Libraries: UUID Revised Libraries: Asio, Circular Buffer, Fusion, Graph, Integer, Iostreams, Program.Options, Property Map, Proto, Regex, Spirit, Unordered, Xpressive Meta State Machine (MSM) Library Accepted Boost 1.43 Released New Libraries: Functional/Factory, Functional/Forward Revised Libraries: Range, Accumulators, Array, Asio, Fusion, Iostreams, Multi-index Containers, Proto, Random, Spirit, Thread, Unordered, Uuid, Wave, Xpressive Open Issues =========== The Constrained Value Library was reviewed in December 2008 but no review result has been reported. We would appreciate it if someone who knows the review manager, Jeff Garland, could contact him. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Time Series (accepted August 2007). * Floating Point Utilities (accepted March 2008). * Futures (accepted April 2009). * Polygon Library (accepted November 2009). * Geometry Library (accepted November 2009). * Meta State Machine (accepted January 2010). The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Switch (accepted provisionally January 2008) * Phoenix (accepted provisionally September 2008) General Announcements ===================== As always, we need experienced review managers. The review queue has grown substantially but we have few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. The included review queue isn't a classic queue. It is more an unordered list of the libraries awaiting review. As such, any library in the queue can be reviewed once the developer is ready and a review manager works with the wizards and the developer to schedule a review. It is not FIFO. Review Queue ============ * Lexer * Shifted Pointer * Logging * Join * Pimpl * Task * Endian * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert * Containers * Type Traits Extensions * Interthreads * Bitfield * Lockfree * Fiber * Chrono * Sequence Properties * Static Size Linear Algebra * Locale -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… >`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… >`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Task ---- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: Formerly called Thread Pool The library provides: * thread creation policies: * determines the management of worker threads: * fixed set of threads in pool * create workerthreads on demand (depending on context) * let worker threads ime out after certain idle time * channel policies: manages access to queued tasks: * bounded channel with high and low watermark for queuing tasks * unbounded channel with unlimited number of queued tasks * rendezvous syncron hand-over between producer and consumer threads * queueing policy: determines how tasks will be removed from channel: * FIFO * LIFO * priority queue (attribute assigned to task) * smart insertions and extractions (for instance remove oldest task with certain attribute by newest one) * tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). * returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :Description: Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co… >`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al… >`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip >`__ :Description: I/O extension for boost::gil which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <http://www.cs.aau.dk/~nesotto/boost/ auto_buffer.zip>`__ :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Containers ---------- :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… :Documentation: http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h… :Description: Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that comply with C++03. Type Traits Extensions -------------------------- :Author: Frederic Bron :Review Manager: Needed :Download: http://svn.boost.org/trac/boost/browser/sandbox/type_traits :Description: The purpose of the addition is to add type traits to detect if types T and U are comparable in the sense of <, <=, >, >=, == or != operators, i.e. if t<u has a sens when t is of type T and u of type U (same for <=, >, >=, ==, !=). The following traits are added: is_equal_to_comparable<T,U> is_greater_comparable<T,U> is_greater_equal_comparable<T,U> is_less_comparable<T,U> is_less_equal_comparable<T,U> is_not_equal_to_comparable<T,U> The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard). The code has the following properties: * returns true if t<u is meaningful and returns a value convertible to bool * returns false if t<u is meaningless. * fails with compile time error if t<u is meaningful and returns void (a possibility to avoid compile time error would be to return true with an operator, trick but this has little sens as returning false would be better) InterThreads ------------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in… >`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this 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. * 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. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. Bitfield --------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: http://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at http://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.html :Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… ; :Documentation: http://tim.klingt.org/boost_lockfree/ :Description: boost.lockfree provides implementations of lock-free data structures. lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. boost.lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack the code is available from from my personal git repository: * git://tim.klingt.org/boost_lockfree.git * http://tim.klingt.org/git?p=boost_lockfree.git Fiber ----- :Author: Oliver Kowalke :Review Manager: Needed Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… ; :Description: C++ Library for launching fibers (micro-threads) and synchronizing data between the fibers. Chrono ------ :Author: Vicente Botet :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=ch… ; :Documentation: http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht… . :Description: The Boost Chrono library provides: The C++0x Standard Library's common_type. The C++0x Standard Library's compile-time rational arithmetic. The C++0x Standard Library's time utilities, including: Class template duration Class template time_point Clocks: system_clock monotonic_clock high_resolution_clock typeof registration for classes duration and time_point Process clocks: process_real_CPU_clocks, capturing real-CPU times. process_user_CPU_clocks, capturing user-CPU times. process_system_CPU_clocks, capturing system-CPU times. process_cpu_clock, tuple-like class capturing at once real, user- CPU, and system-CPU times. Stopwatches: stopwatch, capturing elapsed Clock times. stopwatch_accumulator, capturing cummulated elapsed Clock times. scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. Stopclocks or Stopwatch reporters: stopwatch_reporter, convenient reporting of models of Stopwatch results. stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Support wide characters for stopwatch formatters Sequence Properties ------------------- :Author: Grant Erickson :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=cr… :Description: The creasing algorithm templates define four template functions for determining the order properties of sequences, specifically: * Increasing * Decreasing * Strictly Increasing * Strictly Decreasing The implementation is a fairly trivial composition of the STL adjacent_find, not2 and {greater,less,greater_equal,less_equal}. For the purposes of sequence ordering validation, using these templates is more efficient and straightforward than creating a temporary, sorted version of some sequence and comparing it against the original sequence. Example: :: bool CheckPoints(const Points & inPoints) { const bool strictlyIncreasing = is_strictly_increasing(inPoints.begin(), inPoints.end()); if (!strictlyIncreasing) { cerr << "Points must be in increasing order with " "no duplicate values." << endl; } return strictlyIncreasing; } Static Size Linear Algebra -------------------------- :Author: Emil Dotchevski :Review Manager: Needed :Download: :Description: Locale ------ :Author: Artyom Beilis :Review Manager: Needed :Download: https://sourceforge.net/projects/cppcms/files/boost_locale/boost_locale_for… :Description: Boost.Locale is powerful localization library that provides powerful localization tool extending existing built-in C++ localization facilities in Unicode aware way. Libraries under development =========================== Persistent ---------- :Author: Tim Blechmann :Description: A library, based on Boost.Serialization, that provides access to persistent objects with an interface as close as possible to accessing regular objects in memory. * object ownership concepts equivalent to the ones used by Boost.SmartPtr: shared, weak, scoped (and raw) * ACID transactions, including recovery after a crash and "Serializable" isolation level * concurrent transactions, nested transactions, distributed transactions * concurrent access containers: STL containers whose nodes are implemented as persistent objects and can be accessed without moving the container to memory. Concurrent transactions modifying the container are only repeated in the rare cases the same container node is changed simultanisouly by 2 threads. * extensible by other transactional resources, e.g. an object relational mapper based on the upcoming Boost.Rdb library. Multiple resources can be combined to one database, with distributed transactions among them. Please let us know of any libraries you are currently developing that you intend to submit for review. See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Problem with signals2 and shared_ptr
by Glenn Macgregor 26 May '10

26 May '10

Hi All, I am using boost 1.41.0 on Windows with Visual Studio 2008 and am seeing what seems to be an issue with signals2 and shared_ptr. The problem is that the shared_ptr does not decrement is reference count after I disconnect the signals2::connection. This is probably best illustrated with some code. ===== Test.h===== #ifndef _CLASS1_H #define _CLASS1_H #include <boost/signals2/signal.hpp> #include <boost/smart_ptr.hpp> class Callee : public boost::enable_shared_from_this<Callee> { public: Callee() : mInt(0) {}; virtual ~Callee() {}; void func1() { mInt++; }; private: int mInt; }; class Caller { public: typedef boost::signals2::signal<void (boost::shared_ptr<Callee>)> OnRun; public: Caller() : mOnRun() {}; ~Caller() {}; void run(boost::shared_ptr<Callee> sp) { boost::signals2::connection conn = mOnRun.connect(boost::bind(&Callee::func1, sp)); _sleep(1000); conn.disconnect(); }; private: OnRun mOnRun; }; #endif ===== End Test.h===== ======main.cpp====== int main(int argc, char **argv) { Caller caller; { boost::shared_ptr<Callee> sp(new Callee); caller.run(sp); } } ======End main.cpp====== Running this in the debugger I would expect to hit a breakpoint in the Callee class before the Caller class, this is not the case I destruct Caller before Callee. Having dug in a bit I see the use_count of the shared pointer go to 2 while in the caller.run which I would expect. The strange thing is the use_count does not decrement after the disconnect or exiting the caller.run function. Is there a way to force the connection/signal to release that shared_ptr? Thanks Glenn

2 1

lambda::bind with A::method throw (char*)
by Archie14 26 May '10

26 May '10

I have a problem compiling this: class A { public: void method(); void methodwiththrow() throw (char*); }; std::vector<A*> lst; // compiles OK. std::for_each (lst.begin(), lst.end(), boost::lambda::bind(&A::method, boost::lambda::_1)); // compile fails. std::for_each (lst.begin(), lst.end(), boost::lambda::bind(&A::methodwiththrow, boost::lambda::_1)); What might be the reason?

1 0

[ASIO|Thread] Advice for removing MFC/ afxwin.h dependancies
by smbrown＠teledyne.com 26 May '10

26 May '10

Hi all, I've inherited a windows C++ application which I've extended and that I'm now preparing for porting to Linux. I'm going through the app removing any MFC code replacing it with standard C++. I use Boost asio and thread and they seem to be requiring me to include afxwin.h before any boost includes or it won't build complaining that Winsock.h or Windows.h has alreday been included. I can bodge around those errors, but then the code doesn't link as new and delete have already been referenced from an afx lib. Is there any general advice for Boost/MFC coexistance or MFC removal? Thanks, Simon ++++ IMPORTANT NOTICE ++++ This email may contain confidential information and will be protected by copyright. It is intended only for the use of the person(s) to whom it is addressed and any unauthorised use (including forwarding or dissemination the contents) may be unlawful. If you receive this email by mistake, please advise the sender immediately by using the reply facility on your email software and delete the email from your computer. Opinions, conclusions and other information in this email that do not relate to the official business of this organisation shall be understood as neither given nor endorsed by it. If this message forms part of a quotation for the supply of goods, the quotation is an invitation to treat only. No contract will come into effect until the Company issuing such quotation issues an acknowledgment of order for the supply of such goods. The contract will be on the terms of such acknowledgment of order. ------------------------------------------------------------------------ Teledyne Defence Limited phone: +44 (0) 1274 531602 web: www.teledynedefence.co.uk ------------------------------------------------------------------------

3 9

boost::asio::deadline_timer::expires_at() seems to have a bug
by Hite, Christopher 26 May '10

26 May '10

See the #if below. I'm pretty sure these should do the same thing. The expires_from_now() version does what I'd expect and calls onTimer() once a second. The expires_at() version never calls onTimer(). Even though 'expires_at() const' returns 1s from now: doit now =2010-May-21 15:07:24.882854 expires_at =2010-May-21 15:07:25.882854 <and nothing more> //********************************************************************** *********** #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> using std::cout; using namespace boost::asio; using namespace boost::posix_time; io_service ioService; deadline_timer timer(ioService); seconds s1(1); void doit(); void onTimer(const boost::system::error_code&){ doit(); //repeat forever } void doit(){ ptime now=microsec_clock::local_time(); cout<< "doit now ="<< now <<std::endl; #if 0 timer.expires_from_now(s1); //works #else timer.expires_at( now+s1); //doesn't work #endif timer.async_wait( onTimer ); cout<< "expires_at ="<< timer.expires_at()<< std::endl ; } void timerTest(){ doit(); io_service::work w(ioService); ioService.run(); } int main(){ timerTest(); return 0; }

2 2

[preprocessor] one comma too many
by Manfred Doudar 26 May '10

26 May '10

Hello, Near sure this is trivial, but I don't see it, and hope someone might point out the obvious: #include <boost/preprocessor/iteration/local.hpp> #include <boost/preprocessor/repetition.hpp> #include <boost/preprocessor/repetition/enum_params.hpp> #define OPERATOR(z, n, _) \ \ BOOST_PP_ENUM_PARAMS(n, T r) /**/ #define BOOST_PP_LOCAL_MACRO(n) OPERATOR(_, n, _) #define BOOST_PP_LOCAL_LIMITS(1, 3) #include BOOST_PP_LOCAL_ITERATE() #undef BOOST_PP_LOCAL_MACRO #undef BOOST_PP_LOCAL_LIMITS #undef OPERATOR ..The above works as expected: T r0 T r0, T r1 T r0, T r1, T r2 However, I would like to replace "T" with the following instead: std::pair<T, T> ie: I want to write something to the effect of: BOOST_PP_ENUM_PARAMS(n, std::pair<T, T> r) Of course, BOOST_PP_ENUM_PARAMS now sees one too many arguments, and errors. Any ideas on how to achieve this would be most appreciated. With thanks in advance, -- Manfred

3 3

Exception on windows::stream_handle!
by Lloyd 26 May '10

26 May '10

Hello, We are trying to create a "windows::stream_handle" from a native Windows HANDLE. But it throws an exception with "The parameter is incorrect". The code is given below. What could be the reason? (Another IOservice is already running in the system) HANDLE FileHandle=CreateFile("MyFile",FILE_WRITE_DATA,0,NULL,CREATE_NEW,FILE_ATTRIBUTE_NORMAL,NULL); if(FileHandle==INVALID_HANDLE_VALUE) { return; } try { io_service ios; windows::stream_handle StreamHandle(ios,FileHandle); .... .... } catch(std::exception& e) { Log(e.what()); //The parameter is incorrect } Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

1 0

PropertyTree compatibility with Visual C++
by Warren Seine 26 May '10

26 May '10

Hi, I'm trying to port a C++ application to Microsoft Windows using the Visual C++ environment (Express edition, if it matters) and I'm having some trouble with Boost.PropertyTree. The following code works with GCC but fails to compile on Visual C++ 10.0: #include <boost/property_tree/ptree.hpp> int main() { using boost::property_tree::ptree; ptree pt; return 0; } Here is a sample of the output: [..]\boost\property_tree\detail\ptree_implementation.hpp(30): error C2440: 'specialization': cannot convert from 'const std::string std::_Pair_base<_Ty1,_Ty2>::* ' to 'const std::basic_string<_Elem,_Traits,_Ax> std::pair<_Ty1,_Ty2>::* ' with [ _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] and [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] Can someone reproduce the bug? If so, is there some kind of workaround, even if it requires hacking the library? Thank you, -- Warren Seine

3 3

[thread] race condition detected with valgrind drd
by Jorge Moraleda 26 May '10

26 May '10

Dear all, I must be doing something wrong, but I can't figure out what. I would appreciate some help. Thank you in advance. The following program: #include <boost/thread.hpp> void threadEntry() { } int main (int argc, char *argv[]) { for(size_t t=0; t<10; t++) { boost::thread(threadEntry); } } runs cleanly with valgrind drd, but this other program produces race conditions when run with valgrind drd (see below). The only difference is "new". #include <boost/thread.hpp> void threadEntry() { } int main (int argc, char *argv[]) { for(size_t t=0; t<10; t++) { new boost::thread(threadEntry); } } This problem is not due to the leak, because this other program: #include <boost/thread.hpp> #include <boost/shared_ptr.hpp> void threadEntry() { } int main (int argc, char *argv[]) { std::vector<boost::shared_ptr<boost::thread> > threads; for(size_t t=0; t<10; t++) { boost::shared_ptr<boost::thread> thread(new boost::thread( threadEntry )); threads.push_back(thread); } for (size_t i = 0; i < threads.size(); ++i) { threads[i]->join(); } } which properly manages the heap also produces the same race conditions. I compile using: g++ -g -L /opt/boost/boost/stage/lib -lboost_thread threads.cpp and I test the program using valgrind using: valgrind --tool=drd ./a.out The output of valgrind is: ==3822== drd, a thread error detector ==3822== Copyright (C) 2006-2009, and GNU GPL'd, by Bart Van Assche. ==3822== Using Valgrind-3.5.0-Debian and LibVEX; rerun with -h for copyright info ==3822== Command: ./a.out ==3822== ==3822== Thread 3: ==3822== Conflicting store by thread 3 at 0x0504b350 size 8 ==3822== at 0x4E417B3: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Conflicting store by thread 3 at 0x0504b350 size 8 ==3822== at 0x4E417F9: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Conflicting load by thread 3 at 0x05f85288 size 8 ==3822== at 0x5D73AEE: __nptl_deallocate_tsd (pthread_create.c:153) ==3822== by 0x5D74A11: start_thread (pthread_create.c:307) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /lib/libpthread-2.10.1.so ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Thread 4: ==3822== Conflicting load by thread 4 at 0x0504b350 size 8 ==3822== at 0x4E41724: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment end (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment start (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment end (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== ==3822== ==3822== For counts of detected and suppressed errors, rerun with: -v ==3822== ERROR SUMMARY: 11 errors from 4 contexts (suppressed: 126 from 76)

2 1