January 2010 - Boost - lists.preview.boost.org

Boost library submission (poll for interest)
by Bob Walters 15 Jan '10

15 Jan '10

I have a library I would like to submit for inclusion in Boost. This message is just soliciting for interest per the submission process. If interest is expressed, I'll carry on with a preliminary submission. The library is an embedded database, to the tune of products like the embedded version of InnoDB, BerkeleyDB, etc. In this case, the database is structured as a Boost.interprocess shared region (typically mmap so it can page) which contains one or more STL-like containers holding application defined data types in directly usable form (i.e. not serialized.) The database infrastructure is fully ACID compliant, with durability via write-ahead logging, and periodic checkpoints. More details, examples, and documentation is available at http://stldb.sourceforge.net/ for more details on this libraries capabilities. Currently, I've only implemented map<> (probably the most useful container type in a database), but the plan is to continue to add containers as requested/needed until ACID compliant versions of a decent portion of the STL are available. There are some concepts which I've been trying to flesh out with this, including a standard concept for a transaction-aware type which in turn exposes operations which can be logged, undone, recovered, etc. Allowing that concept to be used recursively (containers of other containers, or of application-defined transaction-aware objects) is one of the longer-term goals of this library. Let me know if there's any interest, and I'll work on a preliminary submission for the sandbox. Thanks, Bob Walters

14 52

[uuid][release] - release summary for FreeBSD failures
by Andy Tompkins 15 Jan '10

15 Jan '10

Hi, A number of my tests fail for FreeBSD, see http://tinyurl.com/yjfhbg7 A specific one is here, http://tinyurl.com/ykg7p98 It says: Run fail /libexec/ld-elf.so.1: /usr/lib32/libm.so.5: unsupported file layout I'm not sure how to fix these. My tests pass in the trunk for FreeBSD and the uuid code and test are identical between the release branch and trunk. Can anyone help with this? Regards, Andy Tompkins

2 2

Using boost::circular_buffer in boost::interprocess:managed_shared_memory
by Taewan Kim 14 Jan '10

14 Jan '10

Can boost::circular_buffer be allocated in boost::interprocess:managed_shared_memory by passing an Interprocess aloocator to the constructor of boost::circular_buffer?

2 4

[iostreams]ANNOUNCE:indent_filtering_ostream.zip in vault
by Larry Evans 14 Jan '10

14 Jan '10

The .zip file in subject is here: http://www.boostpro.com/vault/index.php?&directory=Input%20-%20Output It includes a boost/iostreams/filter/indent.hpp and boost/iostreams/utility/indent_filtering_ostream.hpp. The latter uses the former to allow indenting and undenting a stream. Is there any interest in installing this in the iostreams library? -regards, Larry

4 10

Re: [boost] [msm] scalability
by Christophe Henry 14 Jan '10

14 Jan '10

>If we are talking about big changes, then I'd prefer to write a >completely new back-end for which I have a few ideas ;-) It appears that this discussion requires a bit of clarification. What we are discussing here will be taken care of after the inclusion of MSM into Boost. For the time being, I'm interested in collecting great ideas from the clever people on this list so that I have thinking material.

1 0

Review Wizard report for December 2009
by John Phillips 14 Jan '10

14 Jan '10

All, Please check the report below and let Ron and I know if there are any issues so we can correct them before putting it on the web site. Pay especial attention to the need for many qualified and interested Review Managers. John ============================================== Review Wizard Status Report for December 2009 ============================================== News ==== Polygon Library Accepted Boost 1.40 Released New Libraries: None Revised Libraries: Accumulators, Asio, Circular Buffer, Filesystem, Foreach, Function, Fusion, Hash, Interprocess, Intrusive, MPL, Program Options, Proto, Python, Serialization, Unordered, Xpressive Geometry Library Accepted Boost 1.41 Released New Libraries: Property Tree Revised Libraries: DateTime, Filesystem, Iostreams, Math, Multi-index Containers, Proto, Python, Regex, Spirit, System, Thread, Unordered, Utility, Wave, Xpressive MSM Library Review Underway Constrained Value Review - Review Result still Pending Older Issues ============ The Time Series Library, accepted in August 2007, has not yet been submitted to SVN. The Floating Point Utilities Library, has not yet been submitted to SVN. It is slated to be integrated with the Boost.Math library. The Switch Library, accepted provisionally in January 2008, has not yet been submitted for mini-review and full acceptance. The Phoenix Library, accepted provisionally in September 2008, has not yet been submitted for mini-review and full acceptance. For libraries that are still waiting to get into SVN, please get them ready and into the repository. The developers did some great work making the libraries, so don't miss the chance to share that work with others. General Announcements ===================== As always, we need experienced review managers. The review queue has been growing substantially but we have had 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 * Log * Join * Pimpl * Task * Endian * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert * Move * Containers * Interval Containers * Type Traits Extensions * Interthreads * Bitfield * Lockfree -------------------- 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! Log --- :Author: Andrey Semashev :Review Manager: Needed :Download: `Boost Vault <http://tinyurl.com/cm9lum>`__ :Description: The library is aimed to help adding logging features to applications. It provides out-of-box support for many widely used capabilities, such as formatting and filtering based on attributes, sending logs to a syslog server or to Windows Event Log, or simply storing logs into files. It also provides basic support for the library initialization from a settings file. The library can also be used for a wider range of tasks and implement gathering and processing statistical information or notifying user about application events. 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 newst 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. Move ---------------- :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://svn.boost.org/svn/boost/sandbox/move/ and online documentation at http://svn.boost.org/svn/boost/sandbox/move/libs/move/doc/html/index.html :Description: In C++0x, move semantics are implemented with the introduction of rvalue references. They allow us to implement move() without verbosity or runtime overhead. Boost.Move is a library that offers tools to implement those move semantics not only in compilers with rvalue references but also in compilers conforming to C++03. Containers ------------------ :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… and online documentation at 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. Interval Containers Library ------------------------- :Author: Joachim Faulhaber :Review Manager: Needed :Description: The Interval Template Library (Itl) provides intervals and two kinds of interval containers: Interval_sets and interval_maps. Interval_sets and maps can be used just as sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks: intervals. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. Interval containers allow for intersection with interval_sets to work with segmentation. For instance you might want to intersect an interval container with a grid of months and then iterate over those months. Finally interval_maps provide aggregation on associated values, if added intervals overlap with intervals that are stored in the interval_map. This feature is called aggregate on overlap. It is shown by example: :: typedef set<string> guests; interval_map<time, guests> party; guests mary; mary.insert("Mary"); guests harry; harry.insert("Harry"); party += make_pair(interval<time>::rightopen(20:00, 22:00),mary); party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry); // party now contains [20:00, 21:00)->{"Mary"} [21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap [22:00, 23:00)->{"Harry"} As can be seen from the example an interval_map has both a decompositional behavior (on the time dimension) as well as a accumulative one (on the associated values). Type Traits Extensions -------------------------- :Author: Frédéric Bron :Review Manager: Needed :Download: https://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 sens 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: https://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at https://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.ht… :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 :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 the boost vault: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost_… and from my personal git repository: git://tim.klingt.org/boost_lockfree.git http://tim.klingt.org/git?p=boost_lockfree.git the documentation is available at: http://tim.klingt.org/boost_lockfree/ Libraries under development =========================== Please let us know of any libraries you are currently developing that you intend to submit for review. See https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

10 17

Re: [boost] [msm] scalability
by Christophe Henry 13 Jan '10

13 Jan '10

>> I think the trade-off is >> likely to be not so much against run-time but UML features. I'm think >> about transition conflicts. This one is pretty hard on the compiler. >> I'd also bet on submachines and entry/exit pseudo states. >The idea would be to do all parts that are “hard on the compiler” >at runtime. I don't see why you should have to sacrifice features. I understand the idea and also think it is possible. I first need to analyze a bit more in detail which features cost the most compile-time, but I imagine it will probably be quite a new back-end, or do you already have an idea in mind? At first sight I'd think that the underlying data structures will be quite different. If we are talking about big changes, then I'd prefer to write a completely new back-end for which I have a few ideas ;-) But as it will be quite some development effort, I'd prefer to bring a mini MSM first. It'll help for compile-time in many standard cases, be there earlier and have better performance so we will need it anyway.

1 0

Re: [boost] [msm] Review
by Christophe Henry 13 Jan '10

13 Jan '10

>No, I won't spend "a lot more" time trying to decipher the supposedly >hidden meaning of your post and invest the time more wisely by making >MSM more useful. >The link I added seems quite clear to me and anyone interested can >make himself his own opinion by opening it. >You did not bother bringing an argumentation disproving my claim, so I >will simply keep it. >As you also didn't address the more important technical part (multiple >TU) of my answer, I will consider it accepted. I want to apologize for the harsh language I used and the uncharacteristic loss of patience I displayed. I also wanted to let you know that I of course accept your explanation as not doing it would be suspecting you of being dishonest, which I have not been doing at any time. I admit honestly failing to understand what is the impossibility you claim, thus the confusion. I think there is no interest right now for a technical discussion but for the record, I do not accept any impossibility of any sort and the next version of MSM will include a precise example of a multi-TU fsm to illustrate my claim. I wish all of you a happy, successful new year. Christophe

2 1

Re: [boost] [msm] scalability
by Christophe Henry 13 Jan '10

13 Jan '10

>> It might be interesting to contemplate a "fast-compile mode" that >> builds the same logical state machine using the same input syntax but >> trades away a little run time for compile time. > > Yes, I'd be willing to trade that, as my SM is not running in a real > time environment, but is managing user mouse and menu management. I'm also thinking about such back-end but I think the trade-off is likely to be not so much against run-time but UML features. I'm think about transition conflicts. This one is pretty hard on the compiler. I'd also bet on submachines and entry/exit pseudo states. If one is ready to give these ones up, I think we can have pretty easily something running without speed loss (I'd even bet on a speed gain). All it'd take would be the MPL book example cooked with the MSM sauce.

3 2

Re: [boost] [MSM] Meta State Machine Library Accepted
by Christophe Henry 13 Jan '10

13 Jan '10

Hi all, I'm happy to hear this result! Thank you Dave for your support and for taking on the very hard job of managing the review. I also want to thank Franz Alt, David Bergman, Michael Caisse, Barend Gehrels, Darryl Greene, Juraj Ivancic, Erik Nelson and Kenny Riddile for taking the time to write the mentioned thorough reviews and all those who supported the library. The development will of course continue and I hope that many people will further provide me with more valuable nuggets. I used the time after the review to continue the development. You will find in the sandbox a few new features: - increased dispatch speed and other optimizations. - removed some SFINAE to help poor VC8 ;-) - new eUML syntax as discussed. You can now write: target == source + event [guard] /action or source + event [guard] /action == target. - base events: if eventA is the base of eventB, you can use eventB for transitions defined for eventA (doc not updated yet) - internal transitions (first syntax). More to come in the next days. Next, as required, I'll rewrite the doc, add the reference and some UML tutorial. So, as Dave wrote, a lot of work is waiting :) Thanks again to all of you!

1 0

Re: [boost] [Boost-users] GGL Review Results
by Christophe Henry 13 Jan '10

13 Jan '10

Hi all, I'm happy to hear this result! Thank you Dave for your support and for taking on the very hard job of managing the review. I also want to thank Franz Alt, David Bergman, Michael Caisse, Barend Gehrels, Darryl Greene, Juraj Ivancic, Erik Nelson and Kenny Riddile for taking the time to write the mentioned thorough reviews and all those who supported the library. The development will of course continue and I hope that many people will further provide me with more valuable nuggets. I used the time after the review to continue the development. You will find in the sandbox a few new features: - increased dispatch speed and other optimizations. - removed some SFINAE to help poor VC8 ;-) - new eUML syntax as discussed. You can now write: target == source + event [guard] /action or source + event [guard] /action == target. - base events: if eventA is the base of eventB, you can use eventB for transitions defined for eventA (doc not updated yet) - internal transitions (first syntax). More to come in the next days. Next, as required, I'll rewrite the doc, add the reference and some UML tutorial. So, as Dave wrote, a lot of work is waiting :) Thanks again to all of you!

1 0

Re: [boost] [msm] scalability
by Christophe Henry 13 Jan '10

13 Jan '10

>> If one is ready to give these ones up, I think we can have pretty >> easily something running without speed loss (I'd even bet on a speed >> gain). All it'd take would be the MPL book example cooked with the MSM >> sauce. >That'd be great. Let me know how I can help. > >Jeff First of all, what would really help would be if you (and any other interested) could list me the main UML features you use so that we can define what the mini backend must provide in addition to what the book example does.

1 0

[uuid] status?
by Vladimir Prus 13 Jan '10

13 Jan '10

I notice that uuid is still not merged to the release branch. What is missing and can the merge be performed in next 24 hours? - Volodya

4 9

[MSM] Meta State Machine Library Accepted
by David Abrahams 13 Jan '10

13 Jan '10

I'm pleased to announce the acceptance into Boost of the Meta State Machine library by Christophe Henry The library got seven reviews, all thoughtful and in-depth, and was unanimously accepted by all reviewers (conditionally, by three of them). Reading through the reviews (not to mention all the other commentary) was truly an overwhelming experience for me. The thoroughness and depth of knowledge of the reviewers seemed to be a cut well above what I'm used to seeing. That, along with the unanimity of their votes, and Christophe's good-natured responsiveness to questions and criticism during the review, make me very confident in accepting MSM. The reviews contain scads of feature requests, ideas, and other valuable nuggets for Christophe to work on, so many that nobody other than Christophe would find a full enumeration useful. So, sorry Christophe, I'm going to leave it to you to troll for details in the message archives. [I suggest taking a pass over all issues mentioned and turning them into Trac tickets. Maybe you can get the review authors to do that themselves for their own reviews.] However, I can summarize some broad themes and issues of general interest to Boosters (and a few things I feel strongly about but won't demand): * There was universal satisfaction with the performance of state machines generated with MSM. * Though the tutorial was generally praised, every conditional acceptance was predicated on improving the documentation, in particular on providing a library reference. This really must be done. There were also several requests to break the tutorial into multiple pages. * One reviewer had problems reading the tutorial because it relies so heavily on UML terms-of-art. I agree with him that people only familiar with FSMs ought to be able to read the tutorial as well. That may mean including documentation of some UML concepts in the library docs. * eUML is really cool but it is apparently still in flux; for now it should probably be labelled as an experimental feature subject to change. * SimpleStates do not support internal transitions. They should. * The name is a bit misleading. Now would be the time to come up with something better if you're going to do it. StateChart is called StateChart in part because of my insistence that any library called Boost.FSM should be able to implement small, tight state machines appropriate for embedded systems use. Even though this library has those properties, I do not know whether the name would be appropriate, for several other reasons I won't list but that you, dear reader are probably thinking of right now. Thank you to Christophe and all the reviewers for restoring my faith in the Boost review process. And of course, congratulations to Christophe. Now the fun is over and the hard work begins... :-) -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

2 1

Release branch closed
by Vladimir Prus 13 Jan '10

13 Jan '10

Boosters, The release branch is now closed for all commits, except by explicit permission of release managers. -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

5 12

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 13 Jan '10

13 Jan '10

> Cristophe, I could definitely help out with macros and use of PP for MSM, if you need that help. Unfortunately, the next few weeks (at least) are a bit too hectic. >But, now you know that I might be willing (if not currently available) :-) > > /David I looked at your abstract fsm example and I easily believe you :) I happily and thankfully accept your offer. Just contact me when you have time and we can work this out. Thanks a lot! Christophe

1 0

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 12 Jan '10

12 Jan '10

> IMO making it easy for the user to declare these things (maybe with a > macro) and documenting that as the normal approach, dropping all the > parens, could be a big improvement. Unfortunately, I'm pretty bad at macros (and try to avoid them as much as I can) and after spending quite some time at it, I don't come further. Ok, for states, it's trivial: BOOST_MSM_STATE((Empty_Entry(),Empty_Exit()),Empty_,empty) Where Empty_ is the state type name and empty the instance for use in the transition table. Implemented with: # define BOOST_MSM_STATE(expr,state_name,instance_name) \ typedef BOOST_TYPEOF(build_state(expr)) state_name;state_name const instance_name; Where it gets slightly more "fun" is when I want to also remove the parens for the actions/guards. For example, if I have an action called start_playback which is: struct start_playback : euml_action<start_playback> { template <class FSM,class EVT,class SourceState,class TargetState> void operator()(EVT const& ,FSM&,SourceState& ,TargetState& ) { cout << "player::start_playback" << endl; } }; I want to use the same principle. start_playback_ will be the type and start_playback the instance. I come to: BOOST_MSM_ACTION((start_playback_,start_playback, (({ template <class FSM,class EVT,class SourceState,class TargetState> void operator()(EVT const& ,FSM&,SourceState& ,TargetState& ) { cout << "player::start_playback" << endl; } })) )) I thought of using PP tuple: // the action type #define BOOST_MSM_ACTION_TYPE(x) \ BOOST_PP_TUPLE_ELEM(3,0,x) // the action instance for use in the stt #define BOOST_MSM_ACTION_INSTANCE(x) \ BOOST_PP_TUPLE_ELEM(3,1,x) // the action code #define BOOST_MSM_ACTION_CODE(x) \ BOOST_PP_TUPLE_REM_CTOR(1,BOOST_PP_TUPLE_ELEM(3,2,x)) # define BOOST_MSM_ACTION(tuple) \ struct BOOST_MSM_ACTION_TYPE(tuple): euml_action<BOOST_MSM_ACTION_TYPE(tuple)> BOOST_MSM_ACTION_CODE(tuple) ; BOOST_MSM_ACTION_TYPE(tuple) const BOOST_MSM_ACTION_INSTANCE(tuple) ; But I fail at getting the action correctly so I generate: struct start_playback_: euml_action<start_playback_> ({ template... // notice the extra parens I hoped that REM_CTOR would do the job but no. Any idea if it is possible?

2 1

[msm] scalability
by Christophe Henry 12 Jan '10

12 Jan '10

Hi Simon, > I think it would be worthwhile talking a little more about compile time performance in the documentation. You're right, I could explain more in the documentation. Unfortunately, the answer is not straightforward. The compilation time (and how far the compiler plays with us) depends on a number of factors: 1) the compiler 2) the compiler version 3) even your hardware (I get very different compile times on 2 different machines with the same processor) 4) the state machine structure and the chosen front-end 1) usually, g++ crashes later than VC and needed fewer workarounds 2) Surprisingly, g++4.2 > g++ 4.4. VC10 > VC9 > VC8 3) you will need RAM, especially with VC8 4) the compile-time is proportional to the number of transitions in the transition table and to the depth of the state machine (meaning submachine of submachine of...). EUML will cost you much more with VC than g++ as it implies a metaprogramming layer above the standard metaprogramming of the standard front-end and because the underlying decltype/typeof seems much better implemented with g++ (if you don't count the generated code size). A small test with VC9 in Release mode (and no other code) gave me: 20 transitions => 11s 30 transitions => 16s 40 transitions => 22s 50 transitions => 31s This is just to give you an idea as it can greatly depend on the factors named above. > Also I'd like to see some suggestions of how to improve compile times (and how factors including the number of entries in a transition table affect the compile time). There is just one solution: reduce the number of transitions. The best way to do it is using orthogonal regions. For example, if you see in your diagram many transitions to a single state based on the same event, you should factor them all into a second region. Adding submachines could help in some cases. On one hand, the compiler now has to generate code for a second machine, OTOH it reduces the number of transitions in the main one. This will only help if your submachine handles a small number of events, as Msm will add a row in the main table for every event of the submachines. If you can in exchange reduce the number of transitions, it can help. > Is there provision to split a machine across multiple compilation units (I assume not)? You unfortunately assume correctly, as what costs compile-time really is the heavy metaprogramming. > You include instructions for how to increase the maximum size of an MPL vector, but this only works up to 50 entries. What do we need to do to increase this further? This is pretty simple, we need to: - add a vector60/70/80....hpp in mpl/vector. - add a map60/70....hpp in mpl/map. - if more than 50 states, add vector60/70....hpp in fusion/vector This is pretty simple. If that helps, I can add them into the Msm sandbox as I already wrote them. We could also request a feature in the MPL. You will however not manage to increase the size of the transition table forever. At some point will almost every compiler crash in a big cloud of dark smoke. To give you an idea, I usually manage: - 60-80 transitions max with VC9. The exact point is variable on a number of different factors which are hard to understand. - probably less with VC8. VC8 will also quite fast need > 2GB RAM. - 80 transitions with g++4.2. It could probably manage more but I ran out of RAM. - 50-60 with g++4.4. Why 4.4 is in this case less good than 4.2 is a mystery to me. - In Debug mode, you'll see the compiler give up faster - Euml will also have an influence. > Euml looks really cool, but I'm getting an ICE when using it with 36 transitions in EumlSimple.cpp (12 and 24 work fine though) VC8 only has limited support for eUML for 3 reasons: - less than perfect metaprogramming capabilities - bad support for SFINAE - VC problems with decltype/typeof So yes, I would advise eUML for VC8 for only small state machines and without using complicated functors as actions/guards. VC9 would work much better, VC10 better than VC9 too (so Microsoft seems to be working on it). >One of my favourite features of boost::statechart is state local storage. It looks like this would have to be done manually in msm? Yes, this is not supported yet. However, Msm has always been developed very user-oriented and what users ask, they usually get it. Msm has from the beginning greatly gained from clever people suggesting new features and I will not stop the development after the review, whatever the outcome is. If you'd like a feature, I'd be happy to discuss a solution with you and implement it in the next version, thus making Msm more useful. > The library is looking really powerful and expressive (not to mention fast!) for small state machines. Thanks. This is the reason for the compile-times ;-) Christophe

5 5

Re: [boost] Meta State Machine (MSM) review
by Christophe Henry 12 Jan '10

12 Jan '10

Hi Barend, Sorry that I didn't have time to address earlier the questions in your review. >I would like to see a connection with Boost.Graph (I mean, see it in an >example or so, not within the kernel), to see what I'm doing with all >those transitions; I asked this on the list and this is possible, good. It is a good point and I'll try to provide this, at least for simple state machines. >1) the struct "Row" is written with a capital, this is unusual within >Boost. Words with a capital are normally template parameters. I >understand why it is done (there was already a row without a capital in >Msm 1.1), but I think it could have been solved differently (for >example: "transition", or if that is too long "tr" which could stand for >transition row or table row). I don't like to see Row where I expect to >see a normal classname. Conventions are always hard to define. I usually try to follow the following convention: - rows are usually not capitalized (a_row, g_row...) - except the row working with functors, like Row - eUML functors are also capitalized and finish with an underscore. - eUML functions are not capitalized and finish with an underscore. This tries to match the phoenix syntax. This allows differentiation between functors/non functors. I found this system practical but would not mind changing it if required. >The capitals are also used in the documentation and samples (struct >Empty) but there I've less problems with it. Maybe use of Capitals for >states is a state machine convention Yes, it is a common habit in UML to capitalize state names (though I am not aware of any written rules). >I noticed different conventions in >the source files. Many template parameters are completely capitalized. I >had done the same thing, earlier, but was hinted that this is unusual as >well. Just a matter of style (as long as library users normally don't >see it, it is less important) Yes, while the user doesn't see it, it is not very beautiful so I'll change this. >2) the class state_machine is quite long (in lines of code), containing >several sub-structs which maybe (don't know) could be moved to a >separate source file (detail). Yes, it became quite big, you're right. It's quite practical for me to have functions and helpers at the same place but some parts could be separated. >You have to call p.start() manually Yes. Calling start() will move the machine in its initial state and call on_entry on the machine and the initial state. You have to call it explicitly because sometimes you simply don't want on_entry to be called at the creation of the state machine. >Thanks for submitting this excellent library. I'm happy that you like it. Thanks for the great work you put on the review. Regards, Christophe

2 1

[Polygon] "Ambiguous use of partial specialization" in CodeWarrior
by Kef Schecter 12 Jan '10

12 Jan '10

I'm using a special version of CodeWarrior for an embedded system, but I suspect that other versions of the software will show the problem. The problem is, basically, the compiler hates polygon_traits<T>. Here's an example from polygon_90_set_traits.hpp: template <typename T> struct traits_by_concept<T, polygon_90_concept> { typedef polygon_traits<T> type; }; It chokes on the typedef, saying "Ambiguous use of partial specialization". This is the complete text of the error message; it provides no other information. Most of the surrounding definitions are very similar, but only the ones that use polygon_traits<T> -- instead of, say, rectangle_traits<T> -- raise errors. Here's another example from polygon_traits.hpp: template <typename T> struct view_of<rectangle_concept, T> { typedef typename polygon_traits<T>::coordinate_type coordinate_type; [snip] }; It chokes on the typedef and any code that tries to use the typedef. The same problem happens with all the other view_of functions and a couple of others, but all the problems seem to deal with the use of polygon_traits<T> in a template. Unfortunately, I know very little about partial specialization, traits classes, or any advanced features of generic programming in C++. My understanding of templates is limited to stuff like making basic containers, generalized sorting functions, etc. -- the easy stuff. So I find the definition of polygon_traits too complicated and am unable to fully comprehend the essence of the problem, let alone how to fix or work around it. Since I need to get this to work, if a proper solution is not obvious, I'm willing to accept any kind of clumsy hack, including disabling parts of the library that I might not need. (I use very little of the Polygon library, but I have a hard time finding an alternative to the part I do use -- namely, finding the union of polygons while allowing for holes. Alternative suggestions in that area are welcome, but I can't use GPLed code, or code that I would need to pay a license for to use commercially.) Any ideas? - Kef

4 16

[Archive] oserializer.hpp
by Richard Crossley 12 Jan '10

12 Jan '10

The following code from archive/detail/oserializer.hpp on head looks rather dubious... >line 394 // note:if this exception is thrown, be sure that derived pointer // is either registered or exported. if(NULL == true_type){ boost::serialization::throw_exception( archive_exception( archive_exception::unregistered_class, true_type->get_debug_info() // << Here ) ); } Regards, Richard.

2 1

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 12 Jan '10

12 Jan '10

>> You could declare those instances at namespace scope, in the same way >> most Proto terminals are declared, non? >The user could. But not the library writer AFAIU, since these state >types are created by the user. Exactly. Of course the library could predefine some state names (the way I understand arg1, arg2, etc. are defined) but I'm afraid it'd barely be an improvement. Christophe

2 1

[persistent] Persistent library preview
by Stefan Strasser 12 Jan '10

12 Jan '10

Here's the current documentation of (Boost?).Persistent: https://svn.boost.org/svn/boost/sandbox/persistent/libs/persistent/doc/html… In short, it is a library that provides access to objects persistent on disk with an interface as close as possible to accessing regular objects in memory, and it introduces transactions to e.g. ensure consistency after a crash. See "Introduction" for more information. This is the version I plan to submit for a boost review, so if you are interested in that kind of library, please have a look at it now and don't wait for a formal review. The boost review queue has grown substantially, so it might be a long time until a formal review, which could be used for improvements based on your comments. Code will follow as soon as some issues are sorted out, especially porting the (few) platform dependent parts to windows. Regards,

4 11

Anyone care if I merge Boost.Array fixes to the release branch?
by Marshall Clow 12 Jan '10

12 Jan '10

Since no one is maintaining Boost.Array (as far as I know), and there is at least one bug fix on the trunk that hasn't been merged to the release branch, I propose merging: boost/array.hpp libs/array/doc/array.xml to the release branch. Any objections?? If not, I'll do it about midnight EST tonight. -- Marshall

2 1

[asio] Pass some parameter to io_service::run
by Dmytro Ovdiienko 11 Jan '10

11 Jan '10

Hello All, I'm new in boost asio. I'm trying to adapt this library to my existent network application. There is a problem with current application's architecture. I see no way to pass some parameter to the completion routine from the io_service::run calling thread. Below brief application description. Hope this will help: 1. It is *low-latency* network application 2. Application processes incoming multicast UDP messages. 3. Number of multicast groups/ports is *unlimited*. Technical details: 1. Application encapsulates udp::sockets subscribed to multicast group 2. udp::socket::async_receive method used to receive data 3. io_service::run is used in the thread pool to call socket's complete routine. 4. Every thread of the pool encapsulates some object for messages processing. I need to pass reference to this object to the socket::async_receive complete routine to complete message processing. This object allocates a lot of memory and I cannot create it for every socket. It is possible to create but there is no sense. It is very important to avoid thread_local_storages and null_buffers to make application as simple as possible without performance gaps. I believe it is possible because POSIX and Windows I/O allow it. Please help with advise. Thanks. Dima

3 7

[asio] streambuf example wrong
by Michael Caisse 11 Jan '10

11 Jan '10

The example section in the documentation for boost::asio::streambuf indicates you can: boost::asio::streambuf::const_buffers_type bufs = b.prepare(512); The compiler (gcc) thinks not. You can however: boost::asio::streambuf::const_buffer_type bufs( b.prepare(512) ); Regards - michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

1 0

Regression testing on win32 platforms
by Arash Partow 11 Jan '10

11 Jan '10

Hi all, With regards to regression testing of boost libraries on the win32 platform using MSVC versions post introduction of checked iterators, are any of the regression tests compiled with the following defines? _SCL_SECURE_NO_WARNINGS _SECURE_SCL=0 As I've noticed MSVC installs with SP1 that have had patches included from the last month or so are causing this failure. #include <cstddef> #include <iostream> #include <string> #include <boost/regex.hpp> int main() { using namespace boost; std::string s = "(1)(23)(456)(7890)"; regex expr("\$.*?\$"); sregex_iterator itr(s.begin(),s.end(),expr); sregex_iterator it_end; std::string token; std::size_t match_count = 0; while (it_end != itr) { ++itr; ++match_count; } std::cout << "Match count: " << match_count << std::endl; return 0; } ************************************************** example.exe!_crt_debugger_hook(int _Reserved=3619112) Line 65 C example.exe!_invalid_parameter(const wchar_t * pszExpression=0x00000000, const wchar_t * pszFunction=0x00000000, const wchar_t * pszFile=0x00000000, unsigned int nLine=0, unsigned int pReserved=0) Line 112 + 0x7 bytes C++ example.exe!_invalid_parameter_noinfo() Line 125 + 0xc bytes C++ example.exe!boost::match_results<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> >,std::allocator<boost::sub_match<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> > > > >::set_size() + 0x5b bytes C++ example.exe!boost::re_detail::perl_matcher<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> >,std::allocator<boost::sub_match<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> > > >,boost::regex_traits<char,boost::w32_regex_traits<char> > >::find_imp() + 0xc9 bytes C++ ************************************************** Removing SP1 or applying SP1 with patches up until mid nov '09 slip-streamed seems to work fine, this is just a heads up for people using this particular environment. Initially I was using the BOOST Pro distribution, with static linking (1.39 and 1.40) MT and single modes, I've also done clean builds just in case something was wrong with the distrib, same problem observed in all cases. I've tested the above code on linux with gcc 4.4 and intel v11 runs fine and valgrind checks-out ok (as expected). BTW I've gone here http://www.boost.org/development/testing.html looking for any kind of documentation relating to the types of settings used, is there a more up-to-date location? Kind regards, Arash

2 2

[bloom_filter dynamic_bitset] Serialization support
by Paul Fee 11 Jan '10

11 Jan '10

I've been looking at the Bloom filter implementation in the sandbox area: https://svn.boost.org/trac/boost/browser/sandbox/bloom_filter A previous email thread implied serialization was available, but I don't see it in svn. http://lists.boost.org/Archives/boost/2009/06/152731.php Is the serialization code available somewhere? I've made an attempt at implementing this myself. In doing so I had to implement serialization for boost::dynamic_bitset. The dynamic_bitset serialization code may be useful independent of Bloom filters. The Bloom filter serialization in turn makes use of dynamic_bitset serialization. I've uploaded my implementation to the boost vault: http://www.boostpro.com/vault/index.php?directory=serialization Perhaps I should supply tests, example usage and documentation, but I'm hoping to get advice on Boost best practise before going too far in the wrong direction. I'd like to see dynamic_bitset serialization in Boost proper and bloom_filter serialization alongside the existing code in the sandbox area. Can I request a sandbox account to upload code there? All comments welcomed. Thanks. Paul Fee

3 2

Code freeze is coming up - please look at "showstoppers" and "regressions"
by Marshall Clow 11 Jan '10

11 Jan '10

There are 25 open tickets marked as "showstoppers" https://svn.boost.org/trac/boost/report/29 and 13 more marked as "regressions" https://svn.boost.org/trac/boost/report/30 How many of these be closed/resolved before the 1.42 code freeze? -- Marshall

3 2

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 10 Jan '10

10 Jan '10

>Are all those parentheses used for optional arguments, or could we consider eliminating them? I'd love to eliminate them but don't see how. They actually are constructors. The complete expression would be something like: typedef BOOST_TYPEOF(build_stt(( DestState() = CurrentState() + cool_event()[guard()]/action(), DestState2() = CurrentState() + cool_event()[guard2()]/action2() ) ) ) transition_table; So I'm really just pretending to pass on-the-fly instances of arguments from types DestState, CurrentState, etc. to evaluate the result with typeof after proto is done.

5 4

Trac administration procedures
by Vladimir Prus 10 Jan '10

10 Jan '10

Hi, Looking at https://svn.boost.org/trac/boost/wiki I see instruction for requesting a new account, but I don't see instructions for requesting various other administrative changes -- for example adding/removing components and milestones. Could somebody please add such information (so that I can make a request without spamming this mailing list). Thanks in advance, Volodya

1 0

[log] Release Candidate 4 released Options
by Jesse Perla 09 Jan '10

09 Jan '10

Andrey: I am excited to get logging into boost! I may have mentioned this before, but I see logging support for distributed applications as being my essential usecase. For applications distributed by MPI, the interface is MPE: http://www.mcs.anl.gov/research/projects/mpi/www/www4/MPE.html You can see an example here: http://beige.ucs.indiana.edu/I590/node112.html There are a few quirks about this interface, and I wanted to do a sanity check that it was possible to implement as a backend: * You need to have event numbers for different log events. And you need to call an API to get the number: MPE_Log_get_event_number() * There is a way to describe states and their transitions: MPE_Describe_state(.) after you generate them. This allows you to track the duration between state changes... with associated colors. * There is a viewer called "jumpshot" that shows these logs, colors, etc. Anyways, I just wanted to bring this to your attention as an important usecase to think through in the interfaces. And if you happen to write an MPE backend to be packaged with boost::mpi, it would be an amazing addition. -Jesse

2 1

Re: [boost] [multi_index][serialization]save_construct_data not called for multi_index collection
by JOAQUIN M. LOPEZ MUÑOZ 09 Jan '10

09 Jan '10

________________________________________ De: boost-bounces(a)lists.boost.org [boost-bounces(a)lists.boost.org] En nombre de Robert Ramey [ramey(a)rrsd.com] Enviado el: sábado, 09 de enero de 2010 21:42 Para: boost(a)lists.boost.org Asunto: Re: [boost] [multi_index][serialization]save_construct_data not called for multi_index collection > > Joaquin M Lopez Munoz wrote: > > > Hi Felipe, I still haven't received an answer to my question > > about Boost.Serialization, so, given the sensible nature > > of serialization code > > lol - thank you for such a charitable characterization. Don't get me wrong, I'm not referring to Boost.Serialization code, but to the code (in this particular case, inside Boost.MultiIndex) devoted to serializing a particular type: if one makes a wrong/bad decision within it, great care has to be taken so as to fix this decision while being backwards compatible with archives created with prior versions of the lib. In no way were I referring to any particular aspect of Boost.Serialization, being this problem absolutely inherent to any serialization framework one could use. Besides, I much appreciate the work you put in B.S. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[variant] Common base type of variant sub-types
by Adam Badura 09 Jan '10

09 Jan '10

Unions of POD types have a special case of allowing to access union value members through any union value which has those members. This is exemplified by following code: ---------- struct base { int shared; }; struct derived_1 : base { int shared_as_well; int not_shared_1; }; struct derived_2 : base { int shared_as_well; int not_shared_2; }; union union_type { derived_1 value_1; derived_2 value_2; } void f() { union_type v; v.value_1 = derived_1(); v.value_2.shared = 1; // This is OK. v.value_2.shared_as_well = 1; // This is OK as well. //v.value_2.not_shared_2 = 1; // This is not OK. } ---------- Such feature is quite useful. Sadly it is not supported by boost::variant. However a similar feature might be supported if boost::get was changed a bit. Lets consider another example: ---------- #include <boost/variant.hpp> struct base { int shared; }; struct derived_1 : base { int almost_shared; // If union was used this would be shared as well. int not_shared_1; }; struct derived_2 : base { int almost_shared; // If union was used this would be shared as well. int not_shared_2; }; typedef boost::variant<derived_1, derived_2> variant_type; void f() { variant_type v; v = derived_1(); assert(boost::get<base>(&v)); // This will fail. v = derived_2(); assert(boost::get<base>(&v)); // This will fail. } ---------- As can be seen boost::get fails if we specify a base type of a type which object is stored in variant. However if it would not fail but succeed we would have a feature similar to that special case with unions. And I know this can be done with visitor (just like boost::get is implemented) however I think it would be useful to wrap this functionality in a function. I think it is unlikely that such feature would break existing code. However it possibly might. To avoid breaking existing code a function similar to get could be introduced. I think I might implement this but I would prefer someone else to do this. :) Adam Badura

2 4

Closed for major changes; release freeze approaching
by Vladimir Prus 09 Jan '10

09 Jan '10

Boosters, Per release calendar, the release branch is closed for major changes now. On next Monday, Jan 11, the branch will be closed for all changes except by permission. What constitutes major change is up to you, but please exercise caution with commits. Now, I believe we have two outstanding issues: - uuid is still not merged to release branch - we still have issues with Boost.Test, see: http://permalink.gmane.org/gmane.comp.lib.boost.devel/198282 - release branch has 20 regressions, and 138 new failures. functional/hash, numeric/interval and regex are the libraries with regressions. I'd appreciate if maintainers of those libraries act on regressions, and other maintainers examine "new" failures. -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

4 9

[variant] Why boost::get uses simple throw instead of BOOST_THROW_EXCEPTION
by Adam Badura 09 Jan '10

09 Jan '10

Is there any reason for boost::get to use simple "throw" to throw bad_get rather then BOOST_THROW_EXCEPTION? I thought BOOST_THROW_EXCEPTION is supposed to be used in all Boost libraries... Adam Badura

2 1

[log] Review manager wanted
by Andrey Semashev 08 Jan '10

08 Jan '10

Guys, I know you are all very busy persons, probably even more busy than I am. :) But the situation with the review queue is getting really daunting. Boost.Log (as well as many other good libraries) is hanging in the queue for a quite long time, and it desperately needs a review manager. There has been a few active discussions of this particular library and logging in general, so I can't count this situation to a lack of interest to a logging library in Boost. Logging is not something domain-specific. I'm sure most of us have worked with a tool like this, so virtually anyone can manage this review. I'm asking someone to step forward and make this library a part of Boost, if it deserves so, or make it RIP otherwise. You will not be forgotten by thankful users and me. Thank you.

3 4

[patch] first_iterator, second_iterator?
by Daniel Colascione 08 Jan '10

08 Jan '10

Iterating over the first and second elements of a collection of pairs is a pretty common problem. Would it be possible to get something like the following into boost? #include <boost/iterator/iterator_adaptor.hpp> /* For testing, below */ #include <map> #include <string> #include <iostream> #include <iterator> template<typename BaseIt> struct first_iterator : boost::iterator_adaptor< first_iterator<BaseIt>, BaseIt, typename BaseIt::value_type::first_type > { first_iterator() : first_iterator::iterator_adaptor_() {} first_iterator(const BaseIt& bi) : first_iterator::iterator_adaptor_(bi) {} operator const BaseIt&() { return this->base_reference(); } private: friend struct boost::iterator_core_access; typename BaseIt::value_type::first_type& dereference() const { return this->base_reference()->first; } }; template<typename T> first_iterator<T> make_first_iterator(const T& it) { return first_iterator<T>(it); } template<typename BaseIt> struct second_iterator : boost::iterator_adaptor< second_iterator<BaseIt>, BaseIt, typename BaseIt::value_type::second_type > { second_iterator() : second_iterator::iterator_adaptor_() {} second_iterator(const BaseIt& bi) : second_iterator::iterator_adaptor_(bi) {} operator const BaseIt&() { return this->base_reference(); } private: friend struct boost::iterator_core_access; typename BaseIt::value_type::second_type& dereference() const { return this->base_reference()->second; } }; template<typename T> second_iterator<T> make_second_iterator(const T& it) { return second_iterator<T>(it); } int main() { typedef std::map<int, std::string> testmap; testmap t; t.insert(std::pair<int, std::string>(5, "middle")); t.insert(std::pair<int, std::string>(2, "first")); t.insert(std::pair<int, std::string>(8, "last")); std::copy(make_first_iterator(t.begin()), make_first_iterator(t.end()), std::ostream_iterator<int>(std::cout, " ")); std::cout << "\n"; std::copy(make_second_iterator(t.begin()), make_second_iterator(t.end()), std::ostream_iterator<std::string>(std::cout, " ")); std::cout << "\n"; first_iterator<testmap::iterator> x = t.begin(); ++x; t.erase(x); }

4 5

Re: [boost] Boost library submission (stldb - poll for interest)
by Bob Walters 08 Jan '10

08 Jan '10

On Wed, 6 Jan 2010 09:10:57 +0100, Stefan Strasser <strasser(a)uni-bremen.de> wrote: >> .... A map implementation >> which internally segmented itself into sections under independent mutexes >> in order to permit highly concurrent modifications of any kind would be a >> big help. Anyone know of any such implementations? > > any implementation based on shadowpaging, e.g. this open source one: > http://1978th.net/tokyocabinet/ > > I don't know any internals of Berkeley DB, but it also supports concurrent > modifications. > > the containers I describe here: > https://svn.boost.org/svn/boost/sandbox/persistent/libs/persistent/doc/html… > > also support concurrent modifications, since their container nodes are > implemented as MVCControlled objects. > but they are much less efficient in absolute terms than a low-level container > implementation. There's a problem with this approach to concurrency. I don't like the unavoidable chance of exceptions forcing retry. The company I work for had a problem like this with BerkeleyDB. We had a map which was typically very small, but subject to a constant load of insert/update/delete activity. Under such a load, the prospect of page-level contention increases, and in BerkeleyDB's case we got a lot of 'deadlock' exceptions, which could recurr 5+ times despite retries. The rety-based approach can be a death spiral, in that once contention occurs, the fact that threads are then having to try 2+ times to complete their transactions only increases the load against the containers, thereby also increasing the probability of contention. I think I can digress to the arguments which led to RDBMS'es doing blocking. So I probably have a bias here, but I don't like the notion of the container failing thread A simply because thread B inserted a record which causes some rebalancing which touched the node pointers on the node that A wants to modify. The container should be predictable so that end users can optimize according to its behavior. The STLdb map does not have this problem. Inserts with different key values will never cause a contention exception. Even when two processes do modify the same entry, blocking is possible, as an alternative to retry logic, because that can be more efficient overall. All of this is reinforcing my hope for trans_map<key,locator> - you address the chief persistence related problems I would have if I just put 10 gigs of values into the STLdb database, and I think I can keep these container implementations fast and predictable, and meet your desire for low-level containers.

1 0

[rdb] 0.2.04 - date, time and datetime
by Jean-Louis Leroy 08 Jan '10

08 Jan '10

I have uploaded a new version to the vault. It introduces support for three new sql types : datetime, date and time. I have been busy with other things recently, sorry for not taking part to the discussions about Persistent and other libs. Jean-Louis

1 0

How to create a shallow copy without calling a constructor?
by vicente.botet 08 Jan '10

08 Jan '10

Hello, While developing Boost.STM (Software Transactional Memory), I need to create a cache of a transactional object without using the new operator nor the copy constructor of the class. This cache needs only to copy the raw memory of the copied instance, is for that I have called it shallow_clone The following will create a deep copy and don't respect my requirements class C { public: C* shallow_clone() { return new C(*this); } }; I have looked at uninitialized_copy but if I have understood it correctly, it calls the copy constructor. I have tried with class C { public: C* shallow_clone() { C* p = reinterpret_cast<C>(malloc(sizeof(C)); if (p==0) { throw std::bad_alloc(); } memcpy(p, this, sizeof(C)); return p; } }; But I suspect that this is not correct in general. Is this correct on some particular cases? if yes on witch ones? Is there a way to create such a cache instance without calling to the constructor in a portable way using some low level C++ interface? Thanks, Vicente _____________________ Vicente Juan Botet Escribá

6 12

[Boost.Build] Unexpected MSVC linker error
by Sergey Zubkovsky 08 Jan '10

08 Jan '10

Hi, I'm using bjam and VC++2008 Express Edition to build date_time library, for example. When I try to link it with my project I have the error: LINK : fatal error LNK1104: cannot open file 'boost_date_time-vc90-mt-gd-1_40.lib' The bjam's command line options are : --layout=tagged toolset=msvc The name of the genereated lib file is "boost_date_time-mt-gd.lib". The error doesn't occur if the "--layout" option is "versioned" or "system". It seems to me that the cause of this behavior is the following text in the file "boost\config\auto_link.hpp": #ifndef BOOST_AUTO_LINK_NOMANGLE # pragma comment(lib, BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") # ifdef BOOST_LIB_DIAGNOSTIC # pragma message ("Linking to lib file: " BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") # endif #else # pragma comment(lib, BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") # ifdef BOOST_LIB_DIAGNOSTIC # pragma message ("Linking to lib file: " BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") # endif #endif "-" BOOST_LIB_VERSION ".lib" is always added in the "pragma comment" directive, if BOOST_AUTO_LINK_NOMANGLE is undefined, of cause. Is this a bug? How can I workaround it if this is not a bug? Thank you.

4 6

[test] trunk breakage
by Vladimir Prus 08 Jan '10

08 Jan '10

I went to check the current state of Boost.UUID test results on trunk, and found many tests failing. Here's a typical issue: http://tinyurl.com/y8c9w39 This looks like Boost.Test problem. The testrun is for revision 58533, while last change in boost/test is: r58526 | rogeeff | 2009-12-25 12:20:28 +0300 (Fri, 25 Dec 2009) | 1 line in preparation of production use of test tools So, it seems the test run corresponds to the current state of Boost.Test, and that state is a bit broken. In fact, it looks like a *lot* of tests are failing on trunk, and every test that uses Boost.Test is affected. Boost.Test itself appears to fail to build in may configurations: http://tinyurl.com/ybfkeb2 Gennadiy, I realize this might be a Christmas/New Year break, but at the same time we have a "major code changes" deadline on Jan 4th, and such interruption of test reporting make things hard. Is there any chance you could investigate? If this issue cannot be sorted out quickly, we might have to revert the commit for now. Thanks, Volodya

9 28

Re: [boost] [stldb] design details (was Boost library submission (poll for interest))
by Bob Walters 08 Jan '10

08 Jan '10

On Tue, 5 Jan 2010 16:54:52 +0100 Stefan Strasser <strasser(a)uni-bremen.de> wrote: > I thought the reason that requires you to load the entire dataset on startup > and save it entirely at checkpoints and recoveries is that the user needs to > access the mapped region directly through pointers, since the user types > exist in an unserialized form there. is that right? IIUC by load you mean reconstruct the memory mapped file from the checkpoints + logs? The only time that I have to reconstruct the memory mapped file or shared memory region using the checkpoints and logs is when recovery is done, NOT during routine/controlled startup and shutdown. See the architecture page: http://stldb.sourceforge.net/stldb/arch.html. I specifically wrote this page after our prior discussions. If processes disconnect normally, and recovery is not needed then I reuse the region. When recovery is required, I do have the problem of having to reconstruct the memory mapped file using the whole of the last checkpoint. Thus I agree your shadow paging of the container in the memory map would reduce recovery time. Note that I am changing my checkpoint process so that each subsequent checkpoint will only write out changes since the last checkpoint, and do so by reusing free portions of the checkpoint file. Consequently the I/O directed to both the log and checkpoints is in proportion to the rate of change, and not to the size of the database. STLdb was originally designed as a memory resident database. It should do that well since it provides direct access to containers in a shared region. My thinking was that if the user elects to use a memory mapped file for the region, they then have a paged database. The I/O directed at checkpoints and logs is based entirely on rate of change. However, that paged database then introduces redundant disk I/O since it will page out per LRU while I also occasionally write changed entries out to the checkpoints as checkpoints are done. IIUC you have a similar problem but it involves redundancy of memory. If you work with a large intrusive container, then you have the serialized storage memory mapped in, but must also cache the deserialized nodes of the container in memory to ensure fast locator traversal, and allow it to work like an index. What I am currently very intriguied by is your idea of using STLdb as indexes for a large database. i.e. The containers are map<key,locator>, and refer to a separate Boost.Persistence stored objects. Ideally, the containers will be small and tend to be held in memory (due to frequent use) so the double-write problem goes away since the OS won't be paging the memory map. A user could even mandate that the indexes stay memory resident by using a shared memory region type, rather than a memory map. There's another benefit to this - it would allow heterogenous containers, to the theme of map<key,base*> because of the locator's use of boost serialization. And also because the real value-type is not in shared memory, they can once again have virtual methods, etc. > what confuses me is the "Updating Entries" section and the fact that you do > track changes made by the user, e.g. via trans_map::update. > so if the library is aware of every change to the mapped region, what > stops you from employing a shadow paging technique and only writing to the > mapped region on transaction commit, when the modified pages are logged? > that would make your library MUCH more widely usable. Right now, the interaction between the containers and the rest of the transactional infrastructure is based off an approach inspired by the stasis library (http://tardis.cs.berkeley.edu/stasis/developers/html/main.html) There is a concept of a transactionally aware object. As modifiers on transactionally aware objects are called, those objects post 'TransactionalOperations' onto the transaction passed to them. These ops represent the means by which the transaction can ultimately commit or rollback that operation when the time comes. Containers like trans_map are transactionally aware and define their own atomic operations (i.e. in the case of trans_map, insert(), lock(), update(), erase(), clear() and swap().) When these operations are logged, it is the logical operation (insert<5,"foobar">) which is logged, not the changes done to memory, so that during recovery it can be replayed. I am not logging memory changes. A big contrast between this STLdb library and Boost.Persistence is that in your case, IIUC you are tracking the use and modification of objects but the objects themselves are unaware. One downside of this is that the objects can't collaborate to support piecemeal updates of small portion of the objects - it's always the full object which is re-serialized. Because I was starting with the notion of persisting containers, I sought to devise a model for a transaction-aware object which supported updates against portion of the object. Thus I came up with the idea of the transactional objects supporting one or more transactional operations. The tracking of changes is based on the use of these transactional operations. The only reason I went with methods like lock() and update() is that while I could have done this implicitly via non-const access to iterators (for update anyway), I thought that implicit approach would be an easy source of bugs. i.e. My 1M finds() become 1M find() and updates() because I forgot to make the getName() method on my object const. Are you requiring const correctness when accessing locators? I really like your interface in Boost.Persistent, but are you currently assuming an update when a locator is accessed non-const, or is it more clever than that, i.e. making a transaction-local copy during non-const access, but later checking for differences between the transaction-local copy and original before reserializing and storing the object? > because on the other hand, dereferencing trans_map::iterator returns a > non-const reference to value_type, indicating the opposite. Bug. I originally had the iterator always returning a const reference, to be consistent with the demand that users use update(). However, had some kind of difficulty, and never circled back to it (and can't recall why currently). Will be addressed in the final submission. Also, keep in mind that the code I have currently has not been submitted to boost. Its ugly. The interfaces need work, but what currently exists does run. I am not proud of some of what's in there currently. > what kind of tree does trans_map use internally? Red/Black per boost::interprocess::map, which is used (intact) internally for the low-level map implementation. I'm wrapping that with code to make it transactionally aware. I didn't want yet another implementation of map. > I can't wrap my head around the locking or MVCC used for isolation. > could you explain this a little more in detail? > does the library automatically > record/lock accesses? is the user supposed to lock manually on every access? The isolation behavior is based on RDBMS conventions for row-level locking. Reads do not lock entries, writes do lock entries. These entry-level locks last until commit/rollback. A row can be locked directly (for pessimistic locking convention) by using the lock() method on the entry. This was needed because I do have blocking capabilities on modifier methods, and thus needed a way to keep one thread's blocking update from overwriting another. See the section in the "quick start" which shows lock() being used. It corresponds to the RDBMS concept of "select for update" and is used for the same reasons. I have been thinking about adding optimistic locking support based on specialization of the map for a value type implementing some optimistically lockable interface. Doing so would then allow you to avoid any call to lock(), but present the chance of failure during update(). This is all per RDBMS row-update conventions, and ultimately, I planned to support both just as many RDBMS support both, giving the user the choice. Incidentally, one problem I have with Boost.Persistence is that you always handle contention by throwing. IIUC contention can occur when two threads insert records with different keys into a container simply because they would both add their node under the same parent, and despite their nodes having different keys. So in other words, there's nothing apps can do to prevent the possibility of contention errors. This can backfire badly if the probability of contention is high because of app design. For example, someone writes a transaction which does several things, one of which is to push_back something to a queue. The transactions which did the push_back would need to be completely synchronized, IIUC. Support for blocking was one of the RDBSM worlds answer to this kind of problem, and the reason I included support for it in the trans_map container design. Thus I'm drawing the conclusion that implementing containers base on the locator concept's handling of concurrency might not always be the right idea. btw... I'm still not settled on the interface for lock() / update() and have wondered if I should somehow put that onto the iterator. E.g. lock() would be a method of the iterator, and update() could be a method on the iterator which returns a non-const L-value reference that can then be updated directly. Suggestions welcome... > how are possible read-accesses over an entire range stored, e.g. by > using map::equal_range()? If you hold a shared lock on the map while accessing it via a generic algorithm you are guaranteed to see the data reflecting a consistent set of transactions. In between locks, the result of new commits can appear, leading to the various phantom scenarios defined in the ANSI isolation levels. Holding a shared lock on the map prevents other transactions from committing changes to it while the lock is in effect. You aren't meant to hold locks on the containers for a very long time if you want good concurrency, but it can be done.

3 2

Re: [boost] boost::mpl::for_each_impl() still not inlined
by Peter Foelsche 07 Jan '10

07 Jan '10

"Peter Foelsche" <peter_foelsche(a)agilent.com> wrote in message news:... > > "Peter Foelsche" <peter_foelsche(a)agilent.com> wrote in message > news:hi5bfc$gap$1@ger.gmane.org... > > > below are my patches for boost_1_41_0 -- these are dealing with inlining > and > > boost::lambda::if_then_else_return > > not being able to deal with different return types in the true vs. else > branch. > sorry -- the patch was inversed. Attached the correct one.

1 0

boost::mpl::for_each_impl() still not inlined
by Peter Foelsche 07 Jan '10

07 Jan '10

I think I published the matching patch already a couple of times. Could somebody change this please?

1 1

Is floating_point_comparison.hpp general purpose tool?
by Mateusz Loskot 07 Jan '10

07 Jan '10

Hi, I'm wondering why the floating-point algorithms [1] implementation in floating_point_comparison.hpp lives in Boost UTF. Shouldn't it go to location that would suggest it's not only usable for unit tests but it is a general purpose tool. [1] http://www.boost.org/doc/libs/1_41_0/libs/test/doc/html/utf/testing-tools/f… Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org

4 10

generate tuples by mpl -- should I use fusion?
by Peter Foelsche 07 Jan '10

07 Jan '10

I need to be able to convert a mpl sequence into something like a tuple: typedef boost::mpl::vector<double> CMplSequence; typedef CCreateVectorFromMpl<CMplSequence>::type CVector; I need to have runtime access with constant index: CVector s; get<0>(s) = 1.0; std::cout << get<0>(s) << "\n"; I need to be able to retrieve the type at compile time -- preferably as a mpl sequence. I already wrote something like this using std::pair as the tuple but I'm running into problems storing reference types on Windows. Peter

2 1

[asio] ICMP on Mac Os X Leopard + Snow Leopard
by Marco De Angelis 07 Jan '10

07 Jan '10

Dear Asio developers, I tried the ICMP ping example (http://www.boost.org/doc/libs/1_40_0/doc/html/boost_asio/examples.html) of Boost 1.40.0, and it fails to work on both Mac Os X Leopard and Snow Leopard, with marco$ sudo ./ping google.com Exception: Socket type not supported I already use many other features of Asio in the project, therefore I would exclude any problem related to compilation, linking, permissions, network visibility, etc. Is the ICMP feature implemented for Mac Os X platforms? If so, any idea why I receive the exception or where can I start investigating? Best regards, Marco De Angelis

1 0

coding conventions
by Michael 06 Jan '10

06 Jan '10

hi all, here's a first patch: it was generated using the command 'svn diff > ../boost.diff" questions on the formatting of new code (conforming standards used at gdb-patches(a)gnu.org) 1) can lines exceed the 80 character limit? 2) should standard indentation be taken as 2 or 4 white spaces? the attachment can be applied as such. Greetz, Michael

20 37

asio::ip::tcp::socket and boost::thread
by xutm 06 Jan '10

06 Jan '10

Hi all, I am using 1_39_0 version boost in my application, and encounter two problems, one with tcp::socket and another with thread. The following is my codes: class transStream { public: transStream() { cb = NULL; thrd = NULL; } ~transStream() { if (sock) { sock->close; // would be segment fault delete sock; // would be segment fault } if (thrd) { cout << "ready to delete the thread ..." << endl; //delete thrd; thrd->interrupt(); // actually, the thread still exists and runs thrd->detach(); cout << "detach the thread ..." << endl; thrd = NULL; } cb = NULL; cout << "finish..." << endl; } tcp::socket* sock; TransDataCallBack cb; boost::thread* thrd; }; static void getDataThread(transStream* ts) { if (!ts) { return ; } cout << "in getDataThread method ...." << endl; try { boost::system::error_code error; char packet[PACKET_LENGTH] = {0}; memset(packet, 0, PACKET_LENGTH); for (;;) { ... usleep(10); } cout << " exit the for loop " << endl; } catch(std::exception& e) { std::cerr << "Exception: " << e.what() << "\n"; } if (ts) delete ts; return ; } int CreateTransStream(OUT void** pTsHandle, IN const char* sTransIp, IN unsigned short servTransPort, IN const CONVERT_STREAM_INFO* pInfo) { if (!sTransIp || !pInfo) { cout << "error parameters" << endl; return -1; } stringstream ss; string port; transStream* ts = new transStream(); ... ts->sock = sock; *pTsHandle = ts; cout << "finish sending the dahua device info to server and return ..." << endl; return 0; } int StartTransStream(IN void* tsHandle, IN TransDataCallBack cb, IN void* userData) { stringstream ss; transStream* ts = (transStream*)tsHandle; if (!tsHandle || !ts) { return -1; } ... ts->cb = cb; boost::thread* thrd = new boost::thread(boost::bind(getDataThread, ts)); ts->thrd = thrd; ... return 0; } int StopTransStream(IN void* tsHandle) { transStream* ts = (transStream*)tsHandle; if (!tsHandle || !ts) { return -1; } ... return 0; } int DestroyTransStream(IN void* tsHandle) { transStream* ts = (transStream*)tsHandle; if (!tsHandle || !ts) { return -1; } cout << "in method DestroyTransStream ..." << endl; if (ts->thrd) { cout << "destory the thread ..." << endl; if (ts) { delete ts; cout << "reset ..." << endl; ts = NULL; } } cout << "deleted the socket ..." << endl; return 0; } 1. the first problem: in the function CreateTransStream, i declare a transStream using "transStream* ts = new transStream();" and a socket using "tcp::socket* sock = new tcp::socket(io_service);", "ts->sock = sock;" , then i return the ts using "*pTsHandle = ts;" ; When i delete the ts in the function DestroyTransStream: "delete ts;", i know the system would call the deconstruct function ~transStream(), when i call sock->close() or delete sock, Segment Fault will occurs. Can somebody tell me why? Or how can i solve the problem? 2. the second problem: If i want to kill a thread which is no longer useful, I think i just need to call the two lines: " thrd->interrupt();" and " thrd->detach();" . But actully, the two lines cannot kill the thread. Can somebody tell me how to do? Thinks in advances!

3 2

Re: [boost] Boost library submission (poll for interest)
by Bob Walters 06 Jan '10

06 Jan '10

On Jan 5, 2010, at 9:08 AM, Ion Gazta?aga <igaztanaga(a)gmail.com> wrote: > I think most in-memory databases use T-trees as main containers. I plan > to add them as Interprocess containers for late 2010, but of course, > that will depend on my free time. With those containers, we could speed > up searches and waste less space. Would the interface remain identical to map? The current 'trans_map' can be revised slightly so that it would be a transactional wrapper for any map implementation, leaving the internals of storage to the implementation. Taking advantage of a T-tree variant would then be very easy to accomplish. One of the biggest challenges I'm seeing with high throughput on map is that operations like insert() and erase() cannot be done to concurrently by multiple threads, and consequently those operations become a bottlneck. I'm doing operations like find() and updates (to different entries) in parallel. A map implementation which internally segmented itself into sections under independent mutexes in order to permit highly concurrent modifications of any kind would be a big help. Anyone know of any such implementations? - Bob

3 3

[ASIO] Windows named pipes
by Fernando Lemos 06 Jan '10

06 Jan '10

Hello, I've implemented support for Windows named pipes in Asio. Windows named pipes are created with CreateFile, and you can use WriteFile/ReadFile with overlapped I/O to read from and/or write to them. It uses win_iocp_handle_service (just like serial_port_service), so it's really simple code. I've attached the implementation to this e-mail (hoping the attachments will get through) so that you guys can import it into Boost if you find it worthwhile (feel free to license it under the Boost license). Note, though, that it needs to be "Boostfied" because I had to adhere to the coding conventions of the current project I was working on (this includes variable naming conventions, code style conventions, namespacing, and the separation of named_pipe into basic_named_pipe and named_pipe, and so on). And since this is my first interaction with Boost "internals", I won't be surprised if you guys find rookie mistakes in it. I've tested this implementation under Vista and Windows 7, using Boost 1.40 (but 1.41 should work just fine too) and VC++ 2008 Express. I used pipes in message mode, but I believe both message and stream modes will work. Regards,

1 0

[io] Tickets #1414, #3588, #3725 (warning fixes)
by Richard Webb 06 Jan '10

06 Jan '10

Does anyone care to merge the fix for #1414 (https://svn.boost.org/trac/boost/ticket/1414) to the Release branch? It looks like that change should fix both #3588 and #3725 as well. Thanks, Richard Webb -- View this message in context: http://old.nabble.com/-io--Tickets--1414%2C--3588%2C--3725-%28warning-fixes… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

Re: [boost] Boost library submission (poll for interest)
by Bob Walters 06 Jan '10

06 Jan '10

On Jan 5, 2010, at 14:08:18 +0000 Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> wrote: >> Currently, I've only implemented map<> (probably the most useful >> container type in a database), but the plan is to continue to add >> containers as requested/needed until ACID compliant versions of a >> decent portion of the STL are available. > > I have several times used Boost.MultiIndex as a replacement for a database. > It would be great if there could be support for everything > Boost.MultiIndex can do. I intend to look at this (future consideration). A variant of MultiIndex which works with the transactional infrastructure would be a naturally good fit. Offering support for MultiIndex would provide a means of consistency control between primary containers and associated secondary indexes which is currently lacking. - Bob

1 0

Review Request: fiber
by Oliver Kowalke 05 Jan '10

05 Jan '10

I'd like to request a formal review of boost.fiber - available at boost vault. Thx and a happy new year, Oliver

2 3

ublas questions
by markus2004x 05 Jan '10

05 Jan '10

Hi. Happy new year! I have couple of questions on uBlas. 1) On the boost user guide I read: "However unbounded_array is aimed at optimal performance. Therefore unbounded_array does not model a Sequence like std::vector does". I do not quite understand this statement. An std::vector is memory contiguous and access happens by offset. How can an unbounded beat this? 2) In the matrix<> template class I cannot find the concept of leading dimension. E.g. in a row major matrix 3x3 matrix the lead dimension could be 4, meaning that in reality I have a 3x4 matrix, but I just use a 3x3 (i.e. I have some slack at the end of each row). Is there a way to specify it? This is the way BLAS and LAPACK are designed, and it becomes particularly important when using hi-performance implementation of BLAS on x86, like Intel MKL, which require 16-byte alignment of each row. I thought about allocating a larger matrix, and then taking a range on it, but that does not seem the natural thing to do. Thanks a lot. -- View this message in context: http://old.nabble.com/ublas-questions-tp27024487p27024487.html Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

Msm review
by Nelson, Erik - 2 05 Jan '10

05 Jan '10

Not nagging, but I'm curious about the status/outcome of the Boost MSM review. I know everyone was busy over the holidays. Thanks Erik

1 0

Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib
by shing fan 04 Jan '10

04 Jan '10

I see, thank you very much for this helpful feedback. Message: 4 Date: Sun, 3 Jan 2010 22:49:01 -0500 From: Stefan Teleman <stefan.teleman(a)gmail.com> To: boost(a)lists.boost.org Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib Message-ID: <1ccb59a21001031949x3fcacbb7yd6cf56cc13ae5b30(a)mail.gmail.com> Content-Type: text/plain; charset=UTF-8 On Sun, Jan 3, 2010 at 22:41, shing fan <shingfan(a)hotmail.com> wrote: > There really is no drawback in using GCC. If you are running on SPARC and are concerned about the default GCC SPARC optimizer, you can download GCCFSS from here: http://cooltools.sunsource.net/gcc/index.html The only restriction is: Studio- and GCC- generated binaries are ABI incompatible. So, you won't be able to build Boost with GCC, and the rest of the software with Studio, and link. Also, C++ shared libraries provided in Solaris are built with Sun Studio. The same restriction explained above applies. --Stefan -- Stefan Teleman KDE e.V. stefan.teleman(a)gmail.com _________________________________________________________________ Windows Live: Keep your friends up to date with what you do online. http://go.microsoft.com/?linkid=9691815

1 0

[test] va_copy
by Steven Watanabe 04 Jan '10

04 Jan '10

AMDG Boost.Test is still failing on some compilers that don't support va_copy. Is va_copy always a macro? Would it be possible to use #ifdef va_copy? In Christ, Steven Watanabe

4 5

Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib
by shing fan 04 Jan '10

04 Jan '10

>From the sound of this, it is nearly impossible to compile boost using SS11 with stdlib without some sort of complier-hack. I'm not the only user using the environment so hacking the complier would not be a viable solution. And my lib has to work with another third-party lib which specifically mentioned that they do not support the use of stlport. i'm not ready to take the responsibility of causing any problem to a third-party lib if any do arise. So i guess my only choice is to switch to GCC if i need to work on Solaris and use Boost (1.36+)? What is the drawback for using GCC? The only thing that i know of between GCC and SS is that GCC's complier is slower, any other reason why one would prefer SS over GCC? Many thanks for other useful comments as well and i really appreciate all of them. > Message: 6 > Date: Sun, 3 Jan 2010 14:02:55 -0500 > From: Stefan Teleman <stefan.teleman(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: <1ccb59a21001031102t3384061m21c45e19d3a877(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Sun, Jan 3, 2010 at 13:45, shing fan <shingfan(a)hotmail.com> wrote: > > > > So, with limited resources (time, labour, and technical expertise on complier), would it be safe to assume that i should pursue other routes (e.g. boost with gcc or with stlport) and not continue with the beast (compling boost with libCstd?). ?Your professional opinion is much appreciated. > > This is what you needed to do for boost 1.33.1 to get it to compile > with Studio 12: > > http://kdesolaris-svn.cvsdude.com/branches/BOOST/1.33.1/Solaris/ > > see the README.Solaris file. > > I haven't tried building more recent boosts with libCstd.so.1 since then. > > You can build most of boost 1.40.0 with Studio 12 [ with the latest > patches ] and the Apache Standard C++ Library 4.2.1, which is > available in Solaris/Nevada builds, but not in Solaris 10. > > There are several boost libraries which do not compile with either > Studio 12 or Studio 12 Update 1, even with the Apache Standard C++ > Library combination above. One library which pops in my mind right now > is Boost.Interprocess -- it requires C++0x compiler features [ rvalue > refs ], and this feature is not yet available with Sun Studio. > > You can build recent boosts with GCC 4.3.x on Solaris. Please keep in > mind that GCC C++ binaries are ABI incompatible with Sun Studio C++ > binaries, and you will not be able to mix and match compilers. > > HTH, > > --Stefan > > -- > Stefan Teleman > KDE e.V. > stefan.teleman(a)gmail.com > > Get a great deal on Windows 7 and see how it works the way you want. Check out the offers on Windows 7now. _________________________________________________________________ Windows Live: Keep your friends up to date with what you do online. http://go.microsoft.com/?linkid=9691815

2 1

Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib
by shing fan 04 Jan '10

04 Jan '10

>From the sound of this, it is nearly impossible to compile boost using SS11 with stdlib without some sort of complier-hack. I'm not the only user using the environment so hacking the complier would not be a viable solution. And my lib has to work with another third-party lib which specifically mentioned that they do not support the use of stlport. i'm not ready to take the responsibility of causing any problem to a third-party lib if any do arise. So i guess my only choice is to switch to GCC if i need to work on Solaris and use Boost (1.36+)? What is the drawback for using GCC? The only thing that i know of between GCC and SS is that GCC's complier is slower, any other reason why one would prefer SS over GCC? Many thanks for other useful comments as well and i really appreciate all of them. > From: boost-request(a)lists.boost.org > Subject: Boost Digest, Vol 2780, Issue 2 > To: boost(a)lists.boost.org > Date: Sun, 3 Jan 2010 20:33:09 -0500 > > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > Today's Topics: > > 1. Re: [serialization]Memory leak, VS2009, dynamic library > (Robert Ramey) > 2. Re: Boost.Atomic request for review/inclusion (Phil Endecott) > 3. Re: How to create a shallow copy without callingaconstructor? > (vicente.botet) > 4. Re: [Boost 1.41: list_of] Boost compliation error, > Sun > Studio 11 using standard C++ lib (shing fan) > 5. Re: [Random]Random value from range (Steven Watanabe) > 6. Re: [Boost 1.41: list_of] Boost compliation error, > Sun > Studio 11 using standard C++ lib (Stefan Teleman) > 7. Re: [Boost 1.41: list_of] Boost compliation error, > Sun > Studio 11 using standard C++ lib (Rob Riggs) > 8. Re: [Boost 1.41: list_of] Boost compliation error, > Sun > Studio 11 using standard C++ lib (Stefan Teleman) > 9. Re: [test] va_copy (Gennadiy Rozental) > 10. Re: [test] va_copy (Gennadiy Rozental) > 11. Re: Is floating_point_comparison.hpp general purpose tool? > (Gennadiy Rozental) > 12. Re: [Random]Random value from range (Topher Cooper) > 13. Re: [Boost 1.41: list_of] Boost compliation error, > Sun > Studio 11 using standard C++ lib (Rob Riggs) > 14. Re: [test] va_copy (Steven Watanabe) > 15. Re: [test] va_copy (Bj?rn Roald) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Sun, 3 Jan 2010 09:10:16 -0800 > From: "Robert Ramey" <ramey(a)rrsd.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [serialization]Memory leak, VS2009, dynamic > library > Message-ID: <hhqioc$tia$1(a)ger.gmane.org> > > I believe this is addressed in 1.42 > > Robert Ramey > > Mariusz Kwiczala wrote: > > Hello, > > > > I have memory leak during initialization of boost.serialization.dll. > > (I did not call any function from boost.serialization - some static > > initialization does not free resources) > > Is it known bug or I missed some library settings? > > > > Callstack to memory leak: > > > > > > ------------------------------ > > Message: 2 > Date: Sun, 03 Jan 2010 17:09:05 +0000 > From: "Phil Endecott" <spam_from_boost_dev(a)chezphil.org> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] Boost.Atomic request for review/inclusion > Message-ID: <1262538545458(a)dmwebmail.dmwebmail.chezphil.org> > Content-Type: text/plain; format="flowed" > > Phil Endecott wrote: > > There's a new version of my ARM patch here: > > > > http://chezphil.org/tmp/boost_atomic_20091220.patch > > Another update here: > > http://chezphil.org/tmp/boost_atomic_20100103.patch > > This adds support for ARM architecture v7. It seems to compile but > hasn't been properly tested. > > I have noticed a few posts here from other people writing iPhone code; > if you would like to try out a shared_ptr that uses this for its atomic > reference count, please let me know. > > I think it would be great to get Helge's code adopted as Boost.Atomic > ASAP and to port things like shared_ptr to use it. As usual the > limiting thing is presumably a review manager... > > One thing that seems to be missing is a test that actually tries to > check for atomicity, i.e. by running multiple threads. Helge, do you > have something? Does anyone else have something that can be adapted > for this? > > > Happy New Year, > > Phil. > > > > > > ------------------------------ > > Message: 3 > Date: Sun, 3 Jan 2010 18:59:24 +0100 > From: "vicente.botet" <vicente.botet(a)wanadoo.fr> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] How to create a shallow copy without > callingaconstructor? > Message-ID: <8D5ADFEA818544F78596B8A4631296FA@viboes1> > Content-Type: text/plain; charset="iso-8859-1" > > Hi Stefan, thanks for your comments > ----- Original Message ----- > From: "Stefan Strasser" <strasser(a)uni-bremen.de> > To: <boost(a)lists.boost.org> > Sent: Sunday, January 03, 2010 4:55 AM > Subject: Re: [boost] How to create a shallow copy without callingaconstructor? > > > > > > Am Saturday 02 January 2010 23:34:51 schrieb vicente.botet: > >> I want to define a generic mixin that define these function, something > >> like: > >> > >> template <class Derived, typename Base=base_transaction_object> > >> class shallow_transaction_object : public Base > >> { > >> public: > >> base_transaction_object* shallow_clone() const { > >> Derived* p = reinterpret_cast<Derived*>( new char[sizeof(Derived)]); > >> std::memcpy(p, static_cast<Derived const*>(this), sizeof(Derived)); > >> return p; > >> } > >> > >> void cache_deallocate() { > >> delete[] reinterpret_cast<char*>(this); > >> } > >> > >> void copy_state(base_transaction_object const * const rhs) { > >> std::memcpy(static_cast<Derived *>(this), static_cast<Derived const * > >> const>(rhs), sizeof(Derived )); } > >> }; > >> > >> So the user can just declare its own class as > >> > >> class C : public shallow_transaction_object<C> { > >> // members concerning the user space > >> }; > >> > >> Can this be done in a portable way? > > > > depends on if you really mean portable or "defined" (by C++ standard). > > I meant portable. > > > I doubt memcpy()ing objects with a virtual pointer is defined, but I think > > it'll work on all implementations I know of if you always copy the most > > derived type. > > This will always be the case. I should rename the template parameter Derived by Final. > > template <class Final, typename Base=base_transaction_object> > class shallow_transaction_object; > > > what types can class C : shallow_transaction_object contain? can it contain > > pointers or is it limited to "shallow types"? > > it can contain any non pointer type and pointers to transactional objects, but no pointer to non-transactional objects. > The pointee transactional objects do not need to be copied since the STM system track any modification to them. > > > for the latter, you might want to make the decision if memcpy() can be used > > based on boost::serialization::is_bitwise_serializable. > > is_bitwise_serializable don't goes too far. it is equivalent to is_artithmetic. But it can be specialized. > > I have find in Boost.TypeTraits this example > > An Optimized Version of std::copy > Demonstrates a version of std::copy that uses has_trivial_assign to determine whether to use memcpy to optimise the copy operation. > > maybe I need something like has_trivial_copy and has_trivial_assign. > > > is the object in the cache used or is it only stored to be copied back to the > > exact same position of the original object, in case the transaction fails? > > This depends on the updating policy. With direct updating the cached objects is used as a backup and used to restablish the shared object in case of rollback, so it is never used directly, with deferred updating, the cached object is the object modified by the transaction and used to update the shared object in case of succesfull commit. > > For what you and Mathias said, and as I suspected the code is neither portable nor correct and limited to types having trivial copy semantics. > > template <class Derived, typename Base=base_transaction_object> > class trivial_transactional_object : public Base > { > typedef Base base_type; > public: > base_transaction_object* make_cache() const { > Derived* p = reinterpret_cast<Derived*>( new char[sizeof(Derived)]); > std::memcpy(p, static_cast<Derived const*>(this), sizeof(Derived)); > return p; > } > > void remove_cache() { > delete[] reinterpret_cast<char*>(this); > } > > void copy_cache(base_transaction_object const * const rhs) { > std::memcpy(static_cast<Derived *>(this), static_cast<Derived const * const>(rhs), sizeof(Derived )); > } > }; > > For shallow copy semantics, I suspect that I will need to relay on whether the user defines these shallow copy constructor and assignement operations following these prototypes > > struct shallow_t {}; > const shallow_t shallow = {}; > > C(C const&, shallow_t); > C& shallow_assign(C const&); > > The new shallow_transactional_object could be defined as > > template <class Derived, typename Base=base_transaction_object> > class shallow_transactional_object : public Base { > public: > base_transaction_object* make_cache() const { > Derived* p = reinterpret_cast<Derived*>( new char[sizeof(Derived)]); > return new(p) Derived(this, shallow); > } > > void remove_cache() { > delete[] reinterpret_cast<char*>(this); > } > > void copy_cache(base_transaction_object const * const rhs) { > this->shallow_assign(static_cast<Derived const * const>(rhs)); > } > }; > > Now I can define transactional_object depending on whether has_trivial_copy_semantics<T>::value , has_shallow_copy_semantics<T>::value, or has_deep_copy_semantics<T>::value (TBD) > > namespace detail { > template <class Final, typename Base, bool hasShallowCopySemantics, bool hasTrivialCopySemantics> > class transactional_object; > template <class Final, typename Base> > class transactional_object<Final, Base, true, true>: public shallow_transactional_object<Derived, Base> {}; > template <class Final, typename Base> > class transactional_object<Final, Base, true, true>: public shallow_transactional_object<Derived, Base> {}; > template <class Final, typename Base> > class transactional_object<Final, Base, false,true>: public trivial_transactional_object<Derived, Base> {}; > template <class Derived, typename Base> > class transactional_object<Final, Base, false,false>: public deep_transactional_object<Derived, Base> {}; > } > template <class Final, typename Base=base_transaction_object> > class transactional_object > : public detail::transactional_object<Final, Base, has_shallow_copy_semantics<Derived>::value, has_trivial_copy_semantics<Derived>::value> > {}; > > Of course, this force the user to define specific shallow copy semantics operations, but IMO this will have some advantages. What do you think of this approach? > > Anyway, I find that it is a shame that the compiler know how to make a shallow copy-constructor and shallow assignement operator, but one the user defines a specific one we are unable to use them. Do you think that its is worth to have the possibility to use the default generated constructors and assignement operators in C++ ? For example we could use these defaulted operators as follows > > C a(default); // use the default constructor generated by the compiler > ... > C b(a, default); // use the default copy constructor generated by the compiler > > C c; > > std::assign_default(c, a); // use the default assignement operator generated by the compiler for class C > > Best, > Vicente > > > > > ------------------------------ > > Message: 4 > Date: Sun, 3 Jan 2010 18:45:15 +0000 > From: shing fan <shingfan(a)hotmail.com> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: <SNT124-W25BD216A3B9E9938AAE9B6DD750(a)phx.gbl> > Content-Type: text/plain; charset="iso-8859-1" > > > So, with limited resources (time, labour, and technical expertise on complier), would it be safe to assume that i should pursue other routes (e.g. boost with gcc or with stlport) and not continue with the beast (compling boost with libCstd?). Your professional opinion is much appreciated. > > > > > Message: 2 > > Date: Sun, 03 Jan 2010 04:10:23 +0000 > > From: Mateusz Loskot <mateusz(a)loskot.net> > > To: boost(a)lists.boost.org > > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > > Message-ID: <4B4018AF.2020705(a)loskot.net> > > Content-Type: text/plain; charset=ISO-8859-1 > > > > Steven Watanabe wrote: > > > AMDG > > > > > > shing fan wrote: > > >> I'm having trouble building Boost headers (e.g. > > >> <boost/assign/list_of.hpp> ) with Sun Studio 11 using standard C++ > > >> library. I have no problem when i build the headers using the stlport > > >> lib. However, due to some restrictions, i have to use the standard > > >> c++ lib but not the stlport lib. Does anyone know whether it is > > >> possible to complie the following headers using sun studio 11 with > > >> ONLY the standard C++ library? I'm okay to use even 1.38 as long as i > > >> can compile it with Sun Studio 11 using ONLY the C++ standard library. > > >> > > > > > > The default standard library for Sun is not supported because it > > > is insufficiently standards compliant. > > > > I would quote Roman Shaposhnik's workshop [1] from Sun: > > > > "BOOST with libCstd.so.1 : Can Happen, but is insane" > > > > [1] http://www.osdevcon.org/2008/files/tutorial-roman/ > > > > Best regards, > > -- > > Mateusz Loskot, http://mateusz.loskot.net > > Charter Member of OSGeo, http://osgeo.org > > > _________________________________________________________________ > Windows Live: Keep your friends up to date with what you do online. > http://go.microsoft.com/?linkid=9691815 > > ------------------------------ > > Message: 5 > Date: Sun, 03 Jan 2010 10:59:56 -0800 > From: Steven Watanabe <watanabesj(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Random]Random value from range > Message-ID: <4B40E92C.9080809(a)providere-consulting.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > AMDG > > Mariusz Kwiczala wrote: > > After experiments I wrote below function. > > Could you verify if function is written correctly for random value from > > range [min,max) and > > uniform distribution? > > > > double RandomGenerator(const double min, const double max) > > { > > assert(min<max); > > static boost::lagged_fibonacci44497 gen(static_cast<unsigned > > int>(std::time(0))); > > static boost::uniform_real<> range(min, max); > > static boost::variate_generator<boost::lagged_fibonacci44497&, > > boost::uniform_real<> > generator(gen, range); > > const double value = generator(); > > return value; > > } > > > > I have few question related to random library: > > 1. Is it possibility to write function which will generate numbers > > from range [min, max] or (min, max) > > > > (min, max) can be handled by rejection from [min, max). > [min, max] is a bit trickier. Either way, you'll have to implement > it yourself. > > > 2. Why generator (boost::lagged_fibonacci44497)is not properly > > initialized in some default constructor. Without static_cast<unsigned > > int>(std::time(0)) code generated the same values after every application > > run. > > > > This is a feature. > > > 3. Why when I missed reference "&" in line > > boost::variate_generator<boost::lagged_fibonacci44497&, application crashes. > > > > Probably stack overflow. boost::lagged_fibonacci44497 is > rather large. > > > Is it bug? > > > > In Christ, > Steven Watanabe > > > > ------------------------------ > > Message: 6 > Date: Sun, 3 Jan 2010 14:02:55 -0500 > From: Stefan Teleman <stefan.teleman(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: <1ccb59a21001031102t3384061m21c45e19d3a877(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Sun, Jan 3, 2010 at 13:45, shing fan <shingfan(a)hotmail.com> wrote: > > > > So, with limited resources (time, labour, and technical expertise on complier), would it be safe to assume that i should pursue other routes (e.g. boost with gcc or with stlport) and not continue with the beast (compling boost with libCstd?). ?Your professional opinion is much appreciated. > > This is what you needed to do for boost 1.33.1 to get it to compile > with Studio 12: > > http://kdesolaris-svn.cvsdude.com/branches/BOOST/1.33.1/Solaris/ > > see the README.Solaris file. > > I haven't tried building more recent boosts with libCstd.so.1 since then. > > You can build most of boost 1.40.0 with Studio 12 [ with the latest > patches ] and the Apache Standard C++ Library 4.2.1, which is > available in Solaris/Nevada builds, but not in Solaris 10. > > There are several boost libraries which do not compile with either > Studio 12 or Studio 12 Update 1, even with the Apache Standard C++ > Library combination above. One library which pops in my mind right now > is Boost.Interprocess -- it requires C++0x compiler features [ rvalue > refs ], and this feature is not yet available with Sun Studio. > > You can build recent boosts with GCC 4.3.x on Solaris. Please keep in > mind that GCC C++ binaries are ABI incompatible with Sun Studio C++ > binaries, and you will not be able to mix and match compilers. > > HTH, > > --Stefan > > -- > Stefan Teleman > KDE e.V. > stefan.teleman(a)gmail.com > > > ------------------------------ > > Message: 7 > Date: Sun, 03 Jan 2010 13:12:29 -0700 > From: Rob Riggs <rob(a)pangalactic.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: <4B40FA2D.60403(a)pangalactic.org> > Content-Type: text/plain; charset=UTF-8; format=flowed > > On 01/03/2010 11:45 AM, shing fan wrote: > > So, with limited resources (time, labour, and technical expertise on complier), would it be safe to assume that i should pursue other routes (e.g. boost with gcc or with stlport) and not continue with the beast (compling boost with libCstd?). Your professional opinion is much appreciated. > > > > C++ on Solaris is a bit of a lost cause at the moment. The near-term > route that we have decided to take is to abandon Sun Studio altogether > and focus on porting to GCC on Solaris using the GCC package from > Blastwave. I encourage others to consider doing the same. > > The issue that you will run into with both Sun Studio & stlport and with > GCC is that neither has working locale support on Solaris. This is not > an immediate issue for us so it was a reasonable compromise. My > understanding is that locale support should be working in the near > future with "regular" GCC on Solaris using the > --enable-clocale=ieee_1003.1-2001 option. > > Longer term, we do not think Sun Studio is a viable platform for C++ > development. In the near future Sun will have to support Sun Studio > with 3 C++ standard libraries as they have stated publicly that they > will be adding Apache's libstdcxx (but not when). This is an untenable > position for third-party library developers (whether open or > proprietary). None of the three libraries are binary compatible, so > every third-party library one uses must be compiled with the same > library. Additionally, Sun will either have to wait to include the > Apache libstdcxx until c++1x is ratified and their compiler & library > supports all its features or it will have to support a 4th C++ standard > library. However, given Sun's history with C++ support, the option they > are most likely to choose is to have a broken C++ implementation that > doesn't support all of c++1x for the next decade. > > GCCfss from Sun is another alternative, but it appears to be at a > crossroads with GCC's recent license change. Sun can no longer modify > GCC to produce IL code for their compiler back-end without also > releasing those tools under the GPL. Last I checked, this did have > working locale support. This is really the only working C++ > implementation on Solaris at this point. But its lifespan appears to be > rather limited. > > Rob > > > > ------------------------------ > > Message: 8 > Date: Sun, 3 Jan 2010 15:44:47 -0500 > From: Stefan Teleman <stefan.teleman(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: > <1ccb59a21001031244p1bc3740crd4f634b4f45d0059(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > I do not intend to start a flamewar, but the post below contains > numerous factually wrong, incomplete, misleading and uninformed > statements. > > It is of great disservice to provide erroneous information, and that > in response to a mailing list request for accurate information about a > specific topic. Not only it confuses the original question, but it > also diminishes the value of the mailing list. > > I also realise that this is a Boost mailing list, and it is not a Sun > compiler complaints list. > > I will correct the following false assertions: > > - Apache Standard C++ Library 4.2.1 [ libstdcxx ] is already included > and available in Solaris/Nevada. Sun Studio 12 provides support for > the Apache Library. > > How do I know that libstdcxx is available in Solaris/Nevada ? Because > I put it there. > > It is, therefore, not true, that Sun has not given any indication > about the availability of the Apache Library: it is already available. > > - Sun does not have to wait until C++0x is ratified in order to > provide libstdcxx, simply because libstdcxx does not yet support > C++0x. There may exist, in the future, an implementation of the > Apache Standard C++ Library, providing C++0x. It does not yet exist. > > - It is already known that the C++ ABI will break for C++0x. > > - GCCFSS has nothing to do with C++, or, for that matter, with C, or > with std::locale. GCCFSS is simply a compiler backend optimizer for > the SPARC ISA exclusively. > > - The stlport4 library available on Solaris has nothing to do with > GCC. It is only provided for, and supported with, Sun Studio. GCC > provides its own implementation of the Standard C++ Library, namely > libstdc++. The implementation of the GNU Standard C++ Library has > nothing to do with either GCCFSS, or with the Solaris-provided > stlport4 library. > > Thank you for your time. > > --Stefan > > ------ > > On Sun, Jan 3, 2010 at 15:12, Rob Riggs <rob(a)pangalactic.org> wrote: > > > C++ on Solaris is a bit of a lost cause at the moment. ?The near-term route > > that we have decided to take is to abandon Sun Studio altogether and focus > > on porting to GCC on Solaris using the GCC package from Blastwave. ?I > > encourage others to consider doing the same. > > > > The issue that you will run into with both Sun Studio & stlport and with GCC > > is that neither has working locale support on Solaris. ?This is not an > > immediate issue for us so it was a reasonable compromise. ?My understanding > > is that locale support should be working in the near future with "regular" > > GCC on Solaris using the --enable-clocale=ieee_1003.1-2001 option. > > > > Longer term, we do not think Sun Studio is a viable platform for C++ > > development. ?In the near future Sun will have to support Sun Studio with 3 > > C++ standard libraries as they have stated publicly that they will be adding > > Apache's libstdcxx (but not when). ?This is an untenable position for > > third-party library developers (whether open or proprietary). ?None of the > > three libraries are binary compatible, so every third-party library one uses > > must be compiled with the same library. ? Additionally, Sun will either have > > to wait to include the Apache libstdcxx until c++1x is ratified and their > > compiler & library supports all its features or it will have to support a > > 4th C++ standard library. ?However, given Sun's history with C++ support, > > the option they are most likely to choose is to have a broken C++ > > implementation that doesn't support all of c++1x for the next decade. > > > > GCCfss from Sun is another alternative, but it appears to be at a crossroads > > with GCC's recent license change. ?Sun can no longer modify GCC to produce > > IL code for their compiler back-end without also releasing those tools under > > the GPL. ?Last I checked, this did have working locale support. ?This is > > really the only working C++ implementation on Solaris at this point. ?But > > its lifespan appears to be rather limited. > > > > Rob > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > -- > Stefan Teleman > KDE e.V. > stefan.teleman(a)gmail.com > > > ------------------------------ > > Message: 9 > Date: Sun, 03 Jan 2010 19:36:45 -0500 > From: Gennadiy Rozental <rogeeff(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [test] va_copy > Message-ID: <4B41381D.2010800(a)gmail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Bj?rn Roald wrote: > > On Friday 01 January 2010 10:15:29 pm Steven Watanabe wrote: > >> AMDG > >> > >> Boost.Test is still failing on some compilers that don't support > >> va_copy. Is va_copy always a macro? Would it be possible > >> to use #ifdef va_copy? > > > > If it helps, that is what is done here: > > http://svn.apache.org/repos/asf/stdcxx/branches/4.1.3/src/exception.cpp > > I'd rather stay away from ifdef va_copy. Does it required by standard > for the va_copy to be a macro? Which compiler are still failing? > > > The commit in trunk adding va_copy is also missing the va_end call and > > possibly one more call of va_copy to be correct according to the manpage. > > You mean I need va_end after va_copy? Where is another va_copy? > > Gennadiy > > > > > ------------------------------ > > Message: 10 > Date: Sun, 03 Jan 2010 19:36:45 -0500 > From: Gennadiy Rozental <rogeeff(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [test] va_copy > Message-ID: <4B41381D.2010800(a)gmail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Bj?rn Roald wrote: > > On Friday 01 January 2010 10:15:29 pm Steven Watanabe wrote: > >> AMDG > >> > >> Boost.Test is still failing on some compilers that don't support > >> va_copy. Is va_copy always a macro? Would it be possible > >> to use #ifdef va_copy? > > > > If it helps, that is what is done here: > > http://svn.apache.org/repos/asf/stdcxx/branches/4.1.3/src/exception.cpp > > I'd rather stay away from ifdef va_copy. Does it required by standard > for the va_copy to be a macro? Which compiler are still failing? > > > The commit in trunk adding va_copy is also missing the va_end call and > > possibly one more call of va_copy to be correct according to the manpage. > > You mean I need va_end after va_copy? Where is another va_copy? > > Gennadiy > > > > > ------------------------------ > > Message: 11 > Date: Sun, 03 Jan 2010 19:41:35 -0500 > From: Gennadiy Rozental <rogeeff(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Is floating_point_comparison.hpp general purpose > tool? > Message-ID: <hhrdi9$6cp$2(a)ger.gmane.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Paul A. Bristow wrote: > > I have, for my own purposes, refactored Gennidy's Boost.Test code - attached - > > with a demo. > > I'd rather have single copy of these inside boost tree. Also If we move > these under math utils hood, I'd rather keep the same name and > functionality. > > > Gennadiy > > > > ------------------------------ > > Message: 12 > Date: Sun, 3 Jan 2010 19:46:20 -0500 > From: Topher Cooper <topher(a)topherc.net> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Random]Random value from range > Message-ID: <21D741BA-5FE7-4206-B4BB-302BDB4E38F3(a)topherc.net> > Content-Type: text/plain; charset=utf-8 > > > On Jan 3, 2010, at 1:59 PM, Steven Watanabe wrote: > > >> > >> I have few question related to random library: > >> 1. Is it possibility to write function which will generate numbers from range [min, max] or (min, max) > >> > > > > (min, max) can be handled by rejection from [min, max). > > [min, max] is a bit trickier. Either way, you'll have to implement > > it yourself. > > [min, max] isn't that much trickier. It can be handled by rejection from [min, max+?). In fact, for floating types, the float_next function from the boost math toolkit will provide an ? that doesn't require rejection. The float_prior function allows (min, max) to be done without rejection. Equivalent things can be done for any numeric type with finite precision (including discrete numeric types). Indefinite precision, though, will generally require rejection. An ? very much smaller than max-min will rarely take the rejection path. > > Topher Cooper > > ------------------------------ > > Message: 13 > Date: Sun, 03 Jan 2010 18:12:43 -0700 > From: Rob Riggs <rob(a)pangalactic.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > > Sun Studio 11 using standard C++ lib > Message-ID: <4B41408B.7030201(a)pangalactic.org> > Content-Type: text/plain; charset=UTF-8; format=flowed > > Please do not top post. > > On 01/03/2010 01:44 PM, Stefan Teleman wrote: > > On Sun, Jan 3, 2010 at 15:12, Rob Riggs<rob(a)pangalactic.org> wrote: > > > > > >> C++ on Solaris is a bit of a lost cause at the moment. The near-term route > >> that we have decided to take is to abandon Sun Studio altogether and focus > >> on porting to GCC on Solaris using the GCC package from Blastwave. I > >> encourage others to consider doing the same. > >> > >> [Lots of text elided for brevity.] > >> > > the post ... contains > > numerous factually wrong, incomplete, misleading and uninformed > > statements. > > > Stefan, I believe my post is quite well informed. And your reply seems > to be intended to confuse the issue by discussing the state of affairs > of OpenSolaris. My statements do not apply to Nevada. My statements > apply to Solaris 10. This is the platform most Solaris developers > target in production environments. > > You are using the same tactics that Sun sales staff use to pitch their > operating system capabilities -- by pointing to features that exist only > in a development version of the operating system and speak as if that > were what people use on a daily basis. It is disingenuous at best. > > I notice you did not post this from your sun.com account. Do you still > speak for Sun? > > Stefan, I have followed your work on PSARC/2008/549 and am very > encouraged by the work you are doing. But it is also from the public > discussions that leave many of us questioning the status of this work. > The fact is this has not made it into Solaris proper yet and there has > been no public indication that I can find as to when it will make it > into Solaris. 12 years after c++98 and 7 years after c++03 was ratified > and the only compiler shipped by Sun that supports these standards is > GCC. What is going to happen with c++1x? > > > It is of great disservice to provide erroneous information, and that > > in response to a mailing list request for accurate information about a > > specific topic. Not only it confuses the original question, but it > > also diminishes the value of the mailing list. > > > There is nothing erroneous in my post. The purpose of my post was to > aid fellow Solaris developers by providing some of my hard-won > experience on this platform. I do not see anything that confuses the > topic beyond what is admittedly a confusing state of affairs for C++ on > Solaris. You are the one intentionally confusing the issue here. > > > - Sun does not have to wait until C++0x is ratified in order to > > provide libstdcxx, simply because libstdcxx does not yet support > > C++0x. There may exist, in the future, an implementation of the > > Apache Standard C++ Library, providing C++0x. It does not yet exist. > > > Sun's history with libCstd and with STLport implies that they would > rather live with a non-standard C++ environment than break the ABI > again. That this does not address c++1x is clealy pointed our in the > PSARC opinion paper. I am unfamiliar with Sun's internal workings. But > my understanding is that libstdcxx is going into the next Solaris > version to provide c++03 compliance and that another version will need > to be approved to support c++1x. That sucks for us C++ developers. It > will be like libCstd and stlport4 all over again. > > > - GCCFSS has nothing to do with C++, or, for that matter, with C, or > > with std::locale. GCCFSS is simply a compiler backend optimizer for > > the SPARC ISA exclusively. > > > > GCCFSS is relevant to this discussion as it is the only full-featured > and standards-compliant C++ compiler that supports locales readily > available on Solaris 10. > > Thank you for your time. > > > > --Stefan > > > > Our decision to switch from Sun Studio to GCC was an economic one. The > compiler that provides the most economic gain for us wins. In today's > market, for software that impact our business, the value to us of open > source software that compiles with GCC (and that does not compile with > Sun Studio) dwarfs the value of commercially available software packages > that require Sun Studio. That is true today and the economics are not > likely to ever swing back in favor of Sun Studio. > > Regards, > > Rob > > > ------------------------------ > > Message: 14 > Date: Sun, 03 Jan 2010 17:15:00 -0800 > From: Steven Watanabe <watanabesj(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] [test] va_copy > Message-ID: <4B414114.3090103(a)providere-consulting.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > AMDG > > Gennadiy Rozental wrote: > > Bj?rn Roald wrote: > >> On Friday 01 January 2010 10:15:29 pm Steven Watanabe wrote: > >>> AMDG > >>> > >>> Boost.Test is still failing on some compilers that don't support > >>> va_copy. Is va_copy always a macro? Would it be possible > >>> to use #ifdef va_copy? > >> > >> If it helps, that is what is done here: > >> http://svn.apache.org/repos/asf/stdcxx/branches/4.1.3/src/exception.cpp > > > > I'd rather stay away from ifdef va_copy. Does it required by standard > > for the va_copy to be a macro? Which compiler are still failing? > > From the regression tests, msvc-10.0 and intel-vc9-win-11.1. > It also fails with como-win with a vc9 back end. > > >> The commit in trunk adding va_copy is also missing the va_end call > >> and possibly one more call of va_copy to be correct according to the > >> manpage. > > > > You mean I need va_end after va_copy? Where is another va_copy? > > In Christ, > Steven Watanabe > > > > ------------------------------ > > Message: 15 > Date: Mon, 4 Jan 2010 02:32:55 +0100 > From: Bj?rn Roald <bjorn(a)4roald.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] [test] va_copy > Message-ID: <201001040232.55532.bjorn(a)4roald.org> > Content-Type: Text/Plain; charset="utf-8" > > On Monday 04 January 2010 01:36:45 am Gennadiy Rozental wrote: > > Bj?rn Roald wrote: > > > On Friday 01 January 2010 10:15:29 pm Steven Watanabe wrote: > > >> AMDG > > >> > > >> Boost.Test is still failing on some compilers that don't support > > >> va_copy. Is va_copy always a macro? Would it be possible > > >> to use #ifdef va_copy? > > > > > > If it helps, that is what is done here: > > > http://svn.apache.org/repos/asf/stdcxx/branches/4.1.3/src/exception.cpp > > > > I'd rather stay away from ifdef va_copy. Does it required by standard > > for the va_copy to be a macro? > > Latest C++0x drafts say: > > Other runtime support [support.runtime] > > Table 21 ? Header <cstdarg> synopsis > Type Name(s) > Macros: va_arg va_end va_start va_copy > Type: va_list > > And state that <cstdarg> provide same features as C99 stdarg.h with some C++ > adjustments. > > > > The commit in trunk adding va_copy is also missing the va_end call and > > > possibly one more call of va_copy to be correct according to the manpage. > > > > You mean I need va_end after va_copy? > > Yes - the Linux manual page says. > > va_copy() > An obvious implementation would have a va_list be a pointer to the > stack frame of the variadic func? > tion. In such a setup (by far the most common) there seems nothing > against an assignment > > va_list aq = ap; > > Unfortunately, there are also systems that make it an array of > pointers (of length 1), and there one > needs > > va_list aq; > *aq = *ap; > > Finally, on systems where arguments are passed in registers, it may be > necessary for va_start() to > allocate memory, store the arguments there, and also an indication of > which argument is next, so that > va_arg() can step through the list. Now va_end() can free the > allocated memory again. To accommodate > this situation, C99 adds a macro va_copy(), so that the above > assignment can be replaced by > > va_list aq; > va_copy(aq, ap); > ... > va_end(aq); > > Each invocation of va_copy() must be matched by a corresponding > invocation of va_end() in the same > function. Some systems that do not supply va_copy() have __va_copy > instead, since that was the name > used in the draft proposal. > > === end manual quote > > > Where is another va_copy? > > A bit further down the same function: > > if( tl != PASS ) { > args = args_copy; <===== > > Looks a lot like a va_list assignment. But I have no clear understanding of > the code, or va_list HOWTOs for that sake. > > -- > Bj?rn > > > ------------------------------ > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > End of Boost Digest, Vol 2780, Issue 2 > ************************************** _________________________________________________________________ Windows Live: Friends get your Flickr, Yelp, and Digg updates when they e-mail you. http://go.microsoft.com/?linkid=9691817

1 0

Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib
by shing fan 04 Jan '10

04 Jan '10

So, with limited resources (time, labour, and technical expertise on complier), would it be safe to assume that i should pursue other routes (e.g. boost with gcc or with stlport) and not continue with the beast (compling boost with libCstd?). Your professional opinion is much appreciated. > > Message: 2 > Date: Sun, 03 Jan 2010 04:10:23 +0000 > From: Mateusz Loskot <mateusz(a)loskot.net> > To: boost(a)lists.boost.org > Subject: Re: [boost] [Boost 1.41: list_of] Boost compliation error, > Sun Studio 11 using standard C++ lib > Message-ID: <4B4018AF.2020705(a)loskot.net> > Content-Type: text/plain; charset=ISO-8859-1 > > Steven Watanabe wrote: > > AMDG > > > > shing fan wrote: > >> I'm having trouble building Boost headers (e.g. > >> <boost/assign/list_of.hpp> ) with Sun Studio 11 using standard C++ > >> library. I have no problem when i build the headers using the stlport > >> lib. However, due to some restrictions, i have to use the standard > >> c++ lib but not the stlport lib. Does anyone know whether it is > >> possible to complie the following headers using sun studio 11 with > >> ONLY the standard C++ library? I'm okay to use even 1.38 as long as i > >> can compile it with Sun Studio 11 using ONLY the C++ standard library. > >> > > > > The default standard library for Sun is not supported because it > > is insufficiently standards compliant. > > I would quote Roman Shaposhnik's workshop [1] from Sun: > > "BOOST with libCstd.so.1 : Can Happen, but is insane" > > [1] http://www.osdevcon.org/2008/files/tutorial-roman/ > > Best regards, > -- > Mateusz Loskot, http://mateusz.loskot.net > Charter Member of OSGeo, http://osgeo.org _________________________________________________________________ Windows Live: Keep your friends up to date with what you do online. http://go.microsoft.com/?linkid=9691815

3 5

[Random]Random value from range
by Mariusz Kwiczala 04 Jan '10

04 Jan '10

Hello, After experiments I wrote below function. Could you verify if function is written correctly for random value from range [min,max) and uniform distribution? double RandomGenerator(const double min, const double max) { assert(min<max); static boost::lagged_fibonacci44497 gen(static_cast<unsigned int>(std::time(0))); static boost::uniform_real<> range(min, max); static boost::variate_generator<boost::lagged_fibonacci44497&, boost::uniform_real<> > generator(gen, range); const double value = generator(); return value; } I have few question related to random library: 1. Is it possibility to write function which will generate numbers from range [min, max] or (min, max) 2. Why generator (boost::lagged_fibonacci44497)is not properly initialized in some default constructor. Without static_cast<unsigned int>(std::time(0)) code generated the same values after every application run. 3. Why when I missed reference "&" in line boost::variate_generator<boost::lagged_fibonacci44497&, application crashes. Is it bug? Best regards, Mariusz

3 2

[serialization]Memory leak, VS2009, dynamic library
by Mariusz Kwiczala 03 Jan '10

03 Jan '10

Hello, I have memory leak during initialization of boost.serialization.dll. (I did not call any function from boost.serialization - some static initialization does not free resources) Is it known bug or I missed some library settings? Callstack to memory leak: msvcr90d.dll!operator new(unsigned int size=20) Line 59 + 0x9 bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!std::_Allocate<std::_Tree_nod<std::_ Tset_traits<boost::archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Node>(unsigned int _Count=1, std::_Tree_nod<std::_Tset_traits<boost::archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Node * __formal=0x00000000) Line 43 + 0xc bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!std::allocator<std::_Tree_nod<std::_ Tset_traits<boost::archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Node>::allocate(unsigned int _Count=1) Line 145 + 0xb bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!std::_Tree<std::_Tset_traits<boost:: archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Buynode() Line 1384 + 0xd bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!std::_Tree<std::_Tset_traits<boost:: archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Init() Line 1178 + 0x8 bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!std::_Tree<std::_Tset_traits<boost:: archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >::_Tree<std::_Tset_traits<boost::archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *>,0> >(const boost::archive::detail::basic_serializer_map::type_info_pointer_compare & _Parg={...}, const std::allocator<boost::archive::detail::basic_serializer const *> & _Al={...}) Line 511 C++ boost_serialization-vc90-mt-gd-1_41.dll!std::set<boost::archive::detail::bas ic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *> ::set<boost::archive::detail::basic_serializer const *,boost::archive::detail::basic_serializer_map::type_info_pointer_compare,st d::allocator<boost::archive::detail::basic_serializer const *> >() Line 81 C++ boost_serialization-vc90-mt-gd-1_41.dll!boost::archive::detail::basic_serial izer_map::basic_serializer_map() + 0x3d bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!boost::archive::detail::`anonymous namespace'::map<boost::archive::naked_binary_iarchive>::map<boost::archive:: naked_binary_iarchive>() + 0xf bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!boost::serialization::detail::single ton_wrapper<boost::archive::detail::`anonymous namespace'::map<boost::archive::naked_binary_iarchive> >::singleton_wrapper<boost::archive::detail::`anonymous namespace'::map<boost::archive::naked_binary_iarchive> >() + 0xf bytes C++ boost_serialization-vc90-mt-gd-1_41.dll!boost::serialization::singleton<boos t::archive::detail::`anonymous namespace'::map<boost::archive::naked_binary_iarchive> >::get_instance() Line 121 + 0x2a bytes C++ > boost_serialization-vc90-mt-gd-1_41.dll!`dynamic initializer for > 'boost::serialization::singleton<boost::archive::detail::`anonymous > namespace'::map<boost::archive::naked_binary_iarchive> >::instance''() > Line 142 + 0x8 bytes C++ msvcr90d.dll!_initterm(void (void)* * pfbegin=0x0049c2d8, void (void)* * pfend=0x0049c44c) Line 903 C boost_serialization-vc90-mt-gd-1_41.dll!_CRT_INIT(void * hDllHandle=0x00440000, unsigned long dwReason=1, void * lpreserved=0x0012fd30) Line 315 + 0xf bytes C boost_serialization-vc90-mt-gd-1_41.dll!__DllMainCRTStartup(void * hDllHandle=0x00440000, unsigned long dwReason=1, void * lpreserved=0x0012fd30) Line 537 + 0x11 bytes C boost_serialization-vc90-mt-gd-1_41.dll!_DllMainCRTStartup(void * hDllHandle=0x00440000, unsigned long dwReason=1, void * lpreserved=0x0012fd30) Line 507 + 0x11 bytes C Best regards, Mariusz

2 1

[uuid] - release schedule
by Andy Tompkins 03 Jan '10

03 Jan '10

Hi release managers, I have been working to get the uuid library to pass for the different toolsets in trunk. The only failures (since my last check in, changeset 58370) are for 'codegear' and 'siliconman', which have to do with the random library or the test library, both of which have lots of failures as well. Should I somehow mark them as expected failures? Or is there a way (for test at least) to use the test library differently than I am? Do you want me (I assume me) to put the uuid library into the release branch? I know this is the last day to add new libraries. I am not trying to push it in. I just want to do know what you want me to do. Wait until the next release or put it in this release? Regards, Andy.

5 11

[Boost 1.41: list_of] Boost compliation error, Sun Studio 11 using standard C++ lib
by shing fan 03 Jan '10

03 Jan '10

Hi, I'm having trouble building Boost headers (e.g. <boost/assign/list_of.hpp> ) with Sun Studio 11 using standard C++ library. I have no problem when i build the headers using the stlport lib. However, due to some restrictions, i have to use the standard c++ lib but not the stlport lib. Does anyone know whether it is possible to complie the following headers using sun studio 11 with ONLY the standard C++ library? I'm okay to use even 1.38 as long as i can compile it with Sun Studio 11 using ONLY the C++ standard library. Sample Error Message: "/Utilities/Boost/boost_1_41_0/boost/integer_fwd.hpp", line 70: Error: long_long_type is not a member of boost. "/Utilities/Boost/boost_1_41_0/boost/integer_fwd.hpp", line 70: Error: Template parameter boost::T requires a type argument. "/Utilities/Boost/boost_1_41_0/boost/integer_fwd.hpp", line 73: Error: ulong_long_type is not a member of boost. "/Utilities/Boost/boost_1_41_0/boost/integer_fwd.hpp", line 73: Error: Template parameter boost::T requires a type argument. 4 Error(s) detected. List of headers desired to build: #include <boost/algorithm/string.hpp> #include <boost/version.hpp> #include <boost/ptr_container/ptr_vector.hpp> #include <boost/utility.hpp> #include <boost/type_traits/is_convertible.hpp> #include <boost/assign/list_of.hpp> Thanks _________________________________________________________________ Windows Live: Friends get your Flickr, Yelp, and Digg updates when they e-mail you. http://go.microsoft.com/?linkid=9691817

3 2

test
by Michael 02 Jan '10

02 Jan '10

test

1 0

[threads] two threads gain lock on the same mutex??
by David M. Cotter 02 Jan '10

02 Jan '10

i thought this was impossible. but i've caught it in the debugger *right now*! on thread 28, i've got this code: boost::mutex::scoped_lock lock(i_mutex); i_waitingB = true; if (i_semID) { if (!i_signaledB) { boost::xtime xt; if (wait_duration == kDurationForever) { xt = boost::xdelay(kEventDurationDay); } else { xt = boost::xdelay(0, 0, kNanoPerMicro * wait_duration); // wait_duration is in microseconds } PC --> if (!i_semID->timed_wait(lock, xt)) { err = kMPTimeoutErr; } } if (!err) { i_signaledB = false; } } else { err = kMPDeletedErr; } the PC is waiting (for 24 hours) in the timed_wait() call (wait_duration = kDurationForever) that thread it just hanging, which is correct. however on thread 30 i've got this: if (!err) { boost::mutex::scoped_lock lock(i_mutex); PC --> i_signaledB = true; < breakpoint set here, now hit CF_ASSERT(i_semID); IX(i_semID->notify_one()); } that should be impossible, right? the PC should in fact block on that scoped_lock, right?? yes: the mutex IS the same mutex on both threads the i_mutex is of type: boost::mutex i_mutex; it is not a shared mutex i realize that if the scoped_lock were actually functioning as expected, that the signal could never be sent to the semaphore to wake up. i'll fix the code design after i figure out WHY the lock is not actually locking. but the thread WAS waking up, my program is actually functioning as it should, but given the above code it should NOT be working. what's going on here?

3 2

[graph] improvements on/documentation for transitive_reduction.hpp
by eric＠boese-wolf.eu 02 Jan '10

02 Jan '10

Hi there! I did improve on the transitive reduction and wrote some documentation. As there are multiple files now, I did not send them to the mailing list. Shall I send a tar.gz to the mailing list? How can I contribute these files to the graph library? As I wrote the code/documentation I noticed that it is possible to implement the transitive reduction by a few minor changes to the existing transitive_closure algorithm (and it would be better). I will follow that path someday in the future. Yours sincerely, Eric Böse-Wolf

2 1

Proto Help
by David A. Greene 02 Jan '10

02 Jan '10

I am trying to use proto to generate an IR for a custom language. I've got basic expressions working and am moving on to generate the statements of the custom language I'm working on getting "if" statements generated. I've attached a compilable testcase. I can't seem to get the grammar+transforms to work for the IfRule. Am I on the right track? What am I missing? Thanks. -Dave

2 2

bcp update #2: namespace renaming
by John Maddock 02 Jan '10

02 Jan '10

OK, since folks keep asking for it, bcp will now do namespace renaming, the two new options are: --namespace=newname Renames namespace boost to "newname" in all the source files copied. Also changes library names to start with the prefix "newname" or "libnewname" rather than "boost" or "libboost". --namespace-alias Makes namespace boost an alias for the new name. Using these two options you can get "strong versioning" with two different boost installs coexisting side by side (in the same application if necessary). What you can not do at present, is #include two different boost versions in the same translation unit. This update is in, and tested against, SVN Trunk only at present. Enjoy, John.

6 17

Can any one help me with this fstream
by ch.asad＠gmail.com 02 Jan '10

02 Jan '10

Hi i am new to boost. i have written a code. can any one guide me whats the issue with this code. It gives an error when I assign the File pointer to a Global poiter. " h_file = file; h_str = str; " Can any one guide me whats the issue with this and how cna i solve this issue. thanks, Asad // Accelor-test.cpp : Defines the entry point for the console application. // #include <iostream> #include <string> #include <fstream> #include <string> #include <vector> #include <iostream> #include <iterator> #include <functional> #include <boost/asio.hpp> #include <boost/algorithm/string/classification.hpp> #include <boost/algorithm/string/split.hpp> #include <boost/algorithm/string/find_iterator.hpp> #include <boost/thread/thread.hpp> using boost::asio::ip::tcp; using namespace std; using namespace boost; std::fstream h_file; int hb; int cnt; tcp::iostream h_str; //boost::mutex mutex; void Accelor_test() { std::cout<<"\nAPP started ...\n"; char ver[100]; char s1[100]; vector<std::string> strng,st,u_p; //int ef; h_str.read(ver,sizeof(ver)); std::cout<<" INBOUND : Version read : " <<ver<<std::endl; h_file.getline(s1,sizeof(s1)); std::cout<<s1<<std::endl; } void send_HB() { std::cout<<"\nHeart Beat Started..."; // boost::mutex::scoped_lock lock(mutex); char h_b[] = "HB\n"; for(;;) { boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += 1; h_str.write(h_b,sizeof(h_b)); boost::thread::sleep(xt); std::cout <<"OUTBOUND : HB ,"<< ++cnt << std::endl; } } int main(int argc, char* argv[]) { std::fstream file = std::fstream("inttest_sample.csv",std::fstream::in); if(h_file == NULL) { std::cout<<"File not found"; } char s1[100]; vector<std::string> conf,connection,u_p; int ef; h_file.getline(s1,sizeof(s1)); std::cout<<"s1 = "<<s1<<endl; std::cout<<"Split Conf"; split(conf, s1, is_any_of(","), token_compress_on); split(connection, conf[0], is_any_of(":"), token_compress_on); tcp::iostream str(connection[0],connection[1]); h_file = file; h_str = str; boost::thread thrd_hb(&send_HB); boost::thread thrd_acc(&Accelor_test); thrd_hb.join(); thrd_acc.join(); file.close(); str.close(); //std::cout<<"kjdshkjf"; } -- View this message in context: http://old.nabble.com/Can-any-one-help-me-with-this-fstream-tp26986763p2698… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[any] New feature idea for boost.any
by Andres B. 01 Jan '10

01 Jan '10

Hello, i am Andrés, i am new in the boost world and i have an idea to boost.any. With the actual boost::any i can't do this: boost::any any_var; int i; any_var = 10; i = 1 + any_var; double d; // d = 1.0 + any_var; // throw: bad_any_cast, because any_var is int any_var = 10.0; d = 1.0 + any_var - 3.0; // now any_var is double because are incompatible types. To solve this problem, we need add the casting operator and add overload the global operators. I wrote the code and actually have the global operators overloaded +, -, *, /, %. I don't know how write code to Boost, for this reason maybe has errors. namespase boost { class any { //.... public: // casting operators template <class ValueType> operator ValueType () const { return boost::any_cast<ValueType>(*this); } template <class ValueType> operator ValueType () { return boost::any_cast<ValueType>(*this); } // arithmetic operators template <typename ValueType> ValueType operator+ (const ValueType& t1) const { return (ValueType)(*this) + t1; } template <typename ValueType> ValueType operator- (const ValueType& t1) const { return (ValueType)(*this) - t1; } template <typename ValueType> ValueType operator* (const ValueType& t1) const { return (ValueType)(*this) * t1; } template <typename ValueType> ValueType operator/ (const ValueType& t1) const { return (ValueType)(*this) / t1; } template <typename ValueType> ValueType operator% (const ValueType& t1) const { return (ValueType)(*this) % t1; } //... } // End any //... // Global operators template <class ValueType> ValueType operator+ (ValueType t1, boost::any t2) { return t1 + (ValueType)(t2); } template <class ValueType> ValueType operator- (ValueType t1, boost::any t2) { return t1 - (ValueType)(t2); } template <class ValueType> ValueType operator* (ValueType t1, boost::any t2) { return t1 * (ValueType)(t2); } template <class ValueType> ValueType operator/ (ValueType t1, boost::any t2) { return t1 - (ValueType)(t2); } template <class ValueType> ValueType operator% (ValueType t1, boost::any t2) { return t1 % (ValueType)(t2); } } If you like it or not, please tell me. Excuse my English

3 2