- Boost - lists.preview.boost.org

how to compile when using read_graphml
by Alexandre de Morais Amory 15 Jan '10

15 Jan '10

Hi, I've been trying to use the function from read_graphml from BGL. I am using the test case in http://lists.boost.org/Archives/boost/2007/04/119804.php as my first case study. Apparently it compiles ok, but there is a link error. See msg bellow: ====== aamory@gaph14:~/reps/test-tools/bgl/test/sandbox-bgl$ g++ reader_test.cc In file included from /usr/include/c++/4.4/backward/hash_set:59, from /usr/include/boost/graph/adjacency_list.hpp:25, from reader_test.cc:1: /usr/include/c++/4.4/backward/backward_warning.h:28:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. /tmp/ccgvAjHU.o: In function `void boost::read_graphml<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexProps, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >(std::basic_istream<char, std::char_traits<char> >&, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexProps, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>&, boost::dynamic_properties&)': reader_test.cc:(.text._ZN5boost12read_graphmlINS_14adjacency_listINS_4vecSES2_NS_9directedSE11VertexPropsNS_8propertyINS_13edge_weight_tEdNS_11no_propertyEEES7_NS_5listSEEEEEvRSiRT_RNS_18dynamic_propertiesE[void boost::read_graphml<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexProps, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >(std::basic_istream<char, std::char_traits<char> >&, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexProps, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>&, boost::dynamic_properties&)]+0x3d): undefined reference to `boost::read_graphml(std::basic_istream<char, std::char_traits<char> >&, boost::mutate_graph&)' collect2: ld returned 1 exit status aamory@gaph14:~/reps/test-tools/bgl/test/sandbox-bgl$ ======= I guess there should be some library. Reading the doc in http://www.boost.org/doc/libs/1_38_0/libs/graph/doc/read_graphml.html it says that the lib "bgl-graphml" should be included, but I don't known where to find it. At the /usr/lib there is only the files libboost_graph-mt.a, libboost_graph-mt.so, libboost_graph-mt.so.1.38.0 It seems that the problem is just to correctly define the compilation command ... any help would be much appreciated. configuration: - boost 1.38.0 - ubuntu 9.10 64 bits - g++ 4.4.1 Thanks! Alexandre

2 4

[iterator] iterator_facade reference type problem
by Phil Endecott 15 Jan '10

15 Jan '10

Dear All, I have a problem with boost::iterator_facade. Here's an example: say I'm implementing an associative container that stores a sorted vector of keys and a separate sorted vector of values: template <typename KEY, typename VALUE> class vecmap { std::vector<KEY> keys; std::vector<VALUE> values; I can make an iterator for this that stores one iterator for each of the vectors: class iterator: public boost::iterator_facade<iterator, std::pair<KEY,VALUE>, boost::bidirectional_traversal_tag> { std::vector<KEY>::iterator ki; std::vector<VALUE>::iterator vi; void increment() { ++ki; ++vi; } void decrement() { --ki; --vi; } .... But what do I do about the reference type? I can't use std::pair<const KEY,VALUE>& because I'm not storing the keys and values in that way. It's almost possible to use std::pair<KEY,VALUE> for a const_iterator, but not if you want to allow the user to change the value through the reference. What I think I want to use is std::pair<KEY,VALUE&> i.e. the key is returned by value and only the value is returned by reference. But when I try this I get various cryptic errors about references to references and mpl things. So, has anyone else tried to do something like this? I wonder if boost::reference could be part of the solution. Thanks for any suggestions, Phil.

3 6

[graph][release][1.42] Debug code removal in release branch
by Jeremiah Willcock 15 Jan '10

15 Jan '10

A user reported some debugging code that had been left in Boost.Graph for a couple of releases. It is a simple patch and a really embarrassing bug to leave in. It is change 59005 in trunk: Index: read_graphviz_new.cpp =================================================================== --- read_graphviz_new.cpp (revision 59004) +++ read_graphviz_new.cpp (revision 59005) @@ -764,7 +764,7 @@ typedef boost::detail::graph::node_t vertex; typedef boost::detail::graph::edge_t edge; for (std::map<node_name, properties>::const_iterator i = r.nodes.begin(); i != r.nodes.end(); ++i) { - std::cerr << i->first << " " << props_to_string(i->second) << std::endl; + // std::cerr << i->first << " " << props_to_string(i->second) << std::endl; mg->do_add_vertex(i->first); for (properties::const_iterator j = i->second.begin(); j != i->second.end(); ++j) { mg->set_node_property(j->first, i->first, j->second); @@ -772,7 +772,7 @@ } for (std::vector<edge_info>::const_iterator i = r.edges.begin(); i != r.edges.end(); ++i) { const edge_info& ei = *i; - std::cerr << ei.source << " -> " << ei.target << " " << props_to_string(ei.props) << std::endl; + // std::cerr << ei.source << " -> " << ei.target << " " << props_to_string(ei.props) << std::endl; edge e = edge::new_edge(); mg->do_add_edge(e, ei.source.name, ei.target.name); for (properties::const_iterator j = ei.props.begin(); j != ei.props.end(); ++j) { @@ -782,7 +782,7 @@ std::map<subgraph_name, properties>::const_iterator root_graph_props_i = r.graph_props.find("___root___"); assert (root_graph_props_i != r.graph_props.end()); // Should not happen const properties& root_graph_props = root_graph_props_i->second; - std::cerr << "ending graph " << props_to_string(root_graph_props) << std::endl; + // std::cerr << "ending graph " << props_to_string(root_graph_props) << std::endl; for (properties::const_iterator i = root_graph_props.begin(); i != root_graph_props.end(); ++i) { mg->set_graph_property(i->first, i->second); } May I please put this into the release branch for 1.42? Thank you. -- Jeremiah Willcock

2 2

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

linear algebra (and matrix) library (again)
by DE 31 Dec '09

31 Dec '09

hi again i worked on a linear algebra library there are almost fully working prototype and its documentation in the vault (BIBLAL) http://www.boostpro.com/vault/index.php?direction=0&order=&directory=linalg& i would appreciate your interest and feedback -- Pavel ps happy new year!

1 0

Re: [boost] [date_time] quarters as new durations?
by pete＠pcbartlett.com 31 Dec '09

31 Dec '09

On Tue 22/12/09 13:54 , "Stewart, Robert" <Robert.Stewart(a)sig.com> wrote: > wrote: > > On Tue 22/12/09 13:27 , "Stewart, Robert" wrote: > > > Jeff Garland wrote: > > > > > > > > Month durations play some games to handle this problem (see > > > > docs for details) which quarters could adopt. But if you > > > > adopt the month rules then I don't thing you buy much more > > > > than simply writing > > > > > > > > const months quarters = months(3); > > > > > That's an excellent point. I don't think the fuzzy math > approach is > > > appropriate for quarters because they have a precise definition: > 1/4 > > > of a year. Months are less precise, though 365 / 4 is not a > whole > > > number, of course. > > > > Possibly opening a can of worms here, but a quarter in my > > line of work is invariably three months. If your mileage > > varies, then there could be a problem in providing a fully > > meaningful quarter duration type if people think it means > > different things. > Jeff's idea of months(3) is all you need, right? Yup, and in fact I use exactly that approach at the moment. A new duration type with quarter in the name that meant something other than three months could serve to confuse as much as it helps though, IMO.

2 1

GPL and boost
by Stefan Strasser 31 Dec '09

31 Dec '09

Hi, is there a precedent of optional(!) external library dependencies to GPLed libraries in boost? IIUC the implementation of the interface to the library in boost would constitute a derivative work of the GPLed library and therefore be "infected" by it. do the terms of the GPL then only apply if a boost user is actually using this optional code and linking to the external library or does this inhibit the distribution of such code with boost releases in general? and if so, is external distribution, e.g. in the vault, but documentation in the main library acceptable? I'm asking because of a possible interface to Oracle's Berkeley DB, but I guess this will come up again with Boost.Rdb and GPLed SQL databases.

2 2

Linking Errors in Boost Logging
by nsk＠umd.edu 31 Dec '09

31 Dec '09

Hi, I am a beginner in using the Boost Libraries. I came across them when I was trying to implement the Boost Logging Framework version2 from John Torjo's website. I tried implementing the starter project(http://torjo.com/log2/doc/html/starter_project.html) from Boost Log documentation using Visual Studios 2005 IDE. I got the following 2 errors: error C2440: '<function-style-cast>' : cannot convert from 'const char [13]' to 'boost::logging::formatter::tag::time' and error C2780: 'void boost::logging::writer::format_write<formatter_base,destinatio n_base,lock_resource,apply_format_and_write,router_type,format ter_array,destination_array>::add_formatter(formatter,const boost::logging::char_type *)' : expects 2 arguments - 1 provided So, I commented the formatter::tag::time line assuming that I don't need time to be displayed for the time being. The program complied properly but it gave me link errors: error LNK2019: unresolved external symbol "struct boost::logging::filter::use_tss_with_cache<10> * __cdecl g_l_filter(void)" (?g_l_filter@@YAPAU? $use_tss_with_cache@$09@filter@logging@boost@@XZ) referenced in function "void __cdecl `anonymous namespace'::`dynamic initializer for 'ensure_log_is_created_before_maing_l_filter''(void)" (?? __Eensure_log_is_created_before_maing_l_filter@? A0x6e6fd73c@@YAXXZ) my_app_log.obj and error LNK2019: unresolved external symbol _main referenced in function ___tmainCRTStartup MSVCRTD.lib Please let me know whether I am missing some linker dependencies. Please help! -Nik Kale

3 2

Major code changes deadline approaching
by Vladimir Prus 30 Dec '09

30 Dec '09

Boosters, The deadline for "major code changes" for 1.42 is Monday, January 4, 2010. Please try to get all big features merged to release branch by that date, and let the release team know if there are any issues. The next deadline will be Jan 11, when the release branch will be closed for all changes, except by explicit permission. -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

5 6

is_explicitly_convertible
by Daniel Frey 29 Dec '09

29 Dec '09

Just in case someone's interested: I implemented is_explicitly_convertible for GCC 4.4+ (4.3 doesn't work). Since it uses lots of C++0x-ish stuff, it is likely not a good addition to boost::type_traits, but I figured the people here might be interested anyway :) #include <type_traits> namespace boost { namespace impl { template< typename T > T make(); template< typename From, typename To > decltype( To( make< From >() ), make< std::true_type >() ) select( int ); template< typename, typename > std::false_type select( ... ); } template< typename From, typename To > struct is_explicitly_convertible : std::is_same< decltype( impl::select< From, To >( 0 ) ), std::true_type > { }; } struct X { X( double& ); explicit X( int& ); }; #define STATIC_ASSERT( X ) static_assert( X, #X ) int main() { STATIC_ASSERT(( boost::is_explicitly_convertible< double&, X >::value )); STATIC_ASSERT(( boost::is_explicitly_convertible< int&, X >::value )); STATIC_ASSERT(( !boost::is_explicitly_convertible< void*, X >::value )); } Regards, Daniel

1 0

boost::serialization, binary archive contents
by Dan 29 Dec '09

29 Dec '09

Hi All, Im not sure if this the correct mailing list or not.. in fact im not sure if i'm even going about this the right way.. forums are so much easier.. Im using the boost::serialization library, im attempting to serialize an image file from the freeimage library. It is working beautifully if i serialize to a text archive however, binary archives fail to load with a "stream error" exception. With the freeimage library i can save the image to memory and then retrieve the pointer to the start memory address and also retrieve the size. With this information I attempt the following (NOTE, "io" is the freeimage memory stream (fipMemoryIO) which is returning the memory pointer and the size): void save(Archive & ar, const unsigned int version) const { BYTE * pData; DWORD dwSize; io.acquire(&pData1, &dwSize); ar & dwSize; boost::serialization::array<BYTE> ao = boost::serialization::make_array<BYTE>(pData, dwSize); ar & ao; } void load(Archive & ar, const unsigned int version) { BYTE * pData; DWORD dwSize; ar & dwSize; pData = new BYTE[dwSize]; boost::serialization::array<BYTE> ao = boost::serialization::make_array<BYTE>(pData, dwSize); ar & ao; // <----------- This throws an exception } The above throws the exception.. even though it succeeds with a text archive. What is even more frustrating is that if (when saving) the contents pData1 points to are changed, when loading there is no exception. (Obviously the bitmap would be corrupt but thats beside the point). void save(Archive & ar, const unsigned int version) const { BYTE * pData; DWORD dwSize; io.acquire(&pData1, &dwSize); ar & dwSize; memset(pData1, 0xAB, dwSize); // <--- Add this line an no exception is thrown. boost::serialization::array<BYTE> ao = boost::serialization::make_array<BYTE>(pData, dwSize); ar & ao; } I am at a loss. If i want to write x number of bytes it should write x number of bytes no matter what those bytes are.. I must be doing something wrong because this just doesnt make sense. The exception is always thrown in basic_binary_iprimitve.hpp if(scount != s) boost::serialization::throw_exception( archive_exception(archive_exception::stream_error) ); Regards, Dan

3 4

[typeof] Determining if a type has been registered or not at compile time
by Edward Diener 27 Dec '09

27 Dec '09

Is there any way one can determine whether a type has been registered or not with Boost.Typeof at compile time so that the information can be used in TMP ? I am thinking, of course, of the use of typeof in a template, where a template parameter may or may not be aregistered type when the template has been instantiated. I would like to provide my own TMP fallback code if the type has not been registered rather than see an immediate compiler error generated. Something like: boost::mpl::eval_if < boost::typeof::registered<T>, // this would be nice to have boost::mpl::identity<BOOST_TYPEOF_TPL(some_expression)>, boost::mpl::identity</* use another facility to get the type I want into a metafunction*/> >

2 4

Interest check: Boost.Mock
by Peter Bindels 26 Dec '09

26 Dec '09

Hi all, Over the past three-quarters of a year I've been working (with three friends) on a mocking framework for C++. In our vision, it would be a good complement to Boost.Test for testing classes separate from interfaces required - it would improve the ability to unit-test the classes that tie others together and that implement higher-level algorithms. It does this by creating an object that is "derived" from a given class at runtime, and replacing the functions with functions that redirect to verifying logic. The verifying logic uses basic structures to record expectations and to verify they happened. These ways of creating an object at runtime and modifying it are highly compiler dependant but remarkably portable - as it runs on at least 3 different compiler series (GCC, MSVC, EDG-based) and 5 platforms (Windows XP, Windows CE, Linux, QNX, bare platform), with few modifications. The library has been released under the name "Hippo Mocks" already. I'm interested in submitting it to Boost for three reasons. First of all, I believe that there may be obvious or very interesting optimizations or expansions I do not notice. Second, as Christian has elaborated on already, having the Boost tag on the project makes it more noticed and more used. As it has taken quite a bit of time from me already I would like people to use it. Third, Boost.Test allows testing code but does not support mocking. In the environment of unit testing, anything that is not a base library benefits from mocking by abstracting away details that are irrelevant and that will break your test unnecessarily. For Boost the main changes would be superficial in the naming and in using more default libraries instead of a new implementation. For Hippo Mocks I've decided to make no assumptions in anything over C++98 so there's a full Tuple implementation and so on. If there's an interest I'll spend the evening porting the code to qualify for the Boost coding norms and upload it to the vault (if I can - but that should be OK). I would like you to take a look at the code and tell me what you think of it. Thanks for your time. Kind regards, Peter Bindels

8 10

Information about BMock
by Sterkin, Asher 24 Dec '09

24 Dec '09

Gennady, Recently I've came across discussion about extending the Boost.Test framework with a mocking capabilities: http://old.nabble.com/Interest-check:-Boost.Mock-td23958875.html I've even found a new header file mock_object.hpp within the 1_41 distribution, but not any documentation yet. There was a question about BMock library I developed and presented about at BoostCon09. The main differentiator of BMock from the rest of C++ frameworks I'm familiar with (except maybe MockItNow) is that it does not require neither classes, nor virtual methods. It does use heavily BOOST.Preprocessor and, at certain degree, boost meta-programming capabilities. Even though it has some historical quirks BMock has two major advantages, in my view, unsurpassable yet: a) Ability to dynamically mock ANY function or method. The function definition header needs to be wrapped with a special BMOCK_FUNCTION macro. Opposite to MockItNow this proves a fully portable solution, which does not depend on profiler API or any other low-level compiler capabilities. a) Deep integration with Boost.Test library, most importantly with its diagnostics. So far it proved itself as an extremely useful tool for embedded software development in C/C++. Attached you will find BMock documentation (sorry, not Boost standard :(). Not everything is relevant and not everything should remain, but hopefully you will get an adequate impression about how does it work from the user perspective. As I explained it to Dave during the BoostCon 09 I do not think that BMock in its current state is suitable to be a separate contribution to the Boost library, nor do I think it should be. From the beginning the BMock was conceived as a lightweight (well, as much as possible) extension to Boost.Test. If you find it interesting I will be happy to send you all sources (not too much) and to discuss how to proceed further. Regards, Asher Sterkin Asher [cid:image001.png@01CA84E9.267C30C0] <http://twitter.com/asterkin> [cid:image002.png@01CA84E9.267C30C0] <http://www.twitpic.com/photos/asterkin> [cid:image003.png@01CA84E9.267C30C0] <http://disturbingthoughts-asher.blogspot.com/> [cid:image004.gif@01CA84E9.267C30C0] <http://www.linkedin.com/pub/asher-sterkin/3/106/10a> ________________________________ This message is confidential and intended only for the addressee. If you have received this message in error, please immediately notify the postmaster(a)nds.com and delete it from your system as well as any copies. The content of e-mails as well as traffic data may be monitored by NDS for employment and security purposes. To protect the environment please do not print this e-mail unless necessary. An NDS Group Limited company. www.nds.com Gennady, Recently I’ve came across discussion about extending the Boost.Test framework with a mocking capabilities: [1]http://old.nabble.com/Interest-check:-Boost.Mock-td23958875.html I’ve even found a new header file mock_object.hpp within the 1_41 distribution, but not any documentation yet. There was a question about BMock library I developed and presented about at BoostCon09. The main differentiator of BMock from the rest of C++ frameworks I’m familiar with (except maybe MockItNow) is that it does not require neither classes, nor virtual methods. It does use heavily BOOST.Preprocessor and, at certain degree, boost meta-programming capabilities. Even though it has some historical quirks BMock has two major advantages, in my view, unsurpassable yet: a) Ability to dynamically mock ANY function or method. The function definition header needs to be wrapped with a special BMOCK_FUNCTION macro. Opposite to MockItNow this proves a fully portable solution, which does not depend on profiler API or any other low-level compiler capabilities. a) Deep integration with Boost.Test library, most importantly with its diagnostics. So far it proved itself as an extremely useful tool for embedded software development in C/C++. Attached you will find BMock documentation (sorry, not Boost standard L). Not everything is relevant and not everything should remain, but hopefully you will get an adequate impression about how does it work from the user perspective. As I explained it to Dave during the BoostCon 09 I do not think that BMock in its current state is suitable to be a separate contribution to the Boost library, nor do I think it should be. From the beginning the BMock was conceived as a lightweight (well, as much as possible) extension to Boost.Test. If you find it interesting I will be happy to send you all sources (not too much) and to discuss how to proceed further. Regards, Asher Sterkin Asher [2]twitter [3]twitpic [4]favicon [5]Linkedin _________________________________________________________________ This message is confidential and intended only for the addressee. If you have received this message in error, please immediately notify the postmaster(a)nds.com and delete it from your system as well as any copies. The content of e-mails as well as traffic data may be monitored by NDS for employment and security purposes. To protect the environment please do not print this e-mail unless necessary. An NDS Group Limited company. www.nds.com References 1. http://old.nabble.com/Interest-check:-Boost.Mock-td23958875.html 2. http://twitter.com/asterkin 3. http://www.twitpic.com/photos/asterkin 4. http://disturbingthoughts-asher.blogspot.com/ 5. http://www.linkedin.com/pub/asher-sterkin/3/106/10a

1 0

[optional] Strict Aliasing Warnings on Trunk
by Dean Michael Berris 24 Dec '09

24 Dec '09

I've recently been seeing this error more and more especially on GCC with -Wall: /home/dean/boost/boost/optional/optional.hpp:407: warning: dereferencing pointer ‘<anonymous>’ does break strict-aliasing rules /home/dean/boost/boost/optional/optional.hpp:427: note: initialized from here and: /home/dean/boost/boost/function/function_base.hpp:321: warning: dereferencing type-punned pointer will break strict-aliasing rules /home/dean/boost/boost/function/function_base.hpp:325: warning: dereferencing type-punned pointer will break strict-aliasing rules This is on Linux and GCC 4.4.1. I'm not an expert in this regard but is there a way to either silence or avoid these warnings? Anything you want me to try from my end? Thanks in advance and I hope this helps. -- Dean Michael Berris blog.cplusplus-soup.com | twitter.com/mikhailberis linkedin.com/in/mikhailberis | facebook.com/dean.berris | deanberris.com

12 40

Using Boost.Atomic for shared_ptr
by Phil Endecott 24 Dec '09

24 Dec '09

Dear All, I have just had a quick look at how easily shared_ptr could be adapted to use Helge's proposed Boost.Atomic. To me it looks very simple, but maybe someone who knows more about all this could have a look? I took the non-threaded implementation in sp_counted_base_nt.hpp as a starting point, and simply changed the two counts from long to boost::atomic<long> : boost::atomic<long> use_count_; // #shared boost::atomic<long> weak_count_; // #weak + (#shared != 0) Then, the majority of the methods don't need to change since the atomic template provides atomic versions of e.g. operator++. The one that does need more work is add_ref_lock, which I've implemented as follows: bool add_ref_lock() // true on success { while (1) { long c = use_count_; if (c == 0) return false; if (use_count_.compare_exchange_weak(c,c+1)) return true; } } There is also the question of memory barriers. I understand that things like operator++ provide the most pessimistic memory barriers, so ideally these should be replaced with calls that use the right barriers. Does anyone have any thoughts about how this would compare with the current custom assembler implementations? Cheers, Phil.

4 5

[fusion] change on trunk breaking proto
by Eric Niebler 23 Dec '09

23 Dec '09

Hi Fusion gurus. I'm chasing an elusive bug that the following Proto test has exposed: http://beta.boost.org/development/tests/trunk/developer/output/RW_WinXP_VC-… All is well on the release branch, but on trunk, Proto's examples.cpp test is failing -- but only on MSVC! I suspect Fusion because if I replace the version of Fusion on trunk with the one on release all is well. (Caveat: when I do this, I also need to make a corresponding change to the as_callable function object in proto/transform/fold.hpp to accommodate the changed argument order of fusion::fold's functor.) It seems something is causing MSVC to prematurely instantiate a template used in a Proto transform, but I can't see what. I first suspected the recent changes to fusion::fold, but that seems not to be the case. If I just take the release version of fusion::fold, the problem still manifests. The problem must be elsewhere. Does anyone from Fusion team want to give this a crack? I'll be happy to help. -- Eric Niebler BoostPro Computing http://www.boostpro.com

4 7

Interprocess message queue implementation
by Alex Miller 22 Dec '09

22 Dec '09

Hello, I have been looking over the implementation of Boost.Interprocess's message queues, and have become slightly confused as to the reasoning for how it was designed. Assuming my understanding is correct, it allocates a piece of shared memory, and then constructs a message queue within that piece of memory. Is there a reason that this was done in favor over implementing it by using SystemV's message queues ( the one located in <sys/msg.h> )? Thanks, Alex Miller

1 0

Re: [boost] [date_time] quarters as new durations?
by pete＠pcbartlett.com 22 Dec '09

22 Dec '09

On Tue 22/12/09 13:27 , "Stewart, Robert" <Robert.Stewart(a)sig.com> wrote: > Jeff Garland wrote: > > Stewart, Robert wrote: > > > Thomas Lemm wrote: > > >> I am happily using the boost date_time library and I plan to > > >> extend it towards including quarters as new (gregorian) date > > >> durations, just the way months are included already > > >> (excluding parsing of quarters) > > > > > > Why excluding parsing? That would imply only partial > > > support relative to other durations, right? > > > > > Well, so quarters turns out to be like months as far as > > durations go -- that is, it's mathematical like days and > > weeks. So the big drawback you face is dealing with the > > associated "fuzzy math". For example, what's the result > > of > > > > date("2008-Feb-28") + quarters(1) = ? > > date("2008-Feb-27") + quarters(1) = ? > > > > Month durations play some games to handle this problem (see > > docs for details) which quarters could adopt. But if you > > adopt the month rules then I don't thing you buy much more > > than simply writing > > > > const months quarters = months(3); > That's an excellent point. I don't think the fuzzy math approach is > appropriate for quarters because they have a precise definition: 1/4 > of a year. Months are less precise, though 365 / 4 is not a whole > number, of course. Possibly opening a can of worms here, but a quarter in my line of work is invariably three months. If your mileage varies, then there could be a problem in providing a fully meaningful quarter duration type if people think it means different things. > There is probably still a need to use some fuzzy math in order to > determine the calendar date for quarter boundaries. Quarters are > usually associated with a fiscal year and there are different > definitions of those, so you probably need to add fiscal year support > and make quarters a derived concept. > > There's also an argument against adding quarters as a > > duration. I have an app somewhere in which I have quarter > > defined as a date_period so I could write: > > > > date_period q = quarter(2009, 1); > > > > To me at least this seems like the more likely application. > I agree. I didn't consider the ramifications of duration versus > period. The issue routinely occurs with months already though. Month durations and date_periods spanning a specific month already have to work closely with each other: date_period month_containing(date d) { return date_period(date(d.year(),d.month(),1) , months(1) ); } so it may not be a big issue.

2 1

[date_time] quarters as new durations?
by Thomas Lemm 22 Dec '09

22 Dec '09

Hi, I am happily using the boost date_time library and I plan to extend it towards including quarters as new (gregorian) date durations, just the way months are included already (excluding parsing of quarters) Now my question: What are the chances that his change might make it into the boost date_time library? Is there some interest in this feature, if so I would provide a patch to update source and documentation to include the quarters as a new duration. Please let me know, Kind regards Thomas Lemm

3 3

[ANN] CLI 1.1.0 released
by Boris Kolpackov 21 Dec '09

21 Dec '09

Hi, Seeing that I've got a lot of useful feedback for the initial release, I am pleased to announce the availability of CLI 1.1.0. CLI is an open-source (MIT license), cross-platform command line interface compiler for C++. It allows you to specify the options that your program supports, their types, default values, and documentation. This specification can then be automatically translated to C++ classes that implement parsing of the command line arguments and provide a convenient and type-safe interface for accessing the extracted data. The automatic usage and documentation generation is by far the biggest new feature in this release. The usage information is formatted during compilation and the documentation can be generated in the HTML and man page formats. For an example of the HTML output, see the documentation for the CLI compiler itself (you may also want to check the cli.1 man page and the usage information printed by the compiler): http://www.codesynthesis.com/projects/cli/doc/cli.xhtml Other new features in this release: * Optional generation of modifiers in addition to accessors. * Support for erasing the parsed elements from the argv array. * Support for custom argument sources via an abstract scanner interface. * Support for reading command line arguments from the argv array as well as files specified with command line options. For a more detailed list of new features in this release see: http://www.codesynthesis.com/pipermail/cli-users/2009-December/000001.html More information, documentation, and source code distributions are available from the project's web page: http://www.codesynthesis.com/projects/cli/ Enjoy, Boris -- Boris Kolpackov, Code Synthesis http://codesynthesis.com/~boris/blog Open-source XML data binding for C++ http://codesynthesis.com/products/xsd XML data binding for embedded systems http://codesynthesis.com/products/xsde Command line interface to C++ compiler http://codesynthesis.com/projects/cli

5 7

[serialization] optional serialization and non-default-constructables
by Felipe Magno de Almeida 21 Dec '09

21 Dec '09

Hello, serialization for boost.optional calls load_construct_data but doesn't call save_construct_data. Which causes serialization for non-default-constructables to break. Regards, -- Felipe Magno de Almeida

1 1

Re: [boost] [msm] Review
by Christophe Henry 21 Dec '09

21 Dec '09

>> You brought 2 reasons for this impossibility: >> 1. Automatic entry/exit. You answer that "With separate FSMs you'd >> have to manage this yourself". >> 2. Automatic event dispatch. You answer that "Again, with separate >> FSMs you'd have to do that yourself (dispatch to first FSM and if that >> didn't consume the event, dispatch to second FSM and so on)." > > It appears that you should read the 2005 post a lot more carefully, > especially the quoted context. The remarks you quote above have *nothing* to > do with the impossibility I claimed. 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.

3 2

What about "Maybe" ?
by Arnaud Masserann 21 Dec '09

21 Dec '09

Hi, Is there any interest for a "Maybe" utility class, like the one in Haskell ? For those who don't know about Maybe, here is the Haskell ref : http://www.haskell.org/ghc/docs/6.10.4/html/libraries/base/Prelude.html#t%3… And a code snippet showing its use : http://pastebin.com/m3a590d6e Arnaud

5 7

How to detect if f() returns void or not?
by Frédéric Bron 21 Dec '09

21 Dec '09

I would like to detect if the return type of a function is void or not within C++03 standard? I need that to implement new type traits to detect if types can be compared and to detect for example operator< returning void. The following code compiles only with c++0x standard and keyword decltype but not with c++03 standard and BOOST_TYPEOF. Frédéric #include <iostream> #include <boost/type_traits/is_void.hpp> #include <boost/typeof/typeof.hpp> void returns_void(); int returns_int(); int main() { std::cout<<std::boolalpha; // std::cout<<boost::is_void< BOOST_TYPEOF(returns_void()) >::value<<'\n'; // std::cout<<boost::is_void< BOOST_TYPEOF(returns_int()) >::value<<'\n'; std::cout<<boost::is_void< decltype(returns_void()) >::value<<'\n'; std::cout<<boost::is_void< decltype(returns_int()) >::value<<'\n'; return 0; }

17 36

[bind] Function call operator is a template?!
by Andy Venikov 20 Dec '09

20 Dec '09

All this time I've been using bind quite happily without really going into the details of its implementation. Recently, however, I had to discover the hard way that the function call operator that is produced as part of the bind() return is a template! I guess most of the time one would not care if it's a template or not as long as you can call the resulting functor with the right signature. It does, however, make a difference. The difference can be seen when calling the resulting functor with wrong arguments. The error detection happens earlier in the case when functor's operator() is a concrete function as opposed to a template. And that plays bad tricks with SFINAE. You see, recently I was faced with a challenge where I had to check at compile time whether calling a template argument with a specific signature is a well-formed expression. Something similar to Eric Niebler's "can_be_called<>": http://www.boost.org/doc/libs/1_41_0/doc/html/proto/appendices.html#boost_p… Well, this technique won't work with bind(), because the template member operator() will happily accept ANY argument during SFINAE and the error detection will happen much later, when you actually try to call the functor. I'm not going to debate whether it's right or wrong, but I'm still curious - why did it have to be a template? When bind() is called it already has all the information about the function's signature so it could construct a concrete member operator() without resorting to templates. For example bind(main) could easily determine that the signature is <int (int, char * [])> and could create a functor with a single "int operator()(int, char *[])", instead of a template. It's not like it's lambdas, where when you say _1 + _2 you literally mean parameters of any type. Thanks, Andy.

4 5

getting errors whti boost.
by ch.asad＠gmail.com 19 Dec '09

19 Dec '09

Hi I am getting errors when i ininclude boost header file in my project. my progrm is running fine. I want ot use boost asio in my program. But when just write "include<boost/asio>" or any other header fie of boost in my program i am getting below errors. It just started all of a suddden before that it was working fine. I am tring it with Eclpse and MinGW.Please also guide me how t setup boost for Visual C++.net 9.0. I have tried boost_1_38_0 and boost_1_41_0 but same problem. i am getting the following errors on eclipse. Thanks in advance, -Asad Description Resource Path Location Type (Errors 5) D:/boost/boost_1_38_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' test project 206 C/C++ Problem D:/boost/boost_1_38_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' test project 211 C/C++ Problem D:/boost/boost_1_38_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' test project 212 C/C++ Problem D:/boost/boost_1_38_0/boost/system/error_code.hpp undefined reference to `boost::system::get_system_category()' test project 205 C/C++ Problem D:/boost/boost_1_38_0/boost/system/error_code.hpp undefined reference to `boost::system::get_system_category()' test project 213 C/C++ Problem (Warnings 9) Description Resource Path Location Type D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp #warning Assuming _WIN32_WINNT=0x0501 (i.e. Windows XP target). test project 39 C/C++ Problem D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp #warning For example, add -D_WIN32_WINNT=0x0501 to the compiler command line. test project 38 C/C++ Problem D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp #warning Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately. test project 37 C/C++ Problem D:/boost/boost_1_38_0/boost/date_time/filetime_functions.hpp left shift count >= width of type test project 101 C/C++ Problem Invalid project path: Include path not found (C:\MinGW\include\c++\4.3.2-dw2). test project pathentry Path Entry Problem Invalid project path: Include path not found (C:\MinGW\include\c++\4.3.2-dw2\backward). test project pathentry Path Entry Problem Invalid project path: Include path not found (C:\MinGW\include\c++\4.3.2-dw2\i686-pc-mingw32). test project pathentry Path Entry Problem Invalid project path: Include path not found (C:\MinGW\lib\gcc\i686-pc-mingw32\4.3.2-dw2\include-fixed). test project pathentry Path Entry Problem Invalid project path: Include path not found (C:\MinGW\lib\gcc\i686-pc-mingw32\4.3.2-dw2\include). test project pathentry Path Entry Problem And on the console it shows like : **** Internal Builder is used for build **** g++ -ID:\boost\boost_1_38_0 -O0 -g3 -Wall -c -fmessage-length=0 -osrc\test project.o ..\src\test project.cpp In file included from D:/boost/boost_1_38_0/boost/asio/detail/win_iocp_io_service_fwd.hpp:24, from D:/boost/boost_1_38_0/boost/asio/io_service.hpp:37, from D:/boost/boost_1_38_0/boost/asio/basic_io_object.hpp:20, from D:/boost/boost_1_38_0/boost/asio/basic_socket.hpp:24, from D:/boost/boost_1_38_0/boost/asio/basic_datagram_socket.hpp:25, from D:/boost/boost_1_38_0/boost/asio.hpp:20, from ..\src\test project.cpp:12: D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp:37:5: warning: #warning Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately. D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp:38:5: warning: #warning For example, add -D_WIN32_WINNT=0x0501 to the compiler command line. D:/boost/boost_1_38_0/boost/asio/detail/socket_types.hpp:39:5: warning: #warning Assuming _WIN32_WINNT=0x0501 (i.e. Windows XP target). In file included from D:/boost/boost_1_38_0/boost/date_time/microsec_time_clock.hpp:23, from D:/boost/boost_1_38_0/boost/date_time/posix_time/posix_time_types.hpp:11, from D:/boost/boost_1_38_0/boost/asio/detail/select_reactor.hpp:25, from D:/boost/boost_1_38_0/boost/asio/impl/io_service.ipp:27, from D:/boost/boost_1_38_0/boost/asio/io_service.hpp:550, from D:/boost/boost_1_38_0/boost/asio/basic_io_object.hpp:20, from D:/boost/boost_1_38_0/boost/asio/basic_socket.hpp:24, from D:/boost/boost_1_38_0/boost/asio/basic_datagram_socket.hpp:25, from D:/boost/boost_1_38_0/boost/asio.hpp:20, from ..\src\test project.cpp:12: D:/boost/boost_1_38_0/boost/date_time/filetime_functions.hpp: In function `uint64_t boost::date_time::winapi::file_time_to_microseconds(const FileTimeT&)': D:/boost/boost_1_38_0/boost/date_time/filetime_functions.hpp:101: warning: left shift count >= width of type g++ -LC:\boost_1_38_0\libs -LC:\STLport-5.2.0\build\lib -otestproject.exe src\test project.o src\test project.o: In function `Z41__static_initialization_and_destruction_0ii': D:/boost/boost_1_38_0/boost/system/error_code.hpp:205: undefined reference to `boost::system::get_system_category()' D:/boost/boost_1_38_0/boost/system/error_code.hpp:206: undefined reference to `boost::system::get_generic_category()' D:/boost/boost_1_38_0/boost/system/error_code.hpp:211: undefined reference to `boost::system::get_generic_category()' D:/boost/boost_1_38_0/boost/system/error_code.hpp:212: undefined reference to `boost::system::get_generic_category()' D:/boost/boost_1_38_0/boost/system/error_code.hpp:213: undefined reference to `boost::system::get_system_category()' src\test project.o: In function `ZN5boost6detail17sp_counted_impl_pINS_4asio6detail12winsock_initILi2ELi0EE7do_initEE11get_deleterERKSt9type_info': D:/boost/boost_1_38_0/boost/detail/sp_counted_impl.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initD1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::~do_init()]+0x7): undefined reference to `WSACleanup@0' D:/boost/boost_1_38_0/boost/detail/sp_counted_impl.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initC1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::do_init()]+0x1f): undefined reference to `WSAStartup@8' D:/boost/boost_1_38_0/boost/detail/sp_counted_impl.hpp:(.text$_ZN5boost4asio5error19get_system_categoryEv[boost::asio::error::get_system_category()]+0x7): undefined reference to `boost::system::get_system_category()' collect2: ld returned 1 exit status Build error occurred, build is stopped Time consumed: 4886 ms. -- View this message in context: http://old.nabble.com/getting-errors-whti-boost.-tp26856283p26856283.html Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

Re: [boost] [msm] Review
by Christophe Henry 18 Dec '09

18 Dec '09

>> Now it's proven that the concepts of the MPL book were right, that it >> was indeed possible to implement at least as much as statechart with >> metaprogramming techniques. >> That this wasn't evident, as shown here >> (http://lists.boost.org/Archives/boost/2005/03/81853.php) > >For the record, back in 2005 I only expressed the opinion that it's not >possible to implement a purely meta-programming-based FSM framework that >supports both multi-TU machines and orthogonal regions. This should be >obvious from the context quoted in the linked message. I'm happy that you offer to clarify your thoughts because I'm afraid it isn't that obvious to me. You brought 2 reasons for this impossibility: 1. Automatic entry/exit. You answer that "With separate FSMs you'd have to manage this yourself". 2. Automatic event dispatch. You answer that "Again, with separate FSMs you'd have to do that yourself (dispatch to first FSM and if that didn't consume the event, dispatch to second FSM and so on)." Your point was that these 2 cases would have to be managed manually by the user and I fail to see what this has to do with multiple-TUs. Could you please explain this as it still seems unclear to me? Your answer was not about compile-time or recompiling if the structure of a region or separate FSM was changed, which would have been another issue and I would perfectly understand and accept this argument. What I understood from your post is that a full-metaprogramming fsm would not manage these 2 points because of some statechart-specific multiple-TU considerations, and I'd be grateful if you could explain them to me. >IIUC then MSM does not support multi-TU FSMs and you have so far not >expressed any plans to support them, right? I fail to see the difference with Statechart except on the amount of metaprogramming done. Please help me on that one, if I changed in Statechart the reactions typedef in the submachine and thus the submachine header, it would be, from a recompiling perspective, the same result as a full-metaprogramming fsm, right? If this really only is a difference in compile-time, I think this has already been discussed. To multiple TUs with MSM: An application is made of a fsm structure and lots more of user code. This user code can well be in another TU. The metaprogramming in the top-level fsm needs the header of a sub-fsm in order to let the compiler do its job, which is probably also what Statechart does or am I missing something? Reading again the explanation in Statechart's doc (http://www.boost.org/doc/libs/1_40_0/libs/statechart/doc/tutorial.html#Spre…) I found in Camera.cpp: #include "Shooting.hpp" Which increases my confusion. It seems that Statechart's top-level fsm also needs the submachine header, which seems to make the multiple-TU point moot. Recompiling is another issue, which you didn't mention at that time (though it would have been a valid one), so please allow me to discuss it already now as it's likely that you'll bring this one next. By moving your submachines' application code into different TUs, you'll gain some compile-time if the submachine actions or application code also would cause long compile-times. You'll also gain that a change in a sub-fsm will not cause all to recompile but only the TUs of this fsm and the top-level one. The fact that I put all my submachines into one header doesn't force you to do the same. So yes, you probably can't spread the library metaprogramming work around different TUs, but you can full well spread the application work. Depending of how much this is, it can reduce your compile-time or be not visible. Again, what is concretely the difference with Statechart? Christophe

2 1

boost_1_40_0/boost/lambda/if.hpp && merging different return types
by Peter Foelsche 18 Dec '09

18 Dec '09

Am I doing something wrong, or is this patch really necessary? I'm using if_then_else_return() and the return types are different. I'm overloading return_type_2<other_action<ifthenelsereturn_action>, A, B> to let the compiler deduce the correct return type. Peter diff -w -c ./if.hpp /users/pfoelsch/boost_1_40_0/boost/lambda/if.hpp *** ./if.hpp Sat Jun 28 06:57:20 2008 --- /users/pfoelsch/boost_1_40_0/boost/lambda/if.hpp Tue Dec 15 15:19:50 2009 *************** *** 310,318 **** template<class RET, CALL_TEMPLATE_ARGS> RET call(CALL_FORMAL_ARGS) const { return (detail::select(boost::tuples::get<0>(args), CALL_ACTUAL_ARGS)) ? ! detail::select(boost::tuples::get<1>(args), CALL_ACTUAL_ARGS) : ! detail::select(boost::tuples::get<2>(args), CALL_ACTUAL_ARGS); } }; --- 310,318 ---- template<class RET, CALL_TEMPLATE_ARGS> RET call(CALL_FORMAL_ARGS) const { return (detail::select(boost::tuples::get<0>(args), CALL_ACTUAL_ARGS)) ? ! RET(detail::select(boost::tuples::get<1>(args), CALL_ACTUAL_ARGS)) : ! RET(detail::select(boost::tuples::get<2>(args), CALL_ACTUAL_ARGS)); } };

1 1

[fiber] version 03.1 docu update (incl. html)
by Oliver Kowalke 18 Dec '09

18 Dec '09

version 0.3.1 has an updated documentation - html pages are added to the archive regards, Oliver

1 0

iPhone mangled symbol size explosion in release
by Michael Marcin 18 Dec '09

18 Dec '09

We're currently working to ship an iPhone application that makes heavy use of Boost. The compiled executable is absurdly large, partly to third party libraries, partly to our own insufficent coding practices, but strikingly it seems that (from looking at the executable in a hex editor) around 4MB of the 9.5MB app size is mangled boost function names. We are statically linking against the libraries in Boost we are using. Here are some examples: __ZN5boost13serialization9singletonIN S_7archive6detail11oserializerINS2_12 xml_oarchiveEN6newton18Vector3InitializerEEEE12get_instanceEv __ZNK5boost6spirit8sequenceINS1_INS1_ INS0_6strlitIPKwEENS0_4ruleINS0_7scan nerIN9__gnu_cxx17__normal_iteratorIPc SsEENS0_16scanner_policiesINS0_16iter ation_policyENS0_12match_policyENS0_1 3action_policyEEEEENS0_5nil_tESI_EEEE NS0_5chlitIwEEEENS0_6actionISJ_NS_7ar chive3xml11assign_implISsEEEEE5parseI SH_EENS0_13parser_resultISU_T_E4typeERKSX_ AFAIK All application functions should have been hard-linked since we're statically linking and thus not require any type of named reference. Am I perhaps missing or misusing a Boost configuration setting or compiler flag? Thanks, Michael Marcin

2 2

Failed to upgrade to Boost 1.39.0 (from 1.34.0)
by gaofg 17 Dec '09

17 Dec '09

Hi, In past years, we have been used boost 1.34.0 in our projects, and it works fine. Now days, we want to update the boost to 1.39.0, but when we change the include directories and lib path to use boost 1.39.0, the following compile error occured: 1>d:\reference\boost\v1_39_0\boost\type_traits\type_with_alignment.hpp(138) : error C2061: syntax error : identifier 'BOOST_PP_LIST_FOLD_RIGHT_BOOST_PP_IIF_BOOST_PP_BITAND_1BOOST_PP_LIST_FOLD_LEFT_CHECK_BOOST_PP_IIF_BOOST_PP_CHECK' 1> d:\reference\boost\v1_39_0\boost\type_traits\type_with_alignment.hpp(143) : see reference to class template instantiation 'boost::detail::lower_alignment<target>' being compiled 1>d:\reference\boost\v1_39_0\boost\type_traits\type_with_alignment.hpp(138) : error C2059: syntax error : ')' 1>d:\reference\boost\v1_39_0\boost\type_traits\type_with_alignment.hpp(138) : error C2143: syntax error : missing ')' before '(' 1>d:\reference\boost\v1_39_0\boost\type_traits\type_with_alignment.hpp(138) : error C2061: syntax error : identifier 'BOOST_PP_LIST_FOR_EACH_I_M' ... I have tried several ways to resovlve it, but all failed. Does anyone know how to fix this issue or any advice? I really appreciate your help. Best Regards, wind.

2 1

[TypeTraits] is it possible to add something to boost.type_traits?
by frederic.bron＠alcan.com 17 Dec '09

17 Dec '09

Dear boost implementers, TypeTraits is very useful, thanks you. However, recently, I needed something to know if a type is comparable (with operator<) and that was not in the library. Fortunately, somebody forwarded me an earlier post on the users list where I could find what I wanted. The implementation was inspired from boost/detail/is_incrementable.hpp I have written is_less_comparable, is_less_equal_comparable, is_greater_comparable... inspired from the same source and I wonder if it could be possible to add it to the library as I think it could be helpful for others. I give the source code below (if it is useful) but I am not able to make it fully general as it is in boost/type_traits. In particular, I do not understand all the macros that are used. Regards, F. Bron (See attached file: is_comparable.hpp) Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

11 23

[property] interest in C# like properties for C++?
by Peder Holt 17 Dec '09

17 Dec '09

I have implemented a prototype support for properties in C++. It has no space overhead as it manages to deduce the this pointer of the class owning it. Code sample: #include <boost/static_assert.hpp> #include <boost/property.hpp> #include <iostream> class class_with_property { public: //Implement property template template<typename Base> class property_with_a_sensible_name : public Base { public: void set(const double& a) { //Implement setting of the variable here. m_var=a; //You can access the owner of the property's this value by calling self(), e.g. self()->refresh(); } const double& get() const { return m_var; } private: double m_var; }; void refresh() { std::cout << "Refreshed"; } //Instantiate property template. These can be reused. BOOST_PROPERTY(class_with_property,property_with_a_sensible_name,property_name); }; //And usage: void test() { class_with_property cls; cls.property_name=54.3; BOOST_STATIC_ASSERT(sizeof(class_with_property)==sizeof(double)); } The trick used is the following: class my_class { public: class property_x { public: my_class* self() { //Find offset of member relative to my_class size_t offset=size_t(&((my_class*)0)->x); //Use this to deduce the address of my_class return reinterpret_cast<my_class*>(size_t(this)-offset); } }; property_x x; }; It currently support: Read/Write properties Read properties Write properties Not supported yet: indexed properties operator overloads for properties, e.g. my_class.property*my_class.property will currently fail. Regards Peder

17 64

[ptr_container] ptr_map insert with non-const vs. const reference
by Martin B. 17 Dec '09

17 Dec '09

Hi there, After thinking a while about the issue with the two insert functions of ptr_map and why the one with the raw pointer takes a non-const reference ... See: http://www.boost.org/doc/libs/1_41_0/libs/ptr_container/doc/faq.html#why-do… or http://lists.boost.org/boost-users/2007/09/31014.php I would like to add the following thoughts: ptr_map provides two functions (a) std::pair<iterator,bool> insert( key_type& k, value_type x ); (b) template< class U > std::pair<iterator,bool> insert( const key_type& k, std::auto_ptr<U> x ); Now, I understand the rationale behind having (a) take a non-const reference since this means less potential ctor calls means less potential for a leak. I think the rationale makes sense but it's still easily possible for users to shoot themselves in the foot. Maybe the documentation of these two functions should be expanded upon as I've just spent about 1 1/2 hours to make sense of it all :-) Consider these examples: using namespace std; using namespace typedef boost::ptr_map<string, Foo> foomap_t; foomap_t the_foo_map; // 1 (a) - correct usage string key("key-string"); // need key object to take reference Foo* p = new Foo(); the_foo_map.insert(key, p); // compiles OK // 2 (a) - incorrect usage Foo* p = new Foo(); string key("key-string"); // need key object to take reference - leaks p if throws the_foo_map.insert(key, p); // compiles OK // 3 (b) - correct usage std::auto_ptr<Foo> p(new Foo()); the_foo_map.insert("key-string", p); // 4 (b) - incorrect usage Foo* p = new Foo(); the_foo_map.insert("key-string", std::auto_ptr<Foo>(p)); // compiles OK, but may leak if the implicit Key constructor throws (which only happens for string for bad_alloc, but this is just an example) So my point is, that the non-const reference insert() fails to protect the user from shooting himself in the foot, but it succeeds at highlighting the problem, so the problem should be expanded upon in the docs, shouldn't it? If we have a raw-pointer then no matter of fiddling on ptr_maps part can make it completely exception safe, the user code has to provide that. The raw pointer should already be wrapped in a smart-pointer. So (a) is unsuited for the case where the raw-pointer exists prior to the key object. There is only one case where having the (a) version around makes sense and that is when we have another smart-ptr type: // 5 (a) correct usage string key("key-string"); the_foo_map.insert(key, p.Detach()); // makes a lot more sense than std::auto_ptr<Foo> ap(p.Detach()); the_foo_map.insert("key-string", ap); cheers, Martin

2 1

Any interest in static plugins?
by Dave van Soest 16 Dec '09

16 Dec '09

Hi all, I created a template-based header-only library for creating static plugin systems. I'm wondering whether there would be any interest to include such a library in Boost. About static plugins: Static plugins are not as common as dynamic plugins, but they have some useful applications. Static plugins are a way to extend the functionality of a program or library without having to change the existing source files, just by adding a source file or object file, which is then linked statically against the already existing object files. Some reasons you might be doing this: - You don't have permission to change the existing source files. - You don't have the source files, only the object and header files. - You don't want to have to change existing sources every time you extend functionality. - Simply including or excluding the object file from the linking process adds or removes functionality from the program or library, leaving no traces inside. - Different configurations can be build easily this way. - Testing only the required functionality without having to build the full application. - And some other advantages it shares with dynamic plugins. If there appears to be any interest I will post more information and some code and code examples. Best regards, Dave van Soest

9 30

[endian] ARM support
by Phil Endecott 16 Dec '09

16 Dec '09

Dear All, Can ARM support be added to detail/endian.hpp ? It's complicated by the fact that ARM systems may have either endianness. I believe that the symbols __ARMEL__ and __ARMEB__ are defined by gcc for the little- and big-endian cases respectively. However, it also seems that gcc defines __LITTLE_ENDIAN__; can we just test for that? There is possibly some confusion with __LITTLE_ENDIAN and __BIG_ENDIAN (no trailing __s) which I believe glibc defines both of as 4321 and 1234, but it should be OK to write: #elif defined(__LITTLE_ENDIAN__) && !defined(__BIG_ENDIAN__) ... I suspect someone has looked at this before. It can't do any harm to add all of the potential tests, can it? Thanks, Phil.

1 0

Re: [boost] [explore] Extending namespace std
by Jeffrey Faust 16 Dec '09

16 Dec '09

Hello again. I previously presented an argument of why our best option for container streaming is to extend namespace std. I was surprised by the dearth of responses, but I understand that we're all busy and I admit was a bit wordy. Here is my argument again with, heavily snipped. I think this is the most important issue in making this a boost library. Thanks for reading. Jeffrey Faust wrote: > In my opinion the ideal interface is the most natural, > simplest, and the most familiar to C++ developers: 'cout << c;' where > c is a container of type C. > > The only way I know how to make 'cout << c;' work for all cases is to > put operator<<(C) in the same namespace as C. For example, > variant<C, ...> will not stream if C is in std and operator<<(C) is > not. > > In regards to extending namespace std, I understand what the standard > says and I think I understand the reasons behind it. One could add > something to namespace std that conflicts with an existing item, > changing the behavior. This is undefined behavior, and the > standard is right in restricting it. I don't believe this problem > exists for this library in how we plan to extend std. > > If we know that on all supported compilers that extending namespace > std in this way behaves correctly, what is the concrete problem of > doing so? -- Jeff Faust

3 2

[thread] 1.41.0 regression
by Dmitry Goncharov 16 Dec '09

16 Dec '09

Hi, The thread_data_base constructor is defined in a header file. Function make_external_thread_data() is defined in a .cpp file. This can lead to a situation when different libraries contain the definitions of these functions. The example below explains how this can happen and why this causes problems. The new version of struct thread_data_base contains an std::map member. The size of an std::map object depends on if libboost_thread.so was build with or w/o _GLIBCXX_DEBUG. libboost_thread.so contains make_external_thread_data(). This function allocates an instance of thread_data_base. Due to an std::map member the size of the allocated object depends on _GLIBCXX_DEBUG. There is a library (e.g. libuser.so) which uses the Boost.Thread library. Since the thread_data_base constructor is defined in a header file libuser.so can contain its definition. Again, the size of thread_data_base object, that the thread_data_base constructor from libuser.so expects, depends on if libuser.so was built with _GLIBCXX_DEBUG defined or not. An application cannot link agains both libboost_thread.so and libuser.so if these libraries were built with different _GLIBCXX_DEBUG definitions (or different alignment, etc). While loading the application the dynamic linker will use the definition of thread_data_base constructor either from libuser.so be or from libboost_thread.so. Whichever it finds first. Can both the thread_data_base constructor and make_external_thread_data() reside either in a .cpp file or in a header? BR, Dmitry

2 3

[Build] Boost 1.41(?) and OpenSuSE 11.2: i386 no more?
by Christoph Duelli 16 Dec '09

16 Dec '09

Building Boost 1.41 against OpenSuSE 11.2 works fine... until you try to link a lib against a program: You get the following linker error: <path to boost_1_41_0>/lib/libboost_program_options-mt-Melos.so: undefined reference to `__sync_fetch_and_add_4' Googling around indicated that libc or something no longer supports i386 which is Boost's default -march setting for gcc. (see tools/build/v2/tools/gcc.jam) When I changed the default to i686 and rebuilt Boost, the program linked ok. [See: http://sourceware.org/ml/libc-alpha/2007-02/msg00009.html] I am not sure if this is not rather a bug in OpenSuSE 11.2, but it is annoying nevertheless. * Is there an easy way (I modified gcc.jam for my test) to configure -march? (Pleae see my post (yesterday) "Build boost for i686 (instead of i386)" in boost.user.) * Or maybe i386 is no longer a safe default to assume? Best regards, and thank you Christoph

1 0

[function] Using boost::function when rtti is not available
by David Genest 15 Dec '09

15 Dec '09

Hi, Reposting this from the user mailing list, as it generated no comments. I am in a gaming build environment that has traditionally turned off rtti because of space and portability issues. But, I would like to use the very useful boost::function. On MSVC boost::function works, but fails on g++ for the ps3. I have read on the lists that it is possible to implement a rtti-less version, and that this is even wanted in the future. See: http://article.gmane.org/gmane.comp.lib.boost.devel/192378 And http://article.gmane.org/gmane.comp.lib.boost.devel/191945 I know of a lot of people that would like this dependency on rtti removed. My question to the list is: did anyone have a try at an implementation and could share it ? I have toyed with boost::function and sp_typeinfo.hpp and tried to replace occurrences of type_info in function_base.hpp, but I don't have enough understanding to finish the work and my early attempts have failed. As my current understanding goes, the function type could be generated with the sp_typeinfo trick. Is the sp_typeinfo.hpp route a viable one ? Thank you, David.

4 13

Re: [boost] [msm] Review
by Christophe Henry 15 Dec '09

15 Dec '09

Hi Darryl, >Anyway, I hope that clarifies my concern is not primarily with the >failure to compile on older gcc versions. Yes it does and it's a good point. >I can accept eUML as an experimental library.... Does that help? Yes, I think it's a good term and I'll put it like this in the doc with a word of explanation about compilers and fsm size. >Oh - I also neglected to suggest that a better name for euml is badly needed I like the name eUML. "Embedded UML" is really what it wants to be, UML syntax in the code. Besides you know by now my taste for names which sound cool ;-) Of course, if you find some really cool name... Christophe

1 0

Re: [boost] [msm] Review
by Christophe Henry 15 Dec '09

15 Dec '09

Hi Michael, >I personally find this library both useful and well >implemented for many of my needs. The documentation is >lacking and must be extended to include a library >reference. Additionally, I would like to see SimpleStates >implemented to support internal transitions as called >out in the standard. Other issues are detailed; however, >do not affect my qualified vote of "acceptance". My >conditional recommendation for acceptance (yes vote) >is based on resolving the documentation issues and lack of >SimpleState internal transitions. Thank you for the detailed review. Your UML experience is very valuable and appreciated. I'd like to discuss a few points. I've been thinking about internal transitions. I see 2 ways to implement them: - an UML-conform way where states have their own stt with reduced rows (no target) - a row in the state machine stt (also without target) which I wanted to implement anyway. The first has the advantage of being UML-conform and thus respecting the UML priority in case of conflicts (internal transitions having the highest). It also makes the state more valuable and maybe reusable. The second is more general than the UML-conform way as it allows you to define yourself your priority according to the position of the transition in the stt. It will also compile faster and be slightly faster. You also see the conflict better in the stt. But you lose a reuse possibility. I understand why internal transitions have a higher priority in submachines (for exit points to work I suppose) but for simple states? That's why I personally tend to prefer solution 2 but I'm interested in your take about it. >I haven't thought too much about this, but it seems that the functor (Row) >mechanism might be extended further to replace the various >"arow" syntax completely. It can do all what the "row" does, all in one. I would still prefer to keep the "row"s because they are so simple that they attract unexperienced users who are sometimes scared of seeing templated functors (I tried ;-) ). They are a good entry point into MSM. >I find myself missing choice points. Using "anonymous >transitions" nearly allows the same semantic... but not quite. For interest, what don't anonymous transitions allow? I scratched my head for a long time and all I found was for the case where you have multiple choice points. In this case, the path goes further only if at least one full path to another state is found (if I got it right). Is there another reason to have choice points? >I also miss not having a "any" or "*" trigger >definition. In essence, if no transition match is found for >the active trigger ... take this transition. This one was left out because I found no easy way to do it. It'd probably involve adding behind the hood a row for every event of a machine. It's harder to know how many rows are needed then. Besides, I never found a use case for this, so if you have one, I'm quite interested. >Additionally, an example of converting a runtime int to >a type is in order. Most people doing statemachine work are >acting on some trigger that now needs to be translated to >a data type. There are many ways to slice this but none are listed. I unfortunately found not many ways and almost all are pretty bad. One would be an ugly switch/case, the other guards (forcing a O(n) dispatch). Probably the best is letting the action generate internally another event. I will look for a way to solve this better. >As an aside, I would be happy to review and offer feedback >with documentation modifications. I may be able to offer some >assistance with modifications also. With pleasure! As you see, I already started ;-) >Inconsistent use of eUML. Sometimes it is EUML (particularly at the >start of a sentence.) I believe it should always be eUML. Being not a native speaker, I followed what Word told me and it was probably a bad idea so I'll trust you on this. >While the implementation of deferred events is correct according >to UML I have found that the ROOM concept is extremely useful >and have implemented it in my own libraries. You may want >want to consider it as a feature to MSM I admit I don't completely get it but it surely sounds interesting. Would you have some written document or spec about it? >Without a deep history concept in MSM I am required >to specify a history policy for each contained sub-state machine >(composite state). I do find this rather annoying though >it is workable. I find rather annoying the UML way. At least there should be a workable solution for orthogonal regions and deep history. Yes, MSM forces a policy but in exchange gives you much more power. >My initial reaction to flags is "composite states already >supply this information". I can see that flags can provide >multiple slices of meta state information and *might* be >useful. I am in general leery of abstractions that obfuscate >additional state information. From a diagram POV, that >state information is missing. In my world this typically >means that the granularity of machines is wrong Flags are a generalization of IS_IN for some UML tools. Consider the following example: State1 fulfills some property (called P1). State3 fulfills a property P2. And State 2 fulfills P1+P2. Now, composite won't help you because there is no way to put State2 in 2 composites. So when checking in a guard for, say P1, you'll be left with if (IS_IN(State1) || IS_IN(State2)). I personally prefer is_flag_active<P1>(). In this case, there is probably nothing wrong with your hierarchy, it's simply the IS_IN concept which is not enough general. >I personally like this format for describing a row. I hate >to suggest yet one more mechanism... but having "row" utilize >a "none" would be nice. Yes, that there is no "none" is a limitation of having function pointers in "row". Even having default value was making compilers unhappy. It was one of the reasons for having the "Row". OTOH function pointers really can be understood by everybody (I work a lot with ex-C developers). >I find my fence riding odd because I have always thought a DSEL >like this would be the cat's meow. I think it might be the >copious use of BOOST_TYPEOF is just hard on my eyes and getting used >to the ordering of build_state. All of those instantiations of objects >with the ().... it just looks messy to me. I'm open to any suggestion. The only other way I see is to create an instance for each type used in the stt, but it's also not great. We could pack it in a macro, but it hardly qualifies as more beautiful. Could you try the new row grammar which I posted in the vault and tell me if it looks slightly better? (note: sorry, I still use == instead of =. This will be changed too). >eUML seems to be a non-starter for me and these platforms. I've been wondering about this too. VC makes a much better job at eUML executable size (no size overhead), so it is possible and I hope g++ will catch back. Thanks for the very useful comments. Christophe

1 0

[function_types][fusion]
by Felipe Magno de Almeida 15 Dec '09

15 Dec '09

Hi, This simple call results in errors. boost::fusion::fused<boost::factory<int*> >() (boost::fusion::vector0 ()); Errors in gcc 4.3.2: /opt/i686-cross-gcc-boost_1_38_0/gcc-4.1.2-glibc-2.3.6/i686-unknown-linux-gnu/i686-unknown-linux-gnu/usr/include/boost/fusion/functional/invocation/invoke.hpp: In instantiation of 'boost::fusion::detail::invoke_impl<boost::factory<int*, int boost::detail::none_helper::*, factory_alloc_for_pointee_and_deleter>, boost::fusion::vector0, 0, true, true>': /opt/i686-cross-gcc-boost_1_38_0/gcc-4.1.2-glibc-2.3.6/i686-unknown-linux-gnu/i686-unknown-linux-gnu/usr/include/boost/fusion/functional/invocation/invoke.hpp:80: error: invalid use of undefined type 'struct boost::fusion::detail::invoke_mem_fn<boost::factory<int*, int boost::detail::none_helper::*, factory_alloc_for_pointee_and_deleter>, boost::fusion::vector0, 0, true>' /opt/i686-cross-gcc-boost_1_38_0/gcc-4.1.2-glibc-2.3.6/i686-unknown-linux-gnu/i686-unknown-linux-gnu/usr/include/boost/fusion/functional/invocation/invoke.hpp:89: error: declaration of 'struct boost::fusion::detail::invoke_mem_fn<boost::factory<int*, int boost::detail::none_helper::*, factory_alloc_for_pointee_and_deleter>, boost::fusion::vector0, 0, true>' This seems because CBI in invoke_impl is being defined as true. And ft::is_callable_builtin<Function>::value is being true. But Function is boost::factory<int*> and doesn't look like a callable-builtin. If I force CBI to false, then it works. Any help would be appreciated, -- Felipe Magno de Almeida

1 0

Re: [boost] [msm] Review
by Christophe Henry 15 Dec '09

15 Dec '09

>I'm out of time (not just the review period but other time constraints) >for doing a proper review, something I regret. However I would like to >vote for the acceptance of the msm backend conditional on: > >Improvements to documentation to formally and fully describe the msm >interface. As already said, I agree to add a reference. >Inclusion of straight-forward out of the box configurability to support >large FSMs. Unfortunately, there is nothing I can do to improve the compilers :( >Yes, with gcc 4.2.4 > > - Did you have any problems? > >I couldn't get the euml examples to compile. I'm not sure whether this >is an environment problem (I was using boost 1.40 on Debian testing) or >something else. I didn't spend much time investigating. As stated in the documentation, g++ supports eUML only from 4.3. It is therefore normal that you didn't manage it. eUML support is repeated several times in the documentation. >My comments have been almost entirely around the back end and the more >direct front-ends to it. I personally think euml should be a separate >submission/review, once it is more "review ready". There seem to be >boost version and compiler version issues in getting even the examples >to compile. These are quite possibly outside of msm/euml itselfs >control, but if nothing else, they prevent easy review of euml. > >I'm actually struggling with the above, because I think having euml in >trunk, with tests being run, could facilitate resolving some of these >issues. Maybe euml could be included as some experimental/example part >of msm initially? I'm afraid you're extrapolating a little from your own experience using the wrong compiler. There were just 2 issues so far. One with VC8, which has a (documented) weak support for eUML. This issue has been fixed immediately. The second is a reported warning on g++, which I was not able to reproduce and needs more concrete input from Michael. It doesn't seem sufficient for calling eUML not "review ready". True, eUML has more limited compiler support and this is documented too. It doesn't make it less ready. >I don't generally bombard innocent bystanders with my vague ideas. I >took asking for a review to be asking for it :-) The review involves many questions from different people and vague ideas are hard to address. Fortunately, you clarified afterwards, so that I can take valuable data from it. Sorry about the wrong start. It's quite sad because I find a few points quite interesting and they will flow in the design of the future back-ends or improvements in the current one. >In putting together the LAPD implementation I'm using the functor front >end, but end up creating functors via a few macros that dispatch to the >objects that do the work. I find they don't need access to anything >other than the fsm (to post events back to) and the event (to >access/process anything it contains). I'm fairly happy with that aspect >of the interface. If it's bothering you to have the source/target states as argument, it's trivial for me to add a new row type. I wouldn't want to force macros on you. >I haven't tried to do it yet, but it struck me that I could potentially >use the state types alone (not the object ref parameters) as tags to >determine which object to dispatch to. If I chose to have objects that >were 1:1 with states I could - but it wouldn't be part of the fsm >kernel. Is that concrete enough to make sense? It is ;-) I'm just unsure if I follow you. With "object to dispatch to", do you mean objects in your application? Why not use the state for this? I'm interested in your use case for future developments. >No, I don't agree at all. I can't see how you can argue that having >transitions specified in states as statechart does is less clear than a >separate transition table, then claim that having enty/exit actions >specified in states is more clear than having them similarly separated. Good point, which I need to explain. The problem with Statechart's approach is that states do the job which should be the state machine's. This increases the importance of states in Statechart, at the cost of the state machine, which becomes little more than a wrapper. It also mixes entry/exit with the rest of the transition. It's not my reading of the philosophy behind the UML specification. I think the states have a role, state machines another. State machines implement the structure of the diagram. States implement state-specific job, which is much less than the state machines'. Their jobs are: - entry/exit - holding state-specific data (not in the UML standard but still sounds logical to me) - (possibly) internal transitions When you look at a transition table, you see the structure of the machine and only the structure. (EUML shows you more, but this is not a classical state machine front-end :) ) AFAIK you didn't complain about not seeing the actions/guards code in the transition table. To illustrate the difference of roles, could you please have a look at the examples iPodSearch or iPodSearchEuml? This is a good example. Take the state StringFind. Its description would be: - looks if the string contained in an event is found in the string contained in the state. - if found, the state sends the event Found on the current state machine. - else it sends NotFound. Note that StringFind has no idea of which fsm it is used in. It only gets a generic fsm as argument of on_entry. The same documentation is possible for the other states (Foreach and Insert). So what do we have? 3 states, perfectly reusable and implementing some valuable job. And they have no idea of the transition table. Now imagine that MSM comes in with more states, transform, remove, push_back, etc. Using a supporting CASE tool, one could easily build complex algorithms. >I personally find this response vague Is this already less vague? About the CASE tool, I showed an early prototype in the last BoostCon and plan to start working on it again after the review. I only ask for some patience (for the tool, the state library concept and the back-ends) because I'm doing all this at night, so I'm not so fast ;-) For the moment, the tool only allows defining a complete state machine and generates MSM1 code from it. >But why do they need to be part of the transition table based "kernel"? >Don't pay for what you don't need/use? True, it is an extra cost. Not a big one though, and with little influence on the performance. >Yes. Rather. Sorry for the combination of complex grammar and outright >incorrect grammar that would seem to have lead to this. Sorry for my lack of patience due to my several parallel discussions. >I'm not outright against state instantiation. I can't be. I do really >like statechart's state instantiation model. However, in the review of >that library I did ask if there was any way that the costs associated >with it could be avoided when not strictly needed (when the state >contains no state-local storage). I'm asking a very similar question >here, but somewhat more emphatically because this is the Msm (first M is >important!) and it should surely be able to do this There are limits to what the first M can do though (besides, you know what that means to your compiler). But I now understand the point and find the idea interesting. It'd probably be possible to instantiate only states with local-storage. It would require a tag (as I won't be able to rely on sizeof) but it could be possible. Thanks for the good point! >> - make a 3rd one, more dynamic, which I want to do since a while. >> - make no review until all possible back-ends are done and make >> everybody wait at least one more year. >> >> Do we agree that solution 1 seems the more logical? > >Logical from what perspective? Buying votes or producing a good library? >Politics... ;-) It's not politics and even less buying votes, but a simple recognition that each developer will use different features and if he doesn't find his, he'll simply not use the library. I'm pretty sure, if I had only proposed a mini-backend, many would have complained about the lack of features, and they'd be right. The say 20-40% of UML features which you use won't be the same as what another developer will use. So, a library needs to support as much as possible. I think MSM is a good library as it offers almost all of UML features at very low runtime cost. The only high cost is the compile-time. Now it's proven that the concepts of the MPL book were right, that it was indeed possible to implement at least as much as statechart with metaprogramming techniques. That this wasn't evident, as shown here (http://lists.boost.org/Archives/boost/2005/03/81853.php) I hope you'll trust me that if I can also implement less ;-) If I get you right, the only major problem you have with the back-end is the automatic, unavoidable instantiation of states? Doesn't sound like an impossible problem to me :) Christophe

5 4

boost libraries and libCstd
by Sascha Ochsenknecht 15 Dec '09

15 Dec '09

Hi, the SUN compiler comes with two C++ standard libraries: libCstd and libstlport. libCstd is the 'old' version of the C++ libraries which has not all features of the standard implemented. The differences are described here: http://developers.sun.com/solaris/articles/cmp_stlport_libCstd.html The linked page also describes workarounds. My question now is, does BOOST officially support libCstd? And if yes, are there macros (#define's) defined to choose the appropriate code (standard or workaround) within the boost library code? The backround: the program_options library and probably some others do not compile/link with libCstd. This is described e.g. in Ticket #3190). Thanks in advance, Sascha

3 2

Re: [boost] library proposal: odeint
by Karsten Ahnert 15 Dec '09

15 Dec '09

Hi, solving ODEs is pretty standard, but it is also a starting point for elaborate numerical analysis and tools, especially if you solve large systems with conserved quantities. Nevertheless, I think some simple ODE solvers would fit into Boost, libs for numerical root finding and optimization are also part of it, at least experimentally. Many libraries for solving ODEs exist in the C/C++ world, but many of them lack the use of the standard interfaces and containers. This is really a drawback to languages like Fortran or Python and odeint is one attempt for easy to use and container-independent ode solver. Best regards, Karsten

3 3

Re: [boost] [Regex] Why doesn't this pattern match?
by Vitalij Gotovskij 15 Dec '09

15 Dec '09

Yes, Robert, You are right. I am trying to change \\n (wchar_t '\' and wchar_t 'n') with a real new line symbols and it doesn't work. Allthought, then I am trying to find only wchar_t 'n' (or any other letter) everything is working good. The problem is that I have XML configuration file (Unicode), where all new lines are L"\\n" (!!! not '\n' !!!). I can't change that file format. Of course I can program that replace without boost::regex, but I am afraid that I'll loose my sleep afterwards... >> You're replacing each occurrence of \\n with \\n, so the >> string at the end should be exactly the same! :-) > The replacement is "\n" not "\\n" so the '\' followed by 'n' in str should be replaced with a newline, right?

4 3

Re: [boost] [msm] Review
by Christophe Henry 15 Dec '09

15 Dec '09

>It seems to me that waiting to add a great library until some particular >compiler supports it isn't a great strategy. Msm works on our >production compiler, and it seems to me that the compiler support is >documented. I agree. Besides, if not used, eUML will wait long for compiler support. Compiler writers do need some users complaints as I just saw a few weeks ago. >If we fear rejection due to incorrect usage by potential >users who haven't read the documentation, perhaps the library could have >some built-in support for detecting compilers that are known not to work >and issue a coherent compiler-time error message. I think it's a good idea! EUML could simply refuse to compile if provided the wrong compiler. >So long as MSM works on multiple, highly-regarded compilers, and its failure on others >can be demonstrated reasonably to be due to failure to comply with the standard, then its portability >will have been demonstrated. If it only works on one compiler, then its portability case is diminished. EUML compiles well on g++4.3, and reasonably well on VC9/10 and g++4.4. Darryl, I understand your point and appreciate that you want to protect eUML but I think that propagating it is the best solution to make compilers improve. More warnings in the doc would also help.

2 1

library proposal: odeint
by Karsten Ahnert 14 Dec '09

14 Dec '09

Hi, I am new on this list and want to start a discussion if a library for solving ordinary differential equations (ODEs) would fit into boost. We are developing a lib - odeint - for such problems. odeint can be found in the sandbox: https://boost.org/svn/boost/sandbox/odeint, but the current stage is far away from being ready for release or submission. ODEs are usually solved iteratively. Therefore, we have introduced two stepper concepts, one for steppers with- and one for steppers without error estimation. At the moment some explicit solvers are implemented: Euler, RK4, Cash Karp, RK78,midpoint and Burlisch-Stoer. Here are some examples: typedef std::tr1::array< double , 3 > state_type; // define the ODE void lorenz( state_type &x , state_type &dxdt , double t ) { const double sigma = 10.0 , R = 28.0 , b = 8.0 / 3.0 dxdt[0] = sigma * ( x[1] - x[0] ); dxdt[1] = R * x[0] - x[1] - x[0] * x[2]; dxdt[2] = x[0]*x[1] - b * x[2]; } state_type x = {{ 1.0 , 0.0 , 0.0 }}; ode_step_euler< state_type > stepper; double t = 0.0; // iterate the ODE by hand with constant stepsize for( size_t oi=0 ; oi<10000 ; ++oi,t+=dt ) stepper.next_step( lorenz , x , t , 0.01 ); // integrate the ODE with constant stepsize // from t = 0.0 to t = 100.0 with dt = 0.01 // and write t and x[0] to cout integrate_const( rk4 , lorenz , 0.0 , 0.01 , x , 100.0 , cout << _1 << tab << _2[0] << "\n" ); // stepsize controller for rk5 cash-karp controlled_stepper_standard< stepper_rk5_ck< state_type > > rk5_controlled( rk5 , eps_abs, eps_rel, 1.0, 1.0); // solve the ODE with an adaptive stepsize controller size_t steps = integrate_adaptive( controlled_rk5, lorenz, x, 0.0, 10.0 , 0.01, cout << _1 << tab << _2[0] << "\n" ); Best regards, Karsten

7 6

Re: [boost] [msm] Review
by Christophe Henry 14 Dec '09

14 Dec '09

Hi Darryl, >Your responses come across as though you feel you are under attack. >Please accept that is not my intent I'm sorry if I gave this impression. While I was unsure what were your concerns at the beginning, I now appreciate a lot your contribution! You'll probably recognize your suggestions in the next versions :) >I see these as incredibly closely related in a C++ FSM model. This is >because, in my experience, the actions done in entry and exit actions >are resource management-like, very similar to the role of constructors >and destructors (or more generally scope entry/exit). I had intuited >that the rational for including entry/exit actions in fsm notations was >to model that scope concept. Actually, my take on the use of entry and exit was not scope entry/exit but rather a way to factorize behaviour out of the transition. So, to sum up our discussion: - I agree that using entry/exit for RAII sounds interesting. - paying 1 byte/state even if you don't need them is almost not visible on the performance level but I agree that it's still feeling not right. - on_entry and on_exit have in my opinion, compared to constructor and destructor, the advantage of flexibility (such as getting the event or fsm or the ability to throw). - while you would prefer to have no states, using them for tag dispatching still looks interesting to you. - I'm positive persisting data in states favors reuse in another fsm context. I hope to bring later some reusable state concept to prove this point. This pretty much sums up our discussion, right? We had a rocky start (due to my misunderstanding) but I understand this is the where we now are. I think that it's possible to have all this at the same time, constructor/destructor and entry/exit, persistent states and non-persistent, maybe in the same state machine. I can imagine a few possible solutions but need to think more about them. I'm pretty sure that it's possible to have at least non-persistent states (using no memory) while being still compatible with the front-ends (who require a source/target state). So, I thank you for the interesting discussion which delivered valuable points. I'll be happy to continue the discussion as soon as I can offer a solution. Christophe

1 0

[msm] Review
by Michael Caisse 14 Dec '09

14 Dec '09

Let me start with a thank you. Thank you Christophe for taking the time to "boostify" and submit this library. Thank you also for your quick responses to questions and discussions through out the review. I apologize that this is "late". I was unable to complete the review over the weekend. I am afraid that this review is somewhat disjointed. There are two parts. The top section answers the standard questions and provides some overview. The bottom section provides some specific details about the documentation and also discussions about specific features covered in each document section. I found that reviewing in order of the tutorial provided some structure to the review. Some of the points I make have been brought out in other emails/reviews ... but this is my review so I felt compelled to write down what I found important. Best regards - Michael Caisse ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Executive Summary: I personally find this library both useful and well implemented for many of my needs. The documentation is lacking and must be extended to include a library reference. Additionally, I would like to see SimpleStates implemented to support internal transitions as called out in the standard. Other issues are detailed; however, do not affect my qualified vote of "acceptance". My conditional recommendation for acceptance (yes vote) is based on resolving the documentation issues and lack of SimpleState internal transitions. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------------------------------------------------------ What is your evaluation of the design? ------------------------------------------------------ The design seems sound; however, it has a feel of being in flux when reading the documentation. There are perhaps too many methods to create row entries. I haven't thought too much about this, but it seems that the functor (Row) mechanism might be extended further to replace the various "arow" syntax completely. ------------------------------------------------------ What is your evaluation of the implementation? ------------------------------------------------------ From the point-of-view of a UML implementation, I think this library does a good job of implementing the most used features of the language. I would like to see the addition of internal transitions for SimpleStates before the acceptance of the library. Lack of this feature makes it awkward at best to implement constructs that are the UML state machine equivalent of RAII. Entry and exit code for a state are often used to do things like start/stop timers and other such resource management. Not being able to handle internal transitions (transitions that don't leave the state and therefore do not cause an exit/entry cycle) make modeling this concept impossible. Hacks can be applied to work around the shortcoming ... but implementing the feature is the right solution. I find myself missing choice points. Using "anonymous transitions" nearly allows the same semantic... but not quite. I am used to being able to define multiple triggers for a transition. This is not a deal-killer but it would be nice to be able to somehow do this. Perhaps I could by having event 'a' and event 'b' derive from a common base and then using the 'base' as the event. I'm not sure. I also miss not having a "any" or "*" trigger definition. In essence, if no transition match is found for the active trigger ... take this transition. I have not spent enough time with the source code to provide an evaluation of the source. ------------------------------------------------------ What is your evaluation of the documentation? ------------------------------------------------------ The provided documentation is basically a tutorial. I found that a library reference guide was lacking. Though the tutorial was excellent, not having a library reference made using/reviewing the library difficult. I'm sure that there are many features and exploits that I didn't discover because the only route left to the reviewer was hope an example was in the tutorial, used in the example source code or by rummaging through the library source. Please make sure to add a section describing the run-to-completion semantics as well as the ordering of evaluation/execution when a trigger if fired. Additionally, an example of converting a runtime int to a type is in order. Most people doing statemachine work are acting on some trigger that now needs to be translated to a data type. There are many ways to slice this but none are listed. When showing this to another programmer the response I got was, "but I have ints or chars that I'm acting on. How do I make that into a type?" External stimulus is not a type so some hint on ways to do this will be nice for those getting introduced the concept for the first time. As an aside, I would be happy to review and offer feedback with documentation modifications. I may be able to offer some assistance with modifications also. Additional documentation edits can be found at the end of this review. ------------------------------------------------------ What is your evaluation of the potential usefulness of the library? ------------------------------------------------------ I find this library very useful. I have already begun modifying my code generators that take ArgoUML and Poseidon diagrams and generate code based on distributed machines to use MSM as a backend. This will allow me to fully understand the usefulness of the library to medium/large projects. At this time I have started using MSM for a smaller state machine project. I am finding the library useful. ------------------------------------------------------ Did you try to use the library? ------------------------------------------------------ - With what compiler? gcc-4.3.3 and VC 8 My experience with gcc has been fine. My experience with VC8 ran into problems with the eUML. I just switched to linux/gcc since my target almost always involves a gcc compiler. I don't have enough concrete experience with VC8 and MSM to provide a solid viewpoint ... but my soft view is that it might need some more help. - Did you have any problems? eUML (as expected) didn't work with VC 8 ------------------------------------------------------ How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? ------------------------------------------------------ I spent about 25 hours reviewing this library. I did not spend very much time with the source code but instead reviewing the documentation and testing the concepts/implementation as they stack up to the UML 2.0 standard. I also spent time implementing several of my own machines with the MSM library to determine how applicable and conforming the library might be. ------------------------------------------------------ Are you knowledgeable about the problem domain? ------------------------------------------------------ Yes. I have been dealing with UML based statemachine notation before it was part of UML. I have my own product that implements ROOM/UML distributed hierarchical FSMs that are generated from diagrams. I have implemented several UML compliant state machine libraries in a variety of languages. ------------------------------------------------------ Additional Documentation Comments Other MSM comments in order of the docs... ------------------------------------------------------ General: Inconsistent use of eUML. Sometimes it is EUML (particularly at the start of a sentence.) I believe it should always be eUML. Sub-state machines and composite states are not *exactly* the same in UML. It seems that it is implied or stated in a few places that it is. I would just state up front that Msm does not support composite states; however, it does support the more general solution of sub-state machines. ---------------------------- Section "Why Msm v2?" "UML designers are also used to write..." should be "UML designers are also used to writing..." ---------------------------- "Msm v1.x Features / Design Goals" If you are taking votes about multithreading ... please make it some non-required layer or policy or let the user's discretion play out. I will be using Msm on targets without an OS. "Msm v1.x Features / Founding Example" It might make sense to utilize UML terminology when discussing the parts of a transition: current state -> source state next state -> target state action method -> effect or behavior event -> trigger So... maybe not the event to trigger change. This is an interesting concept in Msm. Often an event is considered as having a trigger and optional data payload. The Msm event is a struct with possible data members. Event is fine I guess. "The event being passed the" -> "The event being passed to the" --------------------------- "A more advanced example" "The UML specification isn't too clear about the difference between composite states and sub-state machines..." That statement isn't exactly true. The specification is clear; however, Msm has implemented the more feature rich concept which is a superset of composite state. If there isn't a runtime (resource) penalty for this, then I don't see a problem. -------------------------- "Orthogonal States..." While the implementation of deferred events is correct according to UML I have found that the ROOM concept is extremely useful and have implemented it in my own libraries. You may want want to consider it as a feature to MSM. The defer mechanism is the same (you can defer any event in any state); however, you can later "recall" from the defer queue. This has the benefit of allowing a "simple" construct for handling deferred events. You can defer the events at a parent composite state. Once you enter the sub state handling certain (potentially deferred) events you can then do a recall from the queue. This is often done in the state's entry code. This pattern reduces the work involved by taking advantage of the hierarchical aspect of UML states. -------------------------- "Adding an history" should be "Adding a history" I personally am happy with the UML definition of histories and use them often in error handling patterns for example. Part of the power of UML states is the fact that they are hierarchical. Without a deep history concept in MSM I am required to specify a history policy for each contained sub-state machine (composite state). I do find this rather annoying though it is workable. I do like the AlwaysHistory policy since that is my normal use case when using histories. -------------------------- "Using 'flags'" My initial reaction to flags is "composite states already supply this information". I can see that flags can provide multiple slices of meta state information and *might* be useful. I am in general leery of abstractions that obfuscate additional state information. From a diagram POV, that state information is missing. In my world this typically means that the granularity of machines is wrong (I use distributed state machines) or the state hierarchy is not quite right. I have the same negative feeling about storing a lot of *state* information in variables that are acted upon in guards and such. It hides important information from the diagram and makes the machine harder to review and understand. This is not an argument to remove flags. It is just my first impression of the feature. I will need to play some more with it. I can see potential uses. -------------------------- "Anonymous transitions" In the UML standard the term "Completion Transition" is used for this concept. I like this term because it is descriptive of what is happening. I also like it it because this is a UML compliant library and using the UML terminology helps understanding the concepts more quickly. -------------------------- "The many ways to enter a composite state" Explicit exit is often a problem. I found that in two of my machines I tried converting that I use this mechanism. I used an exit point to work around the missing feature. This works ... but wasn't my intent. That said... I think what you have is proper for a submachine state. If MSM actually implemented composite states, then the lack of this notation would concern me. This might just be me, but the purpose of a submachine is to wrap a composite state into a reusable object. Entry and exit points therefore represent the public interface. Explicit entry and exit would be like accessing private data. "Important note 3" - I think this is important behavior for the proper use of submachine states. -------------------------- "Advanced" -------------------------- "Conflicting Transitions" This information is important. I think expanding the section to discuss the run-to-completion semantics and the order/execution rules followed when a trigger is received is vitally important. Example, trigger A is received. The following steps are performed in this order: .... -------------------------- "Contaning state machine (deprecated)" This type of thing just confuses the situation. You have a recommended practice and the library is just now in review. I would leave this out or if you feel it is important... add an appendix for those using pre-boost versions of the library. -------------------------- "New Msm V2.0 Features" -------------------------- "Functor rows" I personally like this format for describing a row. I hate to suggest yet one more mechanism... but having "row" utilize a "none" would be nice. Then there would be two mechanisms in the table -- 'Row' for functors and 'row' for other types. Better yet would be figuring out how to combine those into one. -------------------------- "eUML" I played with eUML some and I find myself on the fence. First off as I had related earlier, I think the ordering is not natural. I do like Rob Stewart's suggestion of: DestState() = CurrentState() + cool_event()[guard()]/(action()) I find my fence riding odd because I have always thought a DSEL like this would be the cat's meow. I think it might be the copious use of BOOST_TYPEOF is just hard on my eyes and getting used to the ordering of build_state. All of those instantiations of objects with the ().... it just looks messy to me. I love the idea and I think it is nearly there. It just 'looks' complicated when I quickly view the source. In the end I didn't have enough time to finish reviewing this portion of the library. My gut says that it might be almost ready for prime time. It might just need some more help with the sugar coating. -------------------------- "Executable size" A lot of my state machine targets have 256k flash (or less) and minimal RAM. Size is a big concern to me. I'm also unsure about these claims. Not that the claims are wrong ... but my own testing has yet to convince me that I will be able to use MSM for those targets yet. I always use -Os but I am still experimenting with the impact of size with the various front-ends and row options. eUML seems to be a non-starter for me and these platforms. -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

1 0

Review Request: boost.lockfree
by Tim Blechmann 14 Dec '09

14 Dec '09

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 hi all, since my first review request for boost.lockfree [1] was completely ignored, here a second version for review. the main differences are bug fixes provided by various people, trying to run boost.lockfree on different compilers/platforms. the original review request was: i would like to submit a small library of lock-free data structures for review. 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 updated links: 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/ would be nice if someone could add this library to the review schedule or even would be willing to manage a review ... best, tim [1] http://article.gmane.org/gmane.comp.lib.boost.devel/192779 - -- tim(a)klingt.org http://tim.klingt.org Avoid the world, it's just a lot of dust and drag and means nothing in the end. Jack Kerouac -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAksLtukACgkQdL+4qsZfVssO7wCfel+ro8wr9TXA5fCHdq3+Dv0z 47sAniqHVyaQ4m4vOwr1SyRp9liUr9Dh =FZao -----END PGP SIGNATURE-----

12 18

Performance problem with boost thread
by ellan 14 Dec '09

14 Dec '09

My code is in C++; I am using thread_group directly. The thread group call a function member of the same class. In side this function member I called another class's function member to finish the task. The task is completely "embarrassingly parallel", thus I expect it scale very well. But it didn't, the performance of my code I describe above is even worse than when I use boost thread to call a executable instead of the function member of the same class. I don't understand what's going on. Any suggestions are really appreciated!!! -- View this message in context: http://old.nabble.com/Performance-problem-with-boost-thread-tp26779904p2677… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] [MSM] Comparison with ad-hoc FSM implementation
by Christophe Henry 14 Dec '09

14 Dec '09

>One interesting feature is that there are several buttons that have >different actions associated with short and long presses. So I can >imagine per-button state machines that do something like: > > UP --pressed--> DOWN --timeout--> LONG_DOWN > <--released---- | > <---------------------released--------+ > >These could feed events like left_button_short_press, >right_button_long_release etc into a main state machine. > >Can you outline how you would implement this in MSM? I implemented it exactly as you described. >I can see how you >could store the button identifier as event state and send e.g. >short_press(left_button) to the main state machine, but this would then >need transition rules using guards to test the button id. (I don't >think this is an application for a sub state machine because each >button's machine runs concurrently, right?) To make the follwowing answer clear, I just added in the sandbox (msm/libs/msm/doc) a BoostCon09 subdirectory. You will find the diagrams (top fsm, menu and playing submachines) and an implementation using a standard front-end and for the fun, another one using eUML (tested with VC9 and g++-4.3). I didn't generalize like you suggested. Though I like your solution and it is probably going to work, I didn't want to make the example more complicated (it is already complicated enough). To solve the concurrency problems, I simply added more regions and each button is handled in one of them. It is not such a big repetition because the south button has its own handling anyway. The interesting and complex part is not so much the button handling, which could be done with an ad-hoc solution too, but the separation of tasks between the regions. One handles the hold button and stops all processing using an interrupt state, some handle the buttons, and others are simply here to give to an hardware event (like using the middle button) a different meaning according to the state where the state machine is. For example, CheckMiddleButton is doing just this. Only one state. All regions are small, and each handles a very specific part of the problem. See it as a sort of "divide and conquer" ;-) The whole point of the example was to show how, using UML techniques supported by MSM, writing a mock-up for an iPod was easier than using an ad-hoc solution. We spent 90mn purely on diagram and used a tool to generate the code instantly. And this was the second point, to show how MSM was supporting a model-based approach and that such a tool was feasible. Christophe

2 1

[svn] merge to release HOWTO?
by Eric Niebler 14 Dec '09

14 Dec '09

I clearly am doing something wrong when it comes to merging changes from trunk to release. I feel that as one of the release managers, this is something I should know. :-P Long ago, the agreed procedure was to use svnmerge.py to merge individual revisions (or revision ranges) from trunk to release, running it from the root of the release branch. I have been faithfully doing it this way. But look at the result of my most recent merge: https://svn.boost.org/trac/boost/changeset/58336 The revisions I merged had only changes to proto and xpressive, but what actually got merged includes property changes to files and directories all over the map. What's going on? Am I not doing it the right way? -- Eric Niebler BoostPro Computing http://www.boostpro.com

6 7

Re: [boost] [msm] Review
by Christophe Henry 14 Dec '09

14 Dec '09

Hi David, Hi Darryl, >It is simply great EXCEPT for lack of instructions on how to actually leverage the design decision >to separate front and back end fully, i.e., helping me to define my OWN front end or back end for MSM. >So, I must take the design claim of separability with a tiny grain of salt. I didn't dream that someone would really ask me this :) Ok then I'll document this part. The interface between front- and back-end is pretty simple. Should you need any extension of it, please let me know, I'm very interested in your idea. > Yes, yes, yes! thanks :) >The name Meta State Machine is misleading. An FSM acting on other FSMs? >Or, to add the C++ modern (and in my view quite improper...) semantics of 'meta': an FSM being executed in compile-time? Nah. Short before the 1.0, there was only one class, state_machine (now the backend). So, like a metalanguage, which is a language used to build other languages, MSM was a state_machine to build state machines. Granted, afterwards, the pun looks less funny ;-) >I agree - how about ffsm - fast finite state machine - or should that be >frightfully fast state machine :-) Sounds cool :)

1 0

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 14 Dec '09

14 Dec '09

>Yes it is an interesting "hack".How "pretend" have you been able to make >this? > >I was actually thinking about exactly this today (long drive - actually >- correction - I was thinking about it yesterday - it's now early >morning here) and wondering what the consequences were. Does it result >in actually default constructing all these (temporary) objects? Won't >that be expensive and/or have undesirable side effects? This is actually what I find so cool with the typeof feature (is it too late to donate a kidney for it? ;-) ). We are calling constructors and lots of operators and it costs nothing run-time because typeof only evaluate the return value of build_stt(...). So no call actually happens. All what you have really is a typedef. The only side effect (besides compiler support) is that you need an empty constructor or would be forced to pass some dummy value.

1 0

[rdb] 0.2.02
by Jean-Louis Leroy 14 Dec '09

14 Dec '09

I have uploaded a new release to the vault. It contains : * support for the float type. Internals have been cleaned up to make it easier to add new types * SQLGetData is not used anymore, result_set uses bound variables to read results I am a bit concerned about compilation time. Guess I'll have to take a look at the template profiler as well. I use float_ (note: underscore) for the variable type for receiving float values (and the length/null indicator). I am a bit tempted to switch to a convention that would prevent clashes with C++ names, e.g. Float or FLOAT. This would solve the problem of `select` clashing with the socket function from the C lib, e.g. : SELECT(p.id, p.name).FROM(p) ... Opinions on this ? Jean-Louis

6 9

[msm] Review
by David Bergman 14 Dec '09

14 Dec '09

Ugh, I have not had time to deal with MSM the last week, which is why I now have to quite hastily report my take on this library. An upside of this haste is that it will reduce my blabbering, which has already irritated a few people in this thread :-) First of all, and probably not a big surprise to anyone having followed this thread: there is already an FSM library in Boost, which has covered my needs in two projects, and quite possibly my needs in most applications. And, in order for me to want to include MSM, it needs to be significantly better, in terms of use (interface) or performance. Alright, let me get straight to the recommended bullet points for a review: - What is your evaluation of the design? It is very good. It actually gives me the same vibes that Boost.Graph does. And those are great vibes. They share part of the meta-programming style (using Boost.MPL) of Statechart, but does so in a better way. There are two important great design decisions: 1. Not coupling FSM logic to the individual states but to the machine itself. This is manifested by the separated transition table or eUML equations. This is conceptually aligned with the mathematical notions of FSM's. 2. The separation between front and back end, enabling multiple API's (of how to define the transitions); this latter point is also used by the eUML interface, which differs widely from the old one (in previous versions of FSM) and that of Statechart. In fact, eUML definitely warrants MSM the label "Xpressive for FSMs" - What is your evaluation of the implementation? Well, two things: 1. It has not crashed ;-) 2. It is very fast. In fact, with most of my examples, using non-nested but guarded machines, with less than 80 transitions, it is around six times faster than Statechart. - What is your evaluation of the documentation? It is simply great EXCEPT for lack of instructions on how to actually leverage the design decision to separate front and back end fully, i.e., helping me to define my OWN front end or back end for MSM. So, I must take the design claim of separability with a tiny grain of salt. - What is your evaluation of the potential usefulness of the library? Great - Did you try to use the library? Yes - With what compiler? Unfortunately only with (Apple's) GCC 4.2.3 on OS X Snow Leopard. - Did you have any problems? None, well, except for my divergence in creating my own meta interface for MSM (and Statechart) and the quirks of Boost.PP :-) - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? An in-depth study. - Are you knowledgeable about the problem domain? I have studied all kinds of graphs theoretically, at a deep level, including DFA's, regular graph theory (and category theory), as well as various computational theories. I have used DFA's in most non-trivial projects knowingly for 23 years but a bit longer unknowingly. This latter point is important: I am quite aware and knowledgeable about the necessity (or benefit) of actually making the state machine of a solution explicit. I am not a big fan of extensions of DFA's, though, such as the state charts found in UML specifications. I.e., I think those just diffuse the beauty (if life is not that clean cut, make it so ;-)) SUM: I demanded much better usability or performance out of the second girl to the party, and MSM covers both those aspects, especially with their eUML interface, so I must vote YES to the acceptance of MSM into Boost. Yes, yes, yes! /David

2 2

Re: [boost] [msm] scalability
by Christophe Henry 14 Dec '09

14 Dec '09

Hi Andy, >Christophe, I'm sorry if my 2 cents won't be relevant since I'm not very >familiar with neither MSM I'm thankful for any help. >The most common reason for compiler slowliness/crashiness that I've seen >came from too deep of a template recursion. Agreed ;-) >I'm not totally sure, but I >think that you're using mpl::vector, which, I think, is a form of a type list. AFAIK, this would be mpl::list. mpl::vector is defined as (for example for vector4): template< typename T0, typename T1, typename T2, typename T3 > struct vector4 { typedef aux::vector_tag<4> tag; typedef vector4 type; typedef T0 item0; typedef T1 item1; typedef T2 item2; typedef T3 item3; ... }; So there is no recursion depth, at least not here. I think the culprit would more likely be the many mpl::fold. Thanks, Christophe

2 1

[msm] eUML guard/action location
by Christophe Henry 14 Dec '09

14 Dec '09

Hi Michael, I just remembered the last reason for the current eUML syntax: CurrentState() + cool_event() = DestState() [Guard()]/(action()) It is that eUML row actions/guards can become quite long (something like adjacent_find_(...) ) and I was having difficulties keeping the rows readable. Concretely, I often had to keep the target state on a line by itself, which was costing a line of my screen. With the current syntax, you can get it easier: CurrentState() + cool_event() = DestState() [VeeeeeryLoooooooooongGuard()] /(LooooooooooooooooongAction()) instead of: CurrentState() + cool_event() [VeeeeeryLoooooooooongGuard()] /(LooooooooooooooooongAction()) = DestState() For the tranquility of my conscience, are you still sure you prefer the more logical syntax? Christophe

7 7

[chrono] Boost.Chrono version 0.2.1 Bug fixes + updated documentation
by vicente.botet 13 Dec '09

13 Dec '09

Hi, I have updated Boost.Chrono version 0.2.1 with a lot of fixes. Bug Fixes * Replace INTMAX_C by BOOST_INTMAX_C until boost/cstdint;hpp ensures INTMAX_C is always defined. * Define BOOST_CHRONO_HAS_CLOCK_MONOTONIC when BOOST_CHRONO_WINDOWS_API * Commenting invalid operator declarations * Take care of Boost min/max recommendations * complete qualification when defining nested typedef duration on clocks to avoid the following compile error: ./boost/chrono/chrono.hpp:945: error: declaration of 'typedef class boost::chrono::duration<long long int, boost::ratio<1ll, 10000000ll> > boost::chrono::system_clock::duration' ./boost/chrono/chrono.hpp:458: error: changes meaning of 'duration' from 'class boost::chrono::duration<long long int, boost::ratio<1ll, 10000000ll> >' * cleanup of simulated... * warning removal on posix/process_clock.cpp * disable VC++ foolishness * Update Jamfiles to manage with dll * removal of conversion warning in test_duration * manage with MSVC reporting a warning instead of an error when there is an integral constant overflow * Use STATIC_ASSERT specific macro to solve the compile failing issue * Qualify with boost::detail boost::chrono::detail to avoid ambiguities with MSVC Documentation: * Updated documentation. The implementation will eventually work with most C++03 conforming compilers. Tests have been run on Windows with * VC++ 9.0 SP1 Cygwin with * GCC 3.4.4 * GCC 4.3.2 MinGW with * GCC 4.4.0 Getting Boost.Chrono You can get the last stable release of Boost.Chrono by downloading chrono.zip from the Boost Vault You can also access the latest (unstable?) state from the Boost Sandbox. Where to install Boost.Chrono? The simple way is to decompress (or checkout from SVN) the file in your BOOST_ROOT directory. Othesewise, if you decompress in a different directory, you will need to comment some lines, and uncomment and change others in the build/Jamfile and test/Jamfile. Sorry for this, but I have not reached yet to write a Jamfile that is able to work in both environements and use the BOOST_ROOT variable. Any help is welcome. Building Boost.Chrono Boost.Chrono is not a header only library. You need to compile it before use. bjam libs/chrono/build Building an executable that uses Boost.Chrono In addition to link with the Boost Chrono library you need also to link with the Boost System library. Testing In order to test you need to do. bjam libs/chrono/test It will be very kind if someone tested this release with other compilers (Intel) and platforms (Mac) as I'm unable to test them. I expect to been able to test on Linux/gcc-4.1.2 soon. Of course any comments and suggestions are welcome. Best regards, _____________________ Vicente Juan Botet Escribá

1 0

[Spirit/Qi] Sequential-or attribute access in semantic action
by Adam Butcher 13 Dec '09

13 Dec '09

Hi, I am having a bit trouble with the semantic action of a sequential-or parser. Specifically my problem is with accessing the attribute of the sequential-or parser. My first observation is that the documentation at http://www.boost.org/doc/libs/1_41_0/libs/spirit/doc/html/spirit/qi/quick_r… defines the attribute type of (a || b) as tuple<A, B>. Unless I've misunderstood, this must be a typo as they should both be optional (it is never valid for both to be omitted but I would expect that client code be able to determine which out of (a), (b) or (a >> b) were provided.) My real problem is that applying a semantic action to [what I think is] an expression returning a sequential-or parser, results in the _1 referring to the attribute of the last parser on the right-hand-side of the sequential-or rather than the attribute of the sequential-or parser itself. In the following snippet (assume 'start' has an attribute of type S), idxspec = '[' >> (start || (':' >> -start)) [ _val = access_index (_r1,lvalue,_1) ] >> ']'; the function 'access_index' is called with an arg3 of type 'optional<S>' rather than the expected 'tuple<optional<S>, optional<optional<S>>>'. Wrapping the sequential-or expression in a 'repeat' directive as repeat(1)[start || (':' >> -start)] solved the problem but obviously gave me an unwanted sequence (albeit with only one element). The attribute type of the above came out to be vector<tuple<optional<S>, optional<optional<S>>>> as expected. To remove the sequence I created a parser directive called 'identity' following the form of 'repeat' which I have attached. My final rule is now idxspec = '[' >> identity[start || (':' >> -start)] [ _val = access_index (_r1,lvalue,_1) ] >> ']'; which is working fine; the _1 delivers an argument of type tuple<optional<S>, optional<optional<S>>> as required. However, I would have expected this behaviour from the first expression. Is this a a proto issue, a spirit issue or have I completely misunderstood something somewhere? It may or may not be relevant but I am using both spirit.classic and spirit 2.1 in the same file. This is historical and will be fixed in time but I guess it could be important. So far I have had no problems with the combination however. Additional info: I am using gcc 4.4.2, stlport 5.1.3 and boost 1.41.0. Regards, Adam

2 6

[chrono] New Features + Bug fixes + Updated documentation
by vicente.botet 13 Dec '09

13 Dec '09

Hi, I'm pleased to annonce the new version of the Boost.Chrono library. Even if the library is not yet ready for review I wanted to share it with you. The library can be downloaded from the vault http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html. For the moment I'm not able to test it on Windows and Mac platforms. Could you check if there are some regressions on Windows or on Mac platforms? Of course, any comments or suggestions are welcome. If there is a volontary review manager that can start inspecting the library s/he is also welcome :). This library is based on the Beman's boostified version of the probe of concept of Howard. Many thanks to Howard the originator of the library and to Beman to start the boostification. Next follows the contents of the library and the updates of the new version Version 0.1.0, April 29, 2009 Beman's boostified version Features: * The C++0x Standard Library's class common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * Class template timer, with typedefs: * system_timer * monotonic_timer * high_resolution_timer * Process clocks and timers: * process_clock, capturing real, user-CPU, and system-CPU times. * process_timer, capturing elapsed real, user-CPU, and system-CPU times. * run_timer, convenient reporting of process_timer results. Version 0.2.0, December 8, 2009 + New Features + Bug fixes + Updated documentation Features: * Added ratio construction and assignment from an equivalent ratio (LWG 1281. CopyConstruction and Assignment between ratios having the same normalized form) * Added nested ratio typedef type (LWG 1281. CopyConstruction and Assignment between ratios having the same normalized form) * Added BOOST_CHRONO_HAS_CLOCK_MONOTONIC macro to state if monotonic_clock is provided on a platform. * Added duration operator% (LWG 934. duration is missing operator%) * Complete duration operator* and operator/ Implementation: * Use INTMAC_C to name intmax_t constants instead of LL. * Separate chrono.cpp on # files win/chrono.cpp, mac/chrono.cpp and posix/chrono.cpp to make easier the maintenance on different platforms. * Separate process_clock.cpp on # files win/process_clock.cpp, mac/process_clock.cpp and posix/process_clock.cpp to make easir the maintenace on different platforms. * Added the error_code prototype for monotonic_clock::now for mac/chono.cpp * Fully implement mac/chrono.cpp with error handling. * Take care on POSIX systems when CLOCK_MONOTONIC is not defined. Documentation: * The documentation is written now using quick-book using as base "N2661 - A Foundation to Sleep On". Fixed Bugs * operator/ was ambiguous: Disambiguate duration operator/ * CLOCK_MONOTONIC is not defined with cygwin/gcc 3.4: Disable code when BOOST_CHRONO_HAS_CLOCK_MONOTONIC is not defined. * result of metafunctions ratio_multiply and ratio_divide were not normalized ratios: Use of the nested ratio typedef type on ratio arithmetic operations. * Copy constructor from similar duration masked the defaulted operations: Added duration defaulted implementations Note that the comon_type class should be integrated by Boost.TypeTraits, class ratio will be proposed as a standalone library Boost.Ratio, and the Timer and Process clock part could be proposed as an update of Boost.Timer. Best regards, _____________________ Vicente Juan Botet Escribá

4 11

Re: [boost] [msm] Review
by Christophe Henry 13 Dec '09

13 Dec '09

Hi Darryl, If you don't mind, I'll start by answering the last question, it'll make the rest of the discussion easier. >Now I'm confused. Are you: > >a) Convinced the suggestion is without merit? No. After reading your last mail, I see a bit better, though I'm not sure I can follow all of it. >b) Waiting for a concrete example? Yes! Exactly. >c) Convinced I'm an idiot that can't figure out how to use msm effectively >(in which case, consider this a request for better docs)? No. Sorry if I gave you the feeling the correct answer was a) or b). I don't mind criticism, any of it, justified or not, as long as it doesn't stay vague and instead goes to concrete, argumented points. Vague negative comments bring little to the review and contribute to giving an incomfortable feeling to all participants. Constructive remarks are, on the other side, highly welcome! That's reason #1 for a review. I sometimes, like yesterday, take part in several parallel discussions, so I have little time left for remarks I cannot start anything with. Sorry about it, it's the negative side of the review. I'd be thankful if potentially useful but vague ideas were kept for a more quiet time. So now, to the concrete parts of your remarks. >I genuinely don't see why msm needs to instantiate state objects it owns at all. If this is the point, then it is a solvable problem. Clearly, it doesn't strictly need. It's just a feature, which is in some contexts very useful. The main one is to be able to save some data in the states. This data can then be generically accessed by the generic functors, thus increasing reuse and encouraging clean code. The functor front-end will be your friend in this case. The same with eUML, but it doesn't have to be eUML. The second reason would be entry/exit: >I suggest spelling them enter<state>(machine) and exit<state>(machine) > or machine.enter<state>() and machine.exit<state>(). Of course, this would be a solution. It's actually an interesting one, and if you don't mind, we'll keep for later (see below). Do we agree that it makes the machine slightly less readable? The 3rd reason is state reuse. This brings us to: >What does reuse of a state in msm mean? Interesting question, which is sadly ignored by many fsm frameworks. A case would be when you want to avoid doing the same case again and again. You could then define a state hierarchy, even (gulps) OO-like for this (or better some template policy magic). For example, I personally often add some logging in debug mode, so that I know what happened in my system. The visitor is another good example of it. I hope that after having a look at it, you'll see the interest you can gain from it. You might have easily missed another case in the doc. If you have a look at iPodSearch and iPodSearchEuml, you'll see where I want to go next. To states which implement STL algorithms. You will then be able to write complex algorithms by simply moving some predefined states on a diagram. I plan to call it the STL (State Template Library ;-) ). While this is for the future, I'll need independent, reusable states for it. >No. For the record, in my opinion, the single the worst feature of >statechart is the necessity to use custom reactions to implement some fsm <constructs. This was a subject of much discussion during the Statechart >(FSM) review iirc. I see. Then I probably misunderstood your point. > Can you perhaps explain why flags are needed? Sure. If you look at the statechart doc, you'll see some state_cast. I personally find it not beautiful in my code. It's also hard to maintain when your fsm structure changes. Flags are faster, require no rtti, are more model-oriented as states define themselves their "property" and makes user code easier/smaller to read. It's even supported by eUML for better model-orientation. I wanted to handle the entry/exit discussion separately. Hopefully I managed to convince you why states are useful and their instanciation brings some advantages. Of course, there is a price to pay, though a small one (if without data, 1 byte/state). This is in most cases not a huge cost. I agree there are cases where the price is still too expensive. I also agree, that the one current MSM back-end is not a solution for all problems, otherwise I would have written in stone that there is one backend and we'd be done. The MSM backend is a fully optimized machine, trying to pack as many features as possible at the lowest possible cost. There are however cases, where one would be ready to give up some features like state reuse and generic functors in exchange for reduced costs. For such cases, there is room for a mini-MSM backend (name from Barend Gehrels ;-) ). And in this case, your entry/exit solution appears a viable, interesting one for which I am thankful. When preparing the review, I had several possibilities: - make the current MSM backend, with lots of features, thus proving that the approach of the MPL book was a great one. - make a reduced, smaller cost version, with the certainty of being criticized for not having enough features (see review from FSM) and rending a disservice to the book. - make a 3rd one, more dynamic, which I want to do since a while. - make no review until all possible back-ends are done and make everybody wait at least one more year. Do we agree that solution 1 seems the more logical? I hope we managed to find a common ground and that a fruitful discussion can take place. Christophe

2 1

[test] new feature - colored output
by Gennadiy Rozental 13 Dec '09

13 Dec '09

Hi, I've implemented a change in regular human readable log and report outputs. You now have an ability to tell the unit test framework to produce colored output. New boolean runtime parameter is added: Environment variable: BOOST_TEST_COLOR_OUTPUT Command-line long: --color_output Command-line short: -x. By default the feature is disabled. Any comments are appreciated. Specifically: how does this feature works in different environments and if there is a way to make MS compiler to work properly (gcc on windows works fine in Windows shell, while msvc build does not) Gennadiy

1 0

[fiber] new version 0.3.0 with future and fiber-migration
by Oliver Kowalke 12 Dec '09

12 Dec '09

Hi, I've uploaded boost.fiber 0.3.0 - it supports future/packaged_task (adapted from Anthony), migrating fiber between schedulers (event running in different threads) and sync. primitives like barrier etc. The spiining sync. objects can be used for snyc. fibers running in different schedulers (running in different threads). Please see examples: ping_pong_mt, migrate_mt, future_mt and barrier_mt regards, Oliver change.log 0.3.0: ------ - support of barrier (more efficient in on scheduler) and spin::barrier (sync .between threads possible) - support of future and packaged_task (example future_mt) - explicit migration of fibers between two schedulers (even if schedulers are in different threads - see example migrate_mt) - locks replaced by locks implementation from boost.thread - introduction of spin::mutex, spin::condition, spin::auto_reset_event, ... (can be used to sync fibers between threads see ping_pong_mt example) - introduction of mutex, condition, auto_reset_event, ... (objects bounded to one scheduler, but more efficient than spin counter-parts) - refactoring of internal classes

1 0

ACID transactions/flushing/MySQL InnoDB
by Stefan Strasser 12 Dec '09

12 Dec '09

hey, this is not a boost question, but it is for the development of a boost library, so maybe a database expert on the list could help me out? I've been benchmarking some test cases of my library against MySQL InnoDB, which isn't even apples to oranges anymore, but nevertheless gave some insights. what I find surprising is the performance of MySQL for small transactions. while my library spends 90% of its time waiting for the disk to flush a transaction, InnoDB uses 100% CPU and barely uses any disk. I've reduced the calls to fsync() for small transactions to 1 call per transaction after some sequential writing, so I'm wondering how MySQL accomplishes this? by definition there must be a flush per transaction, unless you loosen the requirements of the D in ACID. Is that what InnoDB is doing? the only way I see to reduce flushes even more is combining some transactions. but after a power failure some of those transactions can be lost even though they haven reported as successfully committed. I have not yet examined their source code yet. the MySQL documentation doesn't say anything about loosening Durability. (although you have to look pretty hard to see that the default isolation level isn't Serializable either.) thanks in advance, Stefan

5 17

[Boost-config] Add pgi-9.0 threading support
by Belcourt, Kenneth 12 Dec '09

12 Dec '09

Hi John, I've attached a patch to enable threading support with pgi-9.0 (I'm trying to resurrect the pgi tester). Does this look okay to commit? -- Noel

2 1

bug in boost::variant?
by Zachary Turner 11 Dec '09

11 Dec '09

I'm using boost 1.41. I use a variant to store a symbolic representation of an algebraic expression, wrapped inside of a master "node" class. Like this: struct expr_node { friend class constant; friend class variable; friend class arithmetic_op; friend class exponent; friend class special_func; friend class negative; public: template<class T> expr_node(const T& expr) : expr_(expr) { } expr_node& operator=(const expr_node& rhs) { expr_ = rhs; return *this; } private: typedef boost::variant<constant, variable, arithmetic_op, exponent, special_func, negative> node_type; node_type expr_; }; Of course, this is a recursive definition, because exponent, arithmetic_op, etc also contain expr_node members. At some point, I flatten the tree structure across either addition or multiplication, the result of which is a std::list<expr_node>. So in this example, if my expression is 2 * x * 2 * x^x * (2+x)^2 * (1 + x) this becomes the list [2, x, 2, x^x, (2+x)^2, 1+x]. I then use std::partition() to organize this list into the desired order according to the node type. This is where the strange behavior comes in. As you can see there are no negatives in this expression, and indeed, I can verify this is indeed the case in my code as well with: bool expr_node::is_negative() const { return boost::get<negative>(&expr_); } ... BOOST_ASSERT(std::find_if(terms.begin(), terms.end(), boost::bind(&expr_node::is_negative, _1)) == terms.end()); This assert passes. However, Immediately executing std::partition(terms.begin(), terms.end(), boost::bind(&expr_node::is_constant, _1)); BOOST_ASSERT(std::find_if(terms.begin(), terms.end(), boost::bind(&expr_node::is_negative, _1)) == terms.end()); triggers the assert. So something is going wrong involving copying the variants. Every class has both a copy constructor and an assignment operator. Examining the exact contents of the list both before and after the partition, the which_ fields are [0,1,0,3,3,2] (before), and [0,5,5,3,3,2] (after). Putting a breakpoint in all of the negative constructors, I can get a callstack for the first time a 'negative' is constructed. The callstack is as follows: negative::negative(const expr_node & arg={...}) Line 747 C++ node_type::convert_construct<expr_node const >(const expr_node & operand={...}, int __formal=1, int __formal=1) Line 1298 + 0xf bytes C++ node_type::node_type<expr_node>(const expr_node & operand={...}) Line 1367 C++ node_type::assign<expr_node>(const expr_node & rhs={...}) Line 1609 + 0xc bytes C++ node_type::operator=<expr_node>(const expr_node & rhs={...}) Line 1620 C++ expr_node::operator=(const expr_node & rhs={...}) Line 171 C++ std::swap<expr_node>(expr_node & _Left={...}, expr_node & _Right={...}) Line 23 C++ std::iter_swap<term_list::_Iterator<0>,term_list::_Iterator<0> >(term_list::_Iterator<0> _Left={...}, term_list::_Iterator<0> _Right={...}) Line 594 + 0x17 bytes C++ std::_Partition<term_list::_Iterator<0>,boost::_bi::bind_t<bool,boost::_mfi::cmf0<bool,expr_node>,boost::_bi::list1<boost::arg<1> > > >(term_list::_Iterator<0> _First={...}, term_list::_Iterator<0> _Last={...}, boost::_bi::bind_t<bool,boost::_mfi::cmf0<bool,expr_node>,boost::_bi::list1<boost::arg<1> > > _Pred={...}) Line 1838 + 0x4d bytes C++ std::partition<term_list::_Iterator<1>,boost::_bi::bind_t<bool,boost::_mfi::cmf0<bool,expr_node>,boost::_bi::list1<boost::arg<1> > > >(term_list::_Iterator<1> _First={expr_={...} }, term_list::_Iterator<1> _Last={expr_={...} }, boost::_bi::bind_t<bool,boost::_mfi::cmf0<bool,expr_node>,boost::_bi::list1<boost::arg<1> > > _Pred={...}) Line 1847 + 0x64 bytes C++ expr_node::organize() Line 213 + 0x77 bytes C++ Perhaps it's related to the implementation of swap() for variants? If a more detailed code sample is needed, I can upload this entire program to a web server for someone to download. Zach

2 2

Re: [boost] [MSM] compile errors
by Christophe Henry 11 Dec '09

11 Dec '09

Hi Michael, >FWIW. gcc-4.3.3 compiles SimpleTutorial.cpp just fine but has issues with >SimpleTutorialEuml.cpp. Pages and pages of a compiler babble about >boost::fusion::void_ and mpl_::na. > >Should I not be using boot 1.41? I just tried the version with old syntax and with the new one, with gcc-4.4 and boost 1.41 and got no warning, even in pedantic mode (excluding a few in boost/integer_traits.hpp), so I'm scratching my head. Christophe

1 0

interprocess named condition
by Jan 11 Dec '09

11 Dec '09

I'm guessing a named condition has to be used in a shared_memory_object, with a mapped_region. Like the anonymous condition? Which might explain the problems I was having with it before.

1 0

Review Queue Needs Attention
by Tom Brinkman 11 Dec '09

11 Dec '09

Paul A. Bristow said >> Yes - *exposure* is the key to inspiring authors to refine their contributions. >> I've argued for some time for a 'experimental' or 'candidate' status. >> (And a state not damned with faint praise like 'unstable' - which is perhaps >> better described as 'likely_to_be_improved' rather than actively 'not stable'). >> We'd need a simpler review process to agree to put a library into this >> 'candidate state' from the 'sandbox state'. >> This would mean that when libraries are reviewed for full acceptance, they >> should have received much more use, feedback and refinement, and be really ready >> for use by those who want a 'release quality' stable product - including decent >> documentation. Agreed. Here is the current review queue. 1) Lexer Ben Hanson 2) Shifted Pointer Phil Bouchard 3) Logging John Torjo 4) Join Yigong Liu 5) Pimpl Vladimir Batov 6) Task Oliver Kowalke 7) Endian Beman Dawes 8) Meta State Machine (MSM) Christophe Henry 9) Conversion Vicente Botet 10) Sorting Steven Ross 11) GIL.IO Christian Henning 12) AutoBuffer Thorsten Ottosen 14) Log Andrey Semashev 15) String Convert Vladimir Batov 16) Move Ion Gaztañaga 17) Containers Ion Gaztañaga 18) Interval Containers Joachim Faulhaber 19) Type Traits Extensions Frédéric Bron 20) Interthreads Vicente Botet 21) Bitfield Vicente Botet 22) Lockfree Ivo 23) Faster Signam slots Helge Bahmann The number of review requests is far outstripping the number of volunteer review managers. Considering about six libraries per year are getting reviewed, this is well over a three year back log. And this does not even include some other libraries that have been discussed, but not included. There are alot of good ideas here, they should not be ignored. Some of these libraries have been in the queue for over 18 months. My idea to fix this is well known. I would like something similar to Paul's approach. Those of you who have argued against a "non-stable" branch of boost, how would you propose fixing this "review queue" problem.

11 25

Re: [boost] [MSM] Comparison with ad-hoc FSM implementation
by Christophe Henry 11 Dec '09

11 Dec '09

Hi Phil, >> I fully agree with Michael's point that more complicated constructs >> are really messy to implement with ad-hoc techniques. >Do we have any concrete examples of larger problems anywhere? I would >be interested to see them so that I can consider how I would implement them. Sure. Please have a look in the MSM doc at the MsmSession_Handout.pdf. At the last page, you'll see the description of an iPod nano. This example was presented in the BoostCon hands-on session. We managed to write a fsm representing a full mock-up in 90mn (of course we cheated a bit as I had prepared something). And we immediately generated the code. Do you think it would be possible with an ad-hoc solution in such a short time (or even double more)? >> But on the construct presented by Phil I personally find a lot to criticize. >> First of all, it is a mess. > >I would be much happier if you could please avoid using language like this. Please excuse me but I fail to understand what you mean. Being not a native speaker, I'd greatly appreciate some help as I wasn't under the impression to use a rude language. >> what really bugs me is the mix of fsm structure with >> character processing. > >But in this application, the FSM is driven by the characters that are >received - that is what it is all about. Why do you want to separate >it out into two things? Because I consider that the purely fsm part of the application should be separated from the character analysis. A close look at the functor will show you that it handles character analysis and then generates an event. The fsm then decides what to do with the event. A different fsm can choose to reuse the code in another context. I find this pretty natural. Character analysis on one side, handling on the other. >>>void process_event(const character_received_event& e) { .... >>>void process_event(const sigwinch_event& e) { .... >> >> Having to write overloads in a template word??? No, thanks! > >Can you please explain why ? I find it pretty clear that template <class Event> void process_event(Event const&); constitutes a better interface than (adding more events): void process_event(const character_received_event& e) { .... void process_event(const sigwinch_event& e) { .... void process_event(const some_other_event& e) { .... void process_event(const yet_another_other_event& e) { .... etc. >Consider the transition from the seen_escape state to the normal state, >which occurs at the end of an escape sequence. For this you would need >a last_char_of_escape_sequence event. You would need to consider this >in your case statement above (e.g. letters normally do terminate the >escape sequence but digits normally don't). But this categorisation >happens for received characters whatever state the machine is currently >in. So in the transition table you would need rules like this: > >row < normal, escape_char, seen_escape >, >row < normal, last_char_of_escape_sequence, normal >, >row < normal, not_last_char_of_escape_sequence, normal >, >row < seen_escape, escape_char, seen_escape >, >row < seen_escape, last_char_of_escape_sequence, normal >, >row < seen_escape, not_last_char_of_escape_sequence, seen_escape >, The example seems to grow at will, but the issue stays the same. I operated a seemingly small change, concretely: case escape: state = seen_escape; break; was replaced by a functor containing: case escape: fsm.process_event(escape_char()); break; Which I can repeat any time you set the state variable inside a case statement. The only difference is that now, the code analysing the character has no idea of the fsm structure, which means it can be reused in another fsm. This is made possible by the use of a functor. Otherwise, it's your algorithm, only organized in such a way that you have a better chance of reuse in another fsm context. Whatever, I just wanted to show another way of implementing the same algorithm using MSM, with the same performance and a better chance of reuse. A bigger application will probably illustrate better the strength of MSM. If you look at the iPod example, you'll see how the library will do things which are very hard with an ad-hoc solution. I'd be interested to see how an such implementation would solve this problem. I think it might constitute a more interesting discussion base. Regards, Christophe

2 1

[BoostCon 2010] Submission deadline extended
by Hartmut Kaiser 11 Dec '09

11 Dec '09

In 2010 BoostCon celebrates its 4th anniversary in Aspen. You are invited to submit a paper or a session (see the original call for participation here: http://www.boostcon.com/community/wiki/show/Start/) for BoostCon 2010, Aspen on May 10 - May 14th, 2010. Please, see http://www.boostcon.com for more information. Important dates: Proposal submissions Extended to January 3, 2010 Proposals decisions sent January 25, 2010 (tentative program available) Fully scheduled program available February 10, 2010 Session materials due April 15, 2010 Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Re: [boost] [MSM] compile errors
by Christophe Henry 11 Dec '09

11 Dec '09

>As we saw over in the "[fusion] change on trunk breaking proto" thread, >even VC10 has bugs that cause random failures in proto's tests. Using >proto isn't necessarily a talisman against compile errors. Sure. In this case, proto has only a very limited role, at most the one of a trigger. Specifically, VC8 has problems with enable_if for template class specializations. Interestingly, it has a problem with Process2_ eventhough it doesn't even use it, just including the header is enough to get the bug. Even more interesting, the next template specialization (Get_Flag_) doesn't seem to disturb the compiler... Anyway, all VC compilers suffer from the same disease. Most template constructs will manage to compile once, but repeat the operation too much and it gives up. I'd bet that Microsoft uses tons of test cases which try any construct once. I actually only try to support eUML for VC8 to honor the fact that it implemented a typeof back in 2005. Christophe

1 0

[MSM] compile errors
by Christophe Henry 11 Dec '09

11 Dec '09

Hi Michael, >I'm trying to compile SimpleWithFunctors.cpp or SimpleTutorialEuml.cpp >with VC8. Using the original review source code package (not the new >eUML syntax). VC8 will drive me crazy. Now it starts complaining about stuff it doesn't use :( I just committed in the sandbox a fix for VC8 (euml/common.hpp). This should now work. But VC8 will not manage much more than this tutorial. As I wrote, it has very limited eUML support. >FWIW. gcc-4.3.3 compiles SimpleTutorial.cpp just fine but has issues with >SimpleTutorialEuml.cpp. Pages and pages of a compiler babble about >boost::fusion::void_ and mpl_::na. I tried only until 1.40. I just checked (with g++4.3 and 1.39, and with g++4.4 and 1.40) and it works without warning, so either we have different warning options (I have the default) or there is a surprise in 1.41. I'll have a look at it. Sorry for the annoyance. Christophe

3 4

[Date_Time] acquiring accurate high resolution system time
by Jean-Gerard Beauport 11 Dec '09

11 Dec '09

For middleware purposes we have been looking at using Boost as our date/time library. It seems to cover most of our requirements. Now it has been brought to our attention that one of our requirements would be to be able to get the system time at a high resolution. Although using solely the high performance counter is a solution to this, it has its flaws. We have read an article that gives a solution that overcomes some of the problems inherent to using the performance counters, and combines/synchronizes these counters with system time to achieve better resolution. The following is a link to the article that tackles the subject (on Windows): http://msdn.microsoft.com/en-us/magazine/cc163996.aspx Has solving this type of issue been considered in Date_Time? Is it worth looking into? With these questions, I am trying to avoid venturing in something that may have already been experimented with and concluded on. I have noticed in the boost::date_time code that there is the microsec_clock::local_time() call that should provide high resolution time, but in looking at the code I do not quite understand how that is achieved with accuracy. I am trying to understand the file_time_to_microseconds() function in filetime_functions.hpp, and I have difficulty to understand how counting microseconds difference from Jan-01-1601 to Jan-01-1970 comes into play in counting the microseconds from epoch to "now". Can someone clarify this? I thank you in advance for taking the time to answer my few questions. Kind Regards, John

1 0

[MSM] compile errors
by Michael Caisse 10 Dec '09

10 Dec '09

Christophe - I'm trying to compile SimpleWithFunctors.cpp or SimpleTutorialEuml.cpp with VC8. Using the original review source code package (not the new eUML syntax). I have the same errors when compiling each: d:\boost\boost_1_41_0\boost/msm/front/euml/common.hpp(1305) : error C2953: 'boost::msm::front::euml::Process2_<ToProcessEvt,Value,Param1,Param2,Param3,`global namespace'::boost::disable_if<`global namespace'::boost::mpl::or_<`global namespace'::boost::is_same<Param2,void>::type,`global namespace'::boost::mpl::not_<`global namespace'::boost::is_same<Param4,void>::type>::type>::type>::type>' : class template has already been defined d:\boost\boost_1_41_0\boost/msm/front/euml/common.hpp(1243) : see declaration of 'boost::msm::front::euml::Process2_<ToProcessEvt,Value,Param1,Param2,Param3,`global namespace'::boost::disable_if<`global namespace'::boost::mpl::or_<`global namespace'::boost::is_same<Param2,void>::type,`global namespace'::boost::mpl::not_<`global namespace'::boost::is_same<Param4,void>::type>::type>::type>::type>' d:\boost\boost_1_41_0\boost/msm/front/euml/common.hpp(1342) : error C2953: 'boost::msm::front::euml::Process2_<ToProcessEvt,Value,Param1,Param2,Param3,`global namespace'::boost::disable_if<`global namespace'::boost::mpl::or_<`global namespace'::boost::is_same<Param2,void>::type,`global namespace'::boost::mpl::not_<`global namespace'::boost::is_same<Param4,void>::type>::type>::type>::type>' : class template has already been defined d:\boost\boost_1_41_0\boost/msm/front/euml/common.hpp(1243) : see declaration of 'boost::msm::front::euml::Process2_<ToProcessEvt,Value,Param1,Param2,Param3,`global namespace'::boost::disable_if<`global namespace'::boost::mpl::or_<`global namespace'::boost::is_same<Param2,void>::type,`global namespace'::boost::mpl::not_<`global namespace'::boost::is_same<Param4,void>::type>::type>::type>::type>' Something that I'm doing? I'll be trying on gcc soon. Thank you - michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

1 1

[smart_ptr] quick allocator broken
by Juergen Hunold 10 Dec '09

10 Dec '09

Hi ! I just got round to finally debug some mysterious failures on my project against current trunk. It seems that ------------------------------------------------------------------------ r57953 | pdimov | 2009-11-26 21:55:05 +0100 (Thu, 26 Nov 2009) | 1 line Add error checking to lwm_pthreads.hpp. Refs #2681. ------------------------------------------------------------------------ broke BOOST_SP_USE_QUICK_ALLOCATOR support. All my programs (and tests) using smart_ptr fail with /rmc/hunold/packages/boost/boost/smart_ptr/detail/lwm_pthreads.hpp:73: boost::detail::lightweight_mutex::scoped_lock::scoped_lock(boost::detail::lightweight_mutex&): Assertion `pthread_mutex_lock( &m_ ) == 0' failed. on exit. Steps to reproduce: I've attached against the Jamfile.v2 in libs/test/test which adds an extra feature "quick-allocate" with values "off" "on" Running "bjam quick-allocate=on" will start a build using the quick allocator and reveal 4 failures (log attached). I'm lost here. All I have figured out so far is that the destruction of static object might be involved here. But this migt be a red herring. Any ideas on this ? This is catched by the regression tests as obviously noone ist running a build with BOOST_SP_USE_QUICK_ALLOCATOR enabled. I can provide gdb stacktrace when needed. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

2 3

Re: [boost] [MSM] Comparison with ad-hoc FSM implementation
by Christophe Henry 10 Dec '09

10 Dec '09

Hi, Michael Caisse wrote: >This concept is difficult (messy) to implement with ad-hoc techniques. >I personally find that the richness provided by some of the modeling >language constructs produces very simple solutions for what can often >be messy problems to solve. It brings an elegance to the solution >space that cannot be found in just states and transitions alone. >It is the richness of the modeling language that helps one solve more >complex problems without complexity. > >Sure, in these simple toy examples the ad-hoc switch statement looks >as good if not better than a complex library. But as soon as we start >making something that is industrial proof with all the error cases >and whatnots ... well things start getting more complicated and >I personally start looking for some additional constructs to help out. I fully agree with Michael's point that more complicated constructs are really messy to implement with ad-hoc techniques. And the real power behind a fsm library is the abstraction from code to move on to higher abstractions. But on the construct presented by Phil I personally find a lot to criticize. First of all, it is a mess. The code is long and even while the machine is so trivial that you could almost do it without a fsm, it must be quite hard to follow if one adds all what was left out for demonstration purposes. Second, and what really bugs me is the mix of fsm structure with character processing. Such a code is not to be reused (if one doesn't count a selective copy/paste). This is made even worse by the fact that this is obviously GUI code and such processing must happen several times in different modules. I also don't like: >void process_event(const character_received_event& e) { .... >void process_event(const sigwinch_event& e) { .... Having to write overloads in a template word??? No, thanks! I think the only thing I like in it is the O(1). Phil Endecott wrote: >How would you do this with MSM? Something like this presumably: > >row < normal, character_received_event, seen_escape, none, &is_escape_char >, >row < normal, character_received_event, normal, &insert_at_cursor_and_advance >, >row < seen_escape, character_received_event, normal, &cursor_home, &is_H >, >row < seen_escape, character_received_event, normal, none >, >row < any, sigwinch_event, unchanged, &resize_screen > Apart from the fsm structure and syntax errors, which are irrelevant to the discussion, yes, I could do something like this if performance were uncritical in this part of the application and I wanted a chance to play with eUML. But more likely, I wouldn't do that. Instead, if performance was an issue I'd probably keep the second switch/case (the switch on character), pack it inside a nice generic functor which would in no case do this: >case escape: state = seen_escape; break; Because this means mixing character processing with fsm structure. It'd be something like (as entry functor. Could be as transition functor too): struct CharTypeProcessing: euml_action<CharTypeProcessing> { template <class Event,class FSM,class STATE> void operator()(Event const&,FSM& fsm,STATE& ) { switch (c) { case escape: fsm.process_event(escape_char()); break; .... more special characters like tab, newline etc .... default: fsm.process_event(normal_char(c) ) ;break; } } }; I don't go more into details but I'm sure you get the idea. We now have a generic functor, which can be reused in any state or fsm without any knowledge of the structure. It can be documented as: name: CharTypeProcessing description: checks for special characters. Triggers event normal_char(char value) if a normal char, escape_char if escape, etc. And now, any other developer can reuse it, without having to dig into the code to get the part he needs. But what really really strikes me is that it's already Phil's second implementation of a fsm on 2 examples. And a pretty different one than the first! This means double work, double debugging. Add this to the fact that the character processing is also not reusable (mixed with fsm structure, as we saw) and I think I'll be enjoying a latte with a choco-croissant (my favorite) while other developers will still try to find why Phil's code doesn't work for them (hint: they surely made a mistake in their copy/paste. Tsss...). >You are welcome to try to >convince me that it has benefits that I have not yet seen.... Sorry but I won't try because I doubt, from experience, that someone who will have spent a long time on his multiple switch/case will want to give up this work too fast. But it's really ok for me, as I said, I wrote MSM for people like me, who can't see a double switch/case without a strong uncomfortable feeling. If you feel more comfortable with it, great for you! Only, if you ever look for a copy/paste error for hours, I hope you'll picture me with my latte and choco-croissant and switch back to MSM. I'll be happy to share a latte with you ;-) Regards, Christophe

2 1

looser throw specifier for virtual boost::exception_ptr::~exception_ptr()
by Frédéric Bron 10 Dec '09

10 Dec '09

Tried 1.41 today. Seems like the thread library is not compatible with gcc-3.4.4 anymore (here on cygwin). However I do not see such error in trunk tests with gcc- 3.4.3 so I suspect something else. Any idea? In file included from .../boost/thread/future.hpp:12, from .../boost/thread.hpp:24, .../boost/exception_ptr.hpp:43: error: looser throw specifier for `virtual boost::exception_ptr::~exception_ptr()' .../boost/exception/detail/exception_ptr_base.hpp:27: error: overriding `virtual boost::exception_detail::exception_ptr_base::~exception_ptr_base() throw ()' Frédéric

2 2

uuid docs, minor typo
by Ralf W. Grosse-Kunstleve 10 Dec '09

10 Dec '09

I think there is a minor typo in the uuid docs: A UUID, or Universally unique identifier, is indended to uniquely identify ^^^^^^^^ intended Ralf

2 1

Age-based reference counting solves the problem of cyclic references?
by Achilleas Margaritis 10 Dec '09

10 Dec '09

Hello all. I've been playing a little with reference counting ideas, and I came up with an idea that might solve the problem of cyclic references: if a smart pointer remembers all the objects it has touched, and if it knows its age and the age of the objects it has pointed to, the smart pointer can delete the objects if its age is older than the objects it has pointed to. Here is an example: #include <list> #include <iostream> using namespace std; unsigned age = 0; class aged { public: aged() : m_age(-1), m_deleted(0) { } aged(const aged &c) : m_age(-1), m_deleted(0) { } void operator = (const aged &a) { } private: unsigned m_age; unsigned m_deleted; template <class T> friend class ptr; }; template <class T> class ptr { public: explicit ptr(T *value = 0) : m_value(value), m_age(++age) { _acquire(); } ptr(const ptr<T> &p) : m_value(p.m_value), m_age(++age) { _acquire(); } ~ptr() { _release(); m_value = 0; _expire(); } T *operator ->() const { return m_value; } void reset() { _release(); } ptr<T> &operator = (const ptr<T> &p) { _release(); m_value = p.m_value; _acquire(); return *this; } private: T *m_value; unsigned m_age; list<T *> m_remembered; void _acquire() { if (m_value && m_value->m_age > m_age) m_value->m_age = m_age; } void _release() { if (m_value && m_value->m_age >= m_age) m_remembered.push_back(m_value); } void _expire() { for(list<T *>::iterator it = m_remembered.begin(); it != m_remembered.end(); ++it) { T *obj = *it; if (obj->m_age >= m_age && !obj->m_deleted) { ++obj->m_deleted; obj->~T(); --obj->m_deleted; if (!obj->m_deleted) ::operator delete(obj); } } } }; class Foo; class Bar : public aged { public: ptr<Foo> m_foo; Bar() { cout << "Bar()\n"; } ~Bar() { cout << "~Bar()\n"; } }; class Foo : public aged { public: ptr<Bar> m_bar; Foo() { cout << "Foo()\n"; } ~Foo() { cout << "~Foo()\n"; } }; int main() { { ptr<Foo>foo0; { ptr<Foo> foo1(new Foo); foo1->m_bar = ptr<Bar>(new Bar); foo1->m_bar->m_foo = foo1; ptr<Bar> bar1(foo1->m_bar); { ptr<Foo> foo2 = foo1; foo2->m_bar = ptr<Bar>(new Bar); foo0 = foo1; foo1.reset(); } } } return 0; } While there is a referential cycle (foo->bar->foo), all objects are eventually deleted. While the above example doesn't use reference counting, it can be combined with reference counting to solve the issue of cyclic references: objects that their reference count reaches 0 are deleted normally; objects with cycles remain in memory until the oldest pointer to them goes out of scope. In most cases, What do you think?

2 1

[MSM] Comparison with ad-hoc FSM implementation
by Christophe Henry 10 Dec '09

10 Dec '09

Hi Phil, >switch ((state<<8) | event) { > case (Stopped<<8)|play: start_playback(); state=Playing; break; > case (Stopped<<8)|open_close: open_drawer(); state=Open; break; >etc. etc. >The greatest advantage of this ad-hoc style is that it is readable >by anyone who has even the most basic understanding of C++ without >the need to learn a new library, and its exact behaviour is immediately >evident. It is also likely to compile and run quickly. > >I have no doubt that MSM has many benefits compared to this. Perhaps >it would be useful to spell them out? The question is of course slighty provocative but still valid. The answer will be quite long, sorry about that. I won't say that your solution is not good. Actually if someone is happy with such a solution, great for him. If you check the review from Franz Alt, you'll see the source code generated by Rhapsody, which is not very different from this one, the O(1) double-dispatch excluded. And it's at least way better than non-formal state machines which I happen to see in production code again and again. A state machine library, including MSM, is made for people who are not happy with such an approach. I wrote MSM out of sheer frustration with Statechart's inability to provide me with what I was looking for, and out of admiration for the solution presented in the MPL book. I only hoped that others felt like me and would like an alternative. Concretely, what I was looking for: - a descriptive, expressive and declarative state machine syntax. - most of UML features which are hard to code with a switch/case dispatch. - a library with the explicit goal of supporting a Model-Driven-Development process - enough speed so that it'd be hard to reject a state machine simply on speed grounds (usual excuse). Next, you wil ask me what UML features I deem so important that it justifies a library. My personal favorites (order by what I use most): - events containing data. In your case, you are more or less forced to choose between the O(1) (which you did) and forgo event data or the O(n) (chosen by Rhapsody) at a speed cost. Metaprogramming techniques allow us a O(1) with event data. - actions/guards. Luckily, they are easy to implement in a switch/case. - orthogonal regions. I often use them for error handling and they greatly make the machine more readable by reducing the number of transitions. Also hard to get with a switch/case. - submachines (makes the code cleaner). Implementing them inside a switch case is simply horrible. Soon, you need to hide them in subclasses so we are already going in the direction of a library. - flags. Will make the calling code easier - exit points. Not my favorite, but always needed. Will quickly make your switch/case implementation hard to follow. - anonymous events. Hard to write with a switch/case dispatch. Luckily for your case, not everybody likes them. - history. Easy to implement in a switch/case (as long as you don't need them event-dependent) but doesn't make your code any more readable Of course, like always, developers use only 20% of all UML features. But it's never the same 20%, so what you need depends on your "coding" style. And if you want to implement all these features in a switch/case, your code will quickly become terrible. You'll have to issue guidelines on how to implement them, each developper will have to redo the same again and again with the corresponding flow of bugs (what if I forget a "break"? Uh oh) and low productivity (not even talking about documentation). Do we agree that this proves the need of a library? The next valid question would be, why MSM? It doesn't have to. If you're happy with Statechart or another library and don't need the speed, it's really ok for me, I promise ;-) MSM is for people who, like me, want a declarative syntax. People who want to have a look at the transition table and see the whole structure of a machine. Not as clearly as on a diagram but better than just code. That's why there is a transition table, and that's why there is eUML, to make it even clearer. This will greatly help us developers communicate with domain experts who will not understand code, but quite fast understand a state machine (I tried an it works). The second reason is the descriptive syntax of MSM. I wanted a library which would help a Model-Driven-Development. I wanted a library allowing us to switch from a graphical model to code and code to model. And I wanted the mapping to be complete. The goal would be to, at some point, never have to edit the code. I don't know how far I'll push it but you can be sure that I will push it as far as I can. This is where the functors added in eUML and the reusable states will help. I hope I managed to answer your question. Christophe

7 7

Re: [boost] [msm] scalability
by Christophe Henry 10 Dec '09

10 Dec '09

Hi Jeff, >I've dragged myself back to 2009 from 2004 where I've been stuck with >CodeWarrior and an emulated OSX 10.3 environment with no chance of using > any modern boost libs. So I hope to have a review in by the end of the week. Great to have you back in 2009! >Indeed MSM 1.x showed g++4.2 much faster and uses less ram than VC8. Is >MSM 2.x any faster or more ram frugal? Sorry about it but probably not. The engine of 2.0 is based on the one of 1.20 with an added (tiny) metaprogramming layer to convert the front-end table to a back-end one. So it could be actually slower. Not much with VC9 but I didn't measure with VC8. This tiny part was enough to lose g++3.4 for good though :( >Unfortunately the same code takes over 2.5 minutes on VC8 >Aah! I should mention these times are for debug builds > This forced me to revert to the TMP book's STT >implementation which compiled in less than 30 seconds on both platforms, >and allows Incredibuild to do it's job. Yes, VC8 is from far the slowest MSM-supporting compiler and debug is the worst, in compile-time and ram usage. I'm afraid, the best I can offer would be a mini-MSM backend based mostly on the book example but supporting basic frontend features so that at least you'll be able to switch the backend if you change compiler one day. I noticed that using precompiled headers will reduce the compile-time by about a third. >Interestingly if I just put all the MSM implementation inline there is >about a 1 minute overall build time improvement. What do you mean with inline? It sounds interesting. >My efforts at submachine refactoring actually increased compile times >significantly. Also my main motivation for using the STT is it's ability >to give both a forest-and-trees presentation of a moderately complex set >of operations. Any refactoring just to get better compile times that >obscures this ease of understanding just negates the benefits. Of course >if refactoring into regions/zones exposes some underlying relations >inherent in these states, transition and operations than it's fully >justified, IMHO. Refactoring into regions is usually a good idea from a design point of view. I didn't mean it as a pure compile-time reduction measure though. I was just describing what, in my experienced, could reduce the compile-time a little. Do you maybe remember what increased your compile-times? >I can attest to Christophe responsiveness and willingness to accommodate >users needs. Thanks! It was a two-way street because MSM greatly gained from your (and others') suggestions. Christophe

1 0

boost_extension
by Christian Henning 10 Dec '09

10 Dec '09

Hi there, to get the boost extension movement going how would people feel if we create a new project on sourceforge called "boost_extension". This will be a placeholder for all extensions to all boost accepted libraries. The goal is to have a project structure very similar to boost. For instance, all extensions have to have tests, documentation, etc supported by bjam. The folder structure will be the same boost, like boost_extension\boost\gil\io or boost_extension\libs\gil\io\test\ There will be a review process as well. Only accepted libraries will be added. Hopefully enough people will be interested in participating. As, for releasing, again we would model after boost. There will be a developing trunk and a release branch. Hopefully within the next couple of releases we can sync releases with boost. I know there is a plethora of issues involving such an effort. Please let me know what you think. Thanks, Christian

6 12

[Integer] Help needed with Codegear failures
by John Maddock 10 Dec '09

10 Dec '09

Boost.Integer now just has failures with the codegear compiler, for example: http://beta.boost.org/development/tests/trunk/developer/output/siliconman-b… These failures have always been present I believe, but weren't previously being fully tested. Anyone any ideas? Thanks, John.

2 2

Updated performance results using Boost Serialization 1.41
by Brian Wood 10 Dec '09

10 Dec '09

I've recently updated the performance section of a comparison between the Boost Serialization library and the C++ Middleware Writer -- http://webEbenezer.net/comparison.html#perf<http://webebenezer.net/comparison.html#perf>. The new tests were done on Fedora 12 and Windows Vista. The previous version of that file is here http://webEbenezer.net/comp138.html#perf<http://webebenezer.net/comp138.html#perf>. The most dramatic change occurred on Windows. Previously the Boost versions were around 2.7 times slower than the Ebenezer versions. Now they are between 3.8 and 4.0 times slower than the Ebenezer versions. I believe that difference is due to our dropping return codes for exceptions. I'm not sure why it shows up more on Windows than on Linux. Cheers, Brian Wood Ebenezer Enterprises http://www.webEbenezer.net "When a man's ways please the L-RD, he makes even his enemies to be at peace with him." Proverbs 16:7

5 10

review request: addition to type_traits library of is_less_comparable<T, U> and others
by Frédéric Bron 09 Dec '09

09 Dec '09

I would like to propose to your review the following addition to the type_traits library (at https://svn.boost.org/trac/boost/browser/sandbox/type_traits and http://dl.free.fr/tK0BwIzYy) 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) The compilation has been tested with g++ 4.3.2 and icpc 10.0 on linux 64 bits, g++ 3.4.4 on cygwin, mingw32 3.4.4 on cygwin. Regards, Frédéric

15 54

[msm] New eUML syntax
by Christophe Henry 09 Dec '09

09 Dec '09

Hi, As it seems that the eUML syntax suggested by Robert Stewart is favored by most of those who gave their opinion about it, I decided to give it a try and uploaded into the vault (http://www.boostpro.com/vault/index.php?direction=0&order=&directory=Msm&) a preview version (review_tests.zip) of the new syntax, along with 3 tutorials rewritten using this new syntax. This will allow us to play with it and see if we like it. I'd be happy to get some feedback. I personally found it hard to get used to this syntax, but it can be because I'm so used to the "old" one. Another effect is that I had to reorganize my transitions based on the target state instead of the source, which made me change my debug state_name array (as written in Annex A, the index of a state is based on its position in the transition table). If you don't use state names as debug information, you needn't mind about it. Tested compilers were VC9 and g++ 4.3. Please post your comments in the developer list. Have fun! Christophe PS: a few speed optimizations (due to interesting tests from Barend Gehrels) are also in, so should the back-end make any problem, please let me know.

2 1

stuck with template programming
by DE 09 Dec '09

09 Dec '09

hi everyone i managed to write piece of code which seems to be valid c++ but compiles neither with msvc80 nor with icc11 the code is in the attachment if this question falls out of this maillist' scope please tell me where can i post it any ideas how to work around these problems? -- Pavel

2 1

[integer]/cstdint.hpp How to use portable literals?
by vicente.botet 09 Dec '09

09 Dec '09

Hi, I need to use boost::intmax_t literals in a portable way. I remember some discussion related to this subject, but I've not found the thread. Could someone point me to these threads, or tell me how I can achieve this. I'm currently using the macro INTMAX_C, but it seems that this macro is not always defined. Thanks, _____________________ Vicente Juan Botet Escribá

1 0

[property-map] Generalizing identity_property_map for arbitrary types
by Belcourt, Kenneth 09 Dec '09

09 Dec '09

Hi, I've found the property map library to be very useful and would like to propose a minor enhancement to permit the identity_property_map to work for arbitrary types. The reason for this is that some computationally intensive algorithms suffer noticeable performance degradation when I convert them to generic algorithms using property maps. Having a typed identity property map that returns, for example, the double passed into it significantly speeds up our algorithms, at least for those fields that are not mutable. I've attached a patch, and could supply a motivating example, if anyone is interested. -- Noel

2 3

Blog and source code for "abstract_fsm"
by David Bergman 09 Dec '09

09 Dec '09

As I mentioned elsewhere, I created an abstract FSM interface for non-complex FSM's, translating to either Statechart or MSM in compile-time. There is a blog basically repeating what I posted earlier here at http://blog.davber.com/2009/12/08/abstract_fsm-finite-state-machines-in-c/ and the source code is found at http://github.com/davber/abstract_fsm. Hmm, I always have a hard time deciding which place should be the canonical one - with examples and such - the Github repository or the blog (post)! If somebody can tell what is Right and Wrong here, I would appreciate it ;-) /David

1 0

[mpl] [type_traits] [enable_if] Overloading Problem with GCC 3.3.3
by Stewart, Robert 08 Dec '09

08 Dec '09

Can anyone figure out why GCC 3.3.3 doesn't like the following member function overloads? VC7/8/9 and GCC 4.1.2 have no problems with this code. #include <boost/mpl/and.hpp> #include <boost/mpl/not.hpp> #include <boost/type_traits/is_const.hpp> #include <boost/type_traits/is_convertible.hpp> #include <boost/utility/enable_if.hpp> struct Bar { }; template <class T> struct Baz { }; struct Foo { template <class T> typename boost::enable_if < boost::mpl::and_ < boost::is_convertible<T,Bar> , boost::mpl::not_<boost::is_const<T> > > >::type set(Baz<T> const & _value); template <class T> typename boost::enable_if < boost::mpl::and_ < boost::is_convertible<T,Bar> , boost::is_const<T> > >::type set(Baz<T> const &); }; GCC 3.3.3's error message is: error: `template<class T> typename boost::enable_if<boost::mpl::and_<boost::is_convertible<T, Bar>, boost::is_const<T>, mpl_::bool_<true>, mpl_::bool_<true>, mpl_::bool_<true> >, void>::type Foo::set(const Baz<T>&)' and `template<class T> typename boost::enable_if<boost::mpl::and_<boost::is_convertible<T, Bar>, boost::mpl::not_<boost::is_const<T> >, mpl_::bool_<true>, mpl_::bool_<true>, mpl_::bool_<true> >, void>::type Foo::set(const Baz<T>&)' cannot be overloaded _____ Rob Stewart robert.stewart(a)sig.com Software Engineer, Core Software using std::disclaimer; Susquehanna International Group, LLP http://www.sig.com IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

2 2

New libraries deadline approaching
by Vladimir Prus 08 Dec '09

08 Dec '09

Boosters, the deadline for merge of new libraries to 1.42 is Dec 14. So far, the only library that was added to trunk relative to 1.41 is uuid. Andy, does it seem like merge to release branch is possible by Dec 14? Do you need any assistance? It seems that you have succeeded in integrating the tests into the regression framework. However, one test -- test_generators, appear to fail on all platforms and test_uuid fails on a bunch as well. If the test failures are unclear, you might want to ask platform experts for help, while there is time. The next deadline will be Jan 4, when the release branch will be closed for major code changes. -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

5 7

[interval containers (itl)] Update on Review Version. Element iterators added.
by Joachim Faulhaber 08 Dec '09

08 Dec '09

Dear all, while hanging around in "The Queue" my library was getting pretty bored :-/ So I decided to implement some depreciated featured to arrange for some entertainment =) Well, jokes aside, for a long time I resisted to implement iteration on *elements* for interval containers. Element iterators would be an invitation to inefficient usage of interval containers just by normal habitual use of iterators. For instantiations with continuous domain types like interval_set<double>, interval_set<rational<int>>, interval_set<string>, etc. element iteration would not be possible at all. Yet the questions about such iteration and the related question of interval containers being a model of SortedAssociativeContainer reoccurred in many feed backs on presentations of my library. There even was a proposal for a DenseSet library by Vicente Botet in the wiki's Library Wish List: https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction that follows the idea of interval containers but provides element iteration in order to fully implement SortedAssociativeContainer. So finally I decided to provide element iteration and put the responsibility to avoid inefficient deployment on the user. Moreover, while element iteration on interval containers can be substituted easily by simple loops, the element iteration over an interval_bitset that Zachary Turner asked for http://archives.free.net.ph/message/20091103.064651.263bf6bb.en.html is not so trivial, so it can not be substituted easily by a few lines of user code. That gave me some new motivation. So I have uploaded an update of my library's review version http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_… to the vault that is extended by these features: * element iterators on all interval containers http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/fu… * itl::insert_iterator and itl::inserter that allows interval containers to be copied or transformed from std::containers using insert semantics http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/ex… * itl::add_iterator and itl::adder that allows interval containers to be copied or transformed from std::containers using addition semantics so that aggregate on overlap can be done. http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/ex… In the extended library itl_xt that is part of http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_pl… * there is an implementation of a large interval_bitset, that combines interval compression and bit compression. Element iteration is now available for interval_bitset. https://svn.boost.org/svn/boost/sandbox/itl/boost/itl_xt/interval_bitset.hpp Element iteration now enables interval_containers to be used with std::algorithms like the corresponding containers of elements. The major requirement for usability of element iteration is that the interval container's domain_type is a discrete type that has a smallest steppable unit and exposes an increment and decrement operator for it's in- and decrementation. I have successfully tested copy (and variants), equal, lexicogrphic_compare, find, lower_bound, upper_bound, includes and set_<algorithms>. All tested algorithms that were applicable to a SortedAssociativeContainer of elements were also working with interval_containers using element_iterators. The test have been done using a law "AtomicEquivalence" https://svn.boost.org/svn/boost/sandbox/itl/boost/validate/laws/atomic_equi… on the law based test automaton (LaBatea) https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/labat_sor… So I think this is a valuable addition to interval containers in the end and I hope it'll make std::algorithm aficionados among you happy ;-) Cheers Joachim ----------------------------------------------------------- Some repeated information on the library: Please note that the original ITL as presented in May 2008 has been split into 3 parts and only the *first* part was submitted for review (2009-09-18): itl : Core library, interval containers, SUBMITTED FOR REVIEW Additional parts are: itl_xt : Extensions like interval_bitset, histories and generalized crosstables validate: The law based test automaton (LaBatea). A validation tool using laws aka axioms. *itl* is a complete library containing all required ingredients particularly a separate test suite (NOT using LaBatea) and the quickbook documentation. The code is successfully compiled and tested with gcc-3.4.4, 4.1.0, 4.3.2 and msvc-8.0, 9.0, 10.0. I have uploaded the first update of the review version as itl_3_2_0.zip to the vault in section containers. http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_… Another file itl_plus_3_2_0.zip contains all three parts (itl, itl_xt and validate). http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_pl… Reviewers interested in the law based testing part may have to refer to this file to examine those tests. The law base testing examples compile and run with gcc-4.3.2, msvc-8.0, 9.0 and 10.0. LaBatea does not compile with gcc-4.1.0 or older. The quickbook generated documentation is included in the zip files and is also available online at http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Sources are also available form the sandbox: https://svn.boost.org/svn/boost/sandbox/itl/

1 0

[type_traits] Need help with an - unfixable? - issue
by John Maddock 08 Dec '09

08 Dec '09

This issue just came in: https://svn.boost.org/trac/boost/ticket/3730 Reduced to the test case below, and I can't see a way to fix this at present, anyone any bright ideas? Thanks, John. #include <map> #include <iostream> #include <boost/type_traits.hpp> class base { public: base() : i(0) {} base(int i) : i(i) { m[i] = "text"; } virtual void method1() = 0; virtual ~base() {}; private: int i; std::map<int, std::string> m; }; class derived1 : virtual public base { public: }; class derived2 : virtual public base { public: }; class intermediate : public derived1, public derived2 { public: intermediate() {} intermediate(int i) : base(i) {} void method1(); }; void intermediate::method1() { } class final : public intermediate { public: final() {} final(int i) : base(i) {} }; // // This class demonstrates what we need to make work inside is_virtual_base_of. // MSVC compiles this just fine (likewise is_virtual_base_of), and only complains // when attempting to use method1. Other compilers (GCC, Intel on Linux) complain // as soon as X is declared, likewise when instantiating is_virtual_base_of. // struct X : final, virtual intermediate { X(); X(const X&); X& operator=(const X&); ~X()throw(); }; int main( int /* argc */, char* /* argv */[] ) { X x; x.method1(); boost::is_virtual_base_of<intermediate, final>::type t; return t.value != true; }

2 1

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 08 Dec '09

08 Dec '09

Hi Michael, hi Robert, hi Felipe, >CurrentState() + cool_event() >[VeeeeeryLoooooooooongGuard()] >/(LooooooooooooooooongAction()) = DestState() I just wanted to bring an example from SimpleTimer (see doc): Ringing() + tick() == Ringing() [ Source_<m_ringing_cpt>() - Event_<m_tick>() > Int_<0>() ] / (Source_<m_ringing_cpt>() -= Event_<m_tick>() ) would become: Ringing() + tick() [ Source_<m_ringing_cpt>() - Event_<m_tick>() > Int_<0>() ] / (Source_<m_ringing_cpt>() -= Event_<m_tick>() ) == Ringing() Here, it is becoming hard to write action and target state on the same line. And the action can be as big as one wishes. >Here's another suggestion, though it breaks from the logical UML ordering Michael posted previously: >DestState() = CurrentState() + cool_event()[guard()]/(action()) I like this one quite much! Not UML at all but pretty much C++-style. And it'd become easy to write guard and action on the next lines if needed. >CurrentState() + cool_event()[guard()]/(action()) -> DestState() It's very similar with Michael's syntax but I think the operator precedence can be hard to master and we'll need extra parentheses. I think there is no operator -> in proto but ->* . We are making progress :) Christophe

2 1

Re: [boost] [msm] Review
by Christophe Henry 08 Dec '09

08 Dec '09

>FYI, this is an issue of -- apparently -- English not being Christophe's first language. >Darryl's construct, "This is unlike StateChart, where the idea of object instantiation as state is genuinely useful sometimes,..." >means "MSM's approach is unlike that of StateChart, because StateChart instantiates state objects, which is sometimes genuinely useful." > >I think there was more to the original sentence, which I haven't taken the trouble to recover from earlier posts, >which better developed what Darryl liked about MSM's own approach. >There was, however, no implication that MSM fails to meet expectations because it wasn't like StateChart in this behavior. > >For those for whom English is a second language, I apologize. >Few native English speakers learn the language well. We thus make our inherently complex language harder >still to understand by our mistakes of grammar, syntax, structure, and even word usage. >Add to that the many idiomatic constructs and expressions, not to mention colloquialisms, >we use that it's amazing that you manage to converse with us so well. Oh I see. Sorry Darryl for misunderstanding your post. Robert, thanks for your help! Christophe

1 0

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 08 Dec '09

08 Dec '09

Hi Michael, >Thank you for setting me straight on this. It should have dawned >on me that they were completion transitions as described in 15.3.14. >I have a love/hate feeling about them... I don't personally like >the concept of leaving a state via implicit trigger. It just makes >me feel uncomfortable. However, I also see the power they can >afford and use them for exactly your example... stepping along >algorithms. You taught me about simple states' internal transitions so let's count it a fair trade ;-) >Right now I'm pushing on the edges of what I'm learning from the docs >and a little bit of playing so I can determine how to convert basic >constructs I use a lot from the model to the implementation. Thanks >for putting up with me. You're welcome. I enjoy the discussion and await the harder questions which are surely coming. Christophe

1 0

Re: [boost] [msm] Review
by Christophe Henry 08 Dec '09

08 Dec '09

Hi Darryl, >I agree with this. However, I have yet to come completely to terms with >how best to use msm. I am beginning to think, in trying to use it, that >it would be better to separate the state transition table definition as >much as possible from what, in an msm world, are more like semantic >actions. This is very different from the more oo modeling approach of >statechart. I'm not sure the statechart isn't better at expressing fsms >that "emerge" out of overall application/system design in an all >encompassing oo design uml world, and msm better at expressing more self >contained "islands" of fsm in an app As far as I can tell, state machines and OO modeling are completely orthogonal concepts. An OO implementation doesn't mean that FSMs are an OO concept. Can you precise your point with a concrete example? >I'm far from an expert with >spirit, but I think there are many concepts that could be borrowed from >it to make msm better able to be used to define a fsm that can be bound >to separate objects to implement behavior and exend its use beyond these >islands. Again, can you help us with more concrete examples? >Basically, it needs to be easier to take a 1 TU transition table >integrate it into to a bigger multi TU system What would it concretely bring? Compile-time improvements not really, so? >actions - the functor approach is good - though it needs a bit more >development to make it easier to bind to actions that are not explicitly >designed for use as msm state machine actions. What would it bring? You can simply ignore the functor arguments if you don't need them. A closer look at eUML will however show you that having your source/target states at hand in a transition handling can be pretty useful. >states - I don't really understand what an instance of a state is in msm >- it doesn't model anything meaningful to me. Where do you suggest putting the entry/exit actions and the flags? All in one big fat react function with lesser code reuse possibilites? And all the state data inside a fsm? Why giving up reuse of states? >This is unlike statechart, >where the idea of object instantiation as state is genuinely useful - >sometimes, and where it is the state that "reacts" to an event In UML, it is a state machine which reacts to an event, not a state. Statechart != UML (the same applies to MSM). Furthermore, "unlike Statechart" isn't a valid argument, is it? Making MSM look like Statechart is not the goal (besides, David would make us another round ;-) Just kidding, David) Could you please develop your point a little? >Should msm drop state objects altogether and simply have some sort of context / >current state object? Arguably it already has one in the form of the fsm >object - though that is a bigger concept than context. I disagree. I see no gain doing this. Just more confusing, tightly coupled, unreusable state machines. >Michael Caisse has already pointed out that there is something slightly odd about the >current state being represented as a scalar in a model that has objects >as states Did we read the same post? I didn't read all this in any of his posts. >I haven't spent much time thinking about this I also have this feeling, to be frank. If I understand, what you want is a MSM looking like Statechart. What for? I think a few concrete points would help us all. Of course, MSM could easily support a Statechart-like frontend, but nobody required this so far. I had the opposite feeling, that most people welcomed the lesser coupling offered by MSM. Or am I getting it wrong? Christophe

3 2

[serialization] #3677: Please, pay attention to a serious regression
by Alexander Churanov 08 Dec '09

08 Dec '09

Folks, I've just re-opened the issue #3677, since I did not receive any specific feedback on how to resolve it. In the ticket it's claimed that the issue is fixed. However, for the question about how to obtain the patch it was answered that there is a belief the patch is checked in somewhere into the trunk. I completely understand that Boost is free and does not provide any warranty for quality and reliability of the libraries. However, I hope that there is a strong interest in Boost community for that. To my knowledge, the issue is cross-platform and may broke more applications than stated in the ticket. It is a pure regression: boost 1.39 is known to work. The issue is a showstopper, at least for FreeBSD: I may not update the boost to 1.41, because this action breaks working applications. The desired is any definite decision on the issue. Preferably, a fix or a workaround. Alexander Churanov, maintainer of devel/boost-*

1 0

Re: [boost] [serialization] polymorphic archives runtime failure(was:polymorphic archives ... generates linker errors)
by Bogdan 08 Dec '09

08 Dec '09

I just want to confirm I have the same issue with boost 1.41.0 built with MSVC 9.0 (Visual Studio 2008). I have created two tests similar to the one Christoph describes ( both with and without DLLs) and I hit exactly the same assert in basic_serializer_map::find(). It looks like while deserializing B via A*, basic_iarchive_impl::load_pointer() is trying to recover a serializer from: boost::serialization::singleton< boost::archive::detail::archive_serializer_map<boost::archive::naked_xml_iar chive> > (or boost::serialization::singleton< boost::archive::detail::archive_serializer_map<boost::archive::naked_text_ia rchive> >, depending on the input archive actually used) but that map is empty. I checked boost::serialization::singleton< boost::archive::detail::archive_serializer_map<boost::archive::polymorphic_i archive> > in the first line of my program and it contains correctly two serializers (one for A and one for B, respectively), proving that the macro BOOST_CLASS_EXPORT_IMPLEMENT(.) has registered those classes. I am not sure why the serializers for A and B do not register with the specific polymorphic archives but only with the base archive. I was under the impression that the polymorphic archives are meant to make that process transparent to the user (especially future archives that are created later). I appreciate any feedback about this issue and please let me know if you need more details. Thank you, Bogdan PS I am using extended type_info_no_rtti. Deserializing via isomorphic pointers (B*->ser->dser->B*) is working.

4 4

[regex][patch] regex build not honoring ICU_LINK build property
by Martin Schafföner 08 Dec '09

08 Dec '09

I have been trying to build boost.regex with Unicode support against a custom ICU4C build. The ICU4C build used the "--with-library-suffix=rm" configuration option to distinguish the library as being custom built. I tried building boost.regex with the bjam option like '-sICU_LINK="\"/LIBPATH:c:\icu4c\dist\libs\windows-i686 icuinrm.lib icuucrm.lib\""' but it failed to apply the linker flags. I then tried to understand what's going on and it seemed that the ICU_LINK property never makes it into the actual linker calls. With the attached patch against 1.41.0 the ICU_LINK build property works as expected. Regards, Dr. Martin Schafföner Core Technologies Recommind, Inc. Office: +49 2226 15 966 13 Email: martin.schaffoener(a)recommind.com This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and destroy this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is strictly forbidden. Diese E-Mail enthält vertrauliche und/oder rechtlich geschützte Informationen. Wenn Sie nicht der richtige Adressat sind oder diese E-Mail irrtümlich erhalten haben, informieren Sie bitte sofort den Absender und vernichten Sie diese Mail. Das unerlaubte Kopieren sowie die unbefugte Weitergabe dieser Mail ist nicht gestattet.

2 1

Re: [boost] [Regex] Why doesn't this pattern match?
by Vitalij Gotovskij 08 Dec '09

08 Dec '09

>> Yes, Robert, You are right. I am trying to change \\n (wchar_t '\' and >> wchar_t 'n') with a real new line symbols and it doesn't work. Allthought, >> then I am trying to find only wchar_t 'n' (or any other letter) everything >> is working good. The problem is that I have XML configuration file >> (Unicode), where all new lines are L"\\n" (!!! not '\n' !!!). I can't >> change that file format. Of course I can program that replace without >> boost::regex, but I am afraid that I'll loose my sleep afterwards... >> >>>> You're replacing each occurrence of \\n with \\n, so the >>>> string at the end should be exactly the same! :-) >> >>> The replacement is "\n" not "\\n" so the '\' followed by 'n' in str >>> should be replaced with a newline, right? > No. Remember the compiler gets first bite at the escape characters, so if > you put a string "\\n" in your program, that gets passed to Boost.Regex as > the two character string: "\n", which matches a single newline character. > If you want to match a \ followed by a \n then you need a regex of "\\\n". >HTH, John. You wanted to say: "\\\\n" ? :) Anyway, thanks a lot. This works! Didn't knew regex engine is working in that way... If he understands "\\\\n" as C++ "\\n" and "\\n" as C++ understands "\n", then how regex engine understands "\n" ...? Don't answer this letter. The problem is solved.

1 0

[Regex] Why doesn't this pattern match?
by Vitalij Gotovskij 08 Dec '09

08 Dec '09

Hello, can, please, somebody explain, why this code doesn't work? std::wstring str = L"Line \\n line \\n line \\n"; std::wstring result = L""; const boost::u32regex e = boost::make_u32regex(L"\\n"); std::wstring newText = L"\n"; result = boost::u32regex_replace(str, e, newText); After launching result == str... :((( I also tryed with const boost::u32regex e = boost::make_u32regex("\\n"); but result was the same... I am using Regex from bost 1.37.0 compilled with ICU 4.2.1 Visual Studio 2008.

3 3

[MSM] Comparison with ad-hoc FSM implementation
by Phil Endecott 08 Dec '09

08 Dec '09

Dear All, When we reviewed Andrey Semashev's proposed FSM library last year I presented a couple of examples of simple state machines encoded "ad hoc", i.e. primarily as switch statements that set the next state based on the current state and inputs, and asked "why is this library better?". I'm going to ask the same question of MSM. Consider the example presented in the documentation: struct cd_player_fsm { enum state_t { Stopped, Open, Empty, Playing, Paused }; enum event_t { play, open_close, stop cd_detected, pause, end_pause }; state_t state; void process_event(event_t event) { if (state==Stopped && event==play) { start_playback(); state=Playing; } else if (state==Stopped && event==open_close) { open_drawer(); state=Open; } else if (state==Stopped && event==stop) { state=Stopped; } else if (state==Open && event==open_close) { close_drawer(); state=Empty; } else if (state==Empty && event==open_close) { open_drawer(); state=Open; } else if (state==Empty && event==cd_detected && good_disk_format()) { store_cd_info(); state=Stopped; } etc. etc. } }; Of course one difference is that MSM has O(1) dispatch. We can get that too if we use a switch statement, maybe something like: switch ((state<<8) | event) { case (Stopped<<8)|play: start_playback(); state=Playing; break; case (Stopped<<8)|open_close: open_drawer(); state=Open; break; etc. etc. The greatest advantage of this ad-hoc style is that it is readable by anyone who has even the most basic understanding of C++ without the need to learn a new library, and its exact behaviour is immediately evident. It is also likely to compile and run quickly. I have no doubt that MSM has many benefits compared to this. Perhaps it would be useful to spell them out? Regards, Phil.

1 0

Re: [boost] [msm] eUML guard/action location
by Christophe Henry 08 Dec '09

08 Dec '09

Hi Michael, >Ok... I looked up MSM's anonymous transitions again and >now I don't like it (o; It's probably because we don't talk about the same concept. And it's not an MSM concept. Sorry, I can't claim ownership for it ;-) Anonymous transitions are also called completion events in the standard (and both names are used in the excellent "Real-Time UML, 3rd Edition"). They are defined as a transition without explicit trigger and are generated after the entry actions. You can have a look at the tutorials to see how it is used. >Christophe ... as far as I can tell by looking at the docs, >the MSM use of anonymous transitions transforms the source >state to *almost* be a UML choice pseudo state I disagree with this. The state itself is not concerned, it is only a state machine thing. If you reuse the same state in another context, it will not behave like a choice point. But in this special state machine context, yes, it behaves the same, which is why I didn't implement choice points yet. Now you see what I meant ;-) I was at first not convinced by this feature until I saw a project in a big automotive company making extensive use of it. At every processor time slice, they'd go through the whole fsm used in this context as an algorithm. They could this way easily estimate the time slice they needed. What you are talking about is a trigger, which has to be fired, whatever it is. I didn't find it in the standard, but I could have missed that too. And no, MSM doesn't support it for the moment. The reason is that it's not on my radar as I'm pretty unconvinced of its need. I have yet to see a good convincing use case for it. Now, I don't say it won't be done, but it's not high on my list, unless someone makes a convincing case for it. Its implementation might be not trivial though. Christophe

2 1

Re: [boost] [msm] Review
by Christophe Henry 08 Dec '09

08 Dec '09

Hi, >eUML makes up *~75%* of Msm's code and ~30% of Msm's documentation; metrically, >it's obviously an extremely significant part of Msm, and is probably what >warranted a major version increment between Msm versions 1.2 and 2.0. Correct. Although it is not the only reason, there is also a big redesign with division in front- and back-ends and riddance of the CRTP. Adam Merz wrote: >I could be way off here, but my impression from the Msm documentation >is that the standard frontend exists mostly for backwards compatibility >with 1.x code and to support older compilers, and that > eUML is the recommended frontend for new FSMs on supported compilers David Bergman wrote: >That was not my impression. My impression was that the (old) standard interface >was the canonical one, and eUML an "option" for developers. MSM has no favorite interface, but a choice of interfaces which it tries to support equally well. But it's true that eUML is my personal favorite way and the source of a great amount of fun. I personally thought (or say hoped) that it'd become the new way of writing state machines, but I came into this review without an idea of how it would be welcome. From what I saw for reactions until now, I'm pretty confident eUML will meet this goal at some point. >I would welcome eUML into Boost any day, from what I have seen (especially after playing with it this morning.) Great! >Do we really need a new underlying library for eUML, though? I am not sure of that. You don't get a new library for eUML but eUML for a new library. It's clearly not the same. >And even if we do (for now), and cherish the much faster execution speeds of MSM >(in my non-complex but pretty big state machine examples), I don't get what is the problem. You get a backend with impressive performance which was built with the goal to allow expressive, declarative and concise front-ends with great UML support and lots of work done under the hood which you can't even imagine. Without it, there would be no interface and no eUML. Why not have it? I thought that Boost was standing for state-of-the-art C++ coding and was happy to get any great library coming, no matter which library is already part of it. Don't we all agree on that? >I would argue for an attempt at having eUML as an optional facade for both MSM and Statechart. For this you'd need some important amount of change in Statechart, for which I cannot do anything. eUML being a representation of the underlying MSM philosophy, I doubt that you will have it. Let me get it straight. The biggest value of MSM is not the front-end, not even eUML, no matter how cool it is. It is the back-end. Actually it's the philosophy behind the back-end. Christophe

4 5

[ratio] metafunction ratio_subtract
by vicente.botet 07 Dec '09

07 Dec '09

Hi Beman, Hi Howard, With current implementation of the metafunction ratio_subtract I get the type from the test ratio_test.cpp User1::Distance d( User1::mile(110) ); User1::Time t( boost::chrono::hours(2) ); typeof (d/t) is User1::quantity<boost::ratio<1,-1>, boost::ratio<1,1> > So the following assignation do not works User1::Speed s = d / t; as User1::Speed is defined as typedef quantity<boost::ratio<1>, boost::ratio<0> > Time; // second typedef quantity<boost::ratio<0>, boost::ratio<1> > Distance; // meter typedef quantity<boost::ratio<-1>, boost::ratio<1> > Speed; // meter/second The code is a little bit triky, and I have not taken the time to understand why the resulting type is User1::quantity<boost::ratio<1,-1>, boost::ratio<1,1> > and not <boost::ratio<-1,1>, boost::ratio<1,1> > User1::quantity I have replaced the type by typedef ratio<R1::num * R2::den - R2::num * R1::den,R1::den * R2::den> aux_type; typedef ratio<aux_type::num ,aux_type::den > type; // get normalized type to follow the recommendation "The nested typedef type shall be a synonym for ratio<T1, T2> where T1 has the value R1::num *R2::den - R2::num * R1::den and T2 has the value R1::den * R2::den." and every thing is OK (See below the replaced code) I'm doing something wrong? Best, _____________________ Vicente Juan Botet Escribá template <class R1, class R2> struct ratio_subtract { private: #if 1 typedef ratio<R1::num * R2::den - R2::num * R1::den,R1::den * R2::den> aux_type; #else static const boost::intmax_t gcd_n1_n2 = detail::static_gcd<R1::num, R2::num>::value; static const boost::intmax_t gcd_d1_d2 = detail::static_gcd<R1::den, R2::den>::value;#endif public: //The nested typedef type shall be a synonym for ratio<T1, T2> where T1 has the value // R1::num *R2::den - R2::num * R1::den and T2 has the value R1::den * R2::den. #if 1 typedef ratio<aux_type::num ,aux_type::den > type; #else typedef typename ratio_multiply < ratio<gcd_n1_n2, R1::den / gcd_d1_d2>, ratio < detail::ll_sub < detail::ll_mul<R1::num / gcd_n1_n2, R2::den / gcd_d1_d2>::value, detail::ll_mul<R2::num / gcd_n1_n2, R1::den / gcd_d1_d2>::value >::value, R2::den > >::type type; #endif };

2 4

[ratio] Assignation between equivalent ratios
by vicente.botet 07 Dec '09

07 Dec '09

Hi, I was wondering if we need to be able to make assignations between equivalent ratios. e.g. ratio<1,3> r1; ratio<3,9> r2; r1 = r2; // (1) Reading N3000 even if they are equivalents (synonym ) as its num and den are the same, there is no defined assignation. So (1) should not compile with the current recomendation. IMO, this should compile, and so we need to add a specific assignement operator. Other example ratio<1,3> r1; ratio<2,3> r2; r1 = r2-r1; // the type of this expression could be ratio<3,9> so the compilation fails. Otherwise the recomendation should clarify the meaning of synonym on the ratio arithmetic operators [ratio.arithmetic] 2 "The nested typedef type shall be a synonym for ratio<T1, T2> where T1 has the value R1::num * R2::den + R2::num * R1::den and T2 has the value R1::den * R2::den." Maybe we should talk of normalized ratio and not of synonym. BTW, where is synonym defined? In addition I think that we need also to add that the declaration of no normalized ratios, as ratio<3,9>, must fail at compile time as it is not normalized and we can not assigne nothing to them. I'm missing something? Any thougths? Best regards _____________________ Vicente Juan Botet Escribá

5 7

Re: [boost] [msm] Review
by Christophe Henry 07 Dec '09

07 Dec '09

Hi David, >The problem is this: if, *hypothetically*, eUML were the only substantial difference between this proposal >and what is already in Boost, I would argue for an implementation of that syntax on top of Statechart to be a more viable solution. Agreed. >As you spell out here - and I can confirm - that is not the only difference Happy that we finally agree ;-) >Perhaps, I would like to take on that challenge and see how far I can get. >I think it would be great to have a common transition-definition format for these two libraries, and being able to switch in compile-time. >Let me try to look at it a bit, and see what I can do. It would involve a lot of wrappers, unfortunately :-( As I wrote in another post, I find the idea hard but interesting and I can only encourage you to give it a try. >I enjoy being critical of things I like, which is why I always criticize my wife. I wouldn't try to push this too much with mine ;-) >So, take that as a good sign for my formal review (which has already been pushed one day due to my "common interface" sickness :-) ) I'll be happy to read it. I think that, while this common interface thing went a bit long, you brought interesting points to the review and even went the extra mile to not criticize without bringing at least a beginning of a solution, which is not a very common thing. Christophe

1 0

Meta State Machine library review starts Monday
by David Abrahams 07 Dec '09

07 Dec '09

Dear all, With apologies for making this announcement so close to the review start date... The review of the Boost.Msm library starts this Monday, November 23rd and ends the December 6th. Msm was written by Christophe Henry, inspired in part by the example in the book "C++ Template Metaprogramming" (http://boostpro.com/mplbook) About the library: Msm (Meta State Machine) is a library allowing the user to easily define high-performance, straightforward and readable UML2 finite state machines, while respecting the principles of efficiency and declarativeness of the original example. To that end, Msm offers several Domain-Specific Embedded Languages that strive to closely emulate a standard UML diagram. Msm supports a broad range of UML features: - state entry/exit - transition actions/guards - composite states - history - orthogonal regions - terminate states - deferred events - explicit entry/fork - entry/exit pseudostates - anonymous transitions - transition conflicts And several non-standard features to make the developer's life easier (interrupt states, query about the current state(s)). Msm (in its current version, 2.0) can be found: * in the sandbox (http://svn.boost.org/svn/boost/sandbox/msm/) * or in the vault: (http://www.boostpro.com/vault/index.php?directory=Msm) Everybody on this list is invited to participate in this formal review. I hope to see your review of Msm, including your vote on acceptance, and I welcome your participation in the ensuing discussions on the Boost developers' mailing list. Please always include in your review a vote as to whether the library should be accepted into Boost. Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? - With what compiler? - Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards, -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com Review Manager BoostPro Computing http://www.boostpro.com

8 10

Re: [boost] Meta State Machine library review starts Monday
by Christophe Henry 07 Dec '09

07 Dec '09

>I'm wanting to start discussing some more complicated >use cases of this library. Ideally I will just post >the UML HFSM diagram with my email so it is clear. Why not in the Vault in MSM's directory?

1 0

Re: [boost] [msm] internal/external conflicting transitions
by Christophe Henry 07 Dec '09

07 Dec '09

>> I didn't find this in the standard, but I might have missed it out. >> Whatever, after a lengthy discussion with Juraj Ivancic, I came to the >> conclusion that MSM needed what we called an "execution row", which is >> pretty much your internal transitions for simple states. >> >I'll need to search the archives for this discussion (unless it was >elsewhere). As for the standard: using the UML 2.2 Superstructure >document (it is the one I have handy), Section 15.3.15 describes >TransitionKind. It's ok, I found it in 15.3.14. Just before the completion events actually, so we can have a look at both at the same time ;-)

1 0

[msm] eUML guard/action location
by Christophe Henry 07 Dec '09

07 Dec '09

Hi Michael, >What do you think about this instead? > >CurrentState() + cool_event()[Guard()]/(action()) = DestState() > >I think it more closely matches the UML syntax. It's a good idea and it surely matches the UML syntax better. I think the operator precedence will also work. There are however 2 issues: - the current order "CurrentState() + cool_event() = DestState() [Guard()]/(action())" has been chosen to closely match the "normal" row syntax. Only guard and action have been inverted because of operator precedence. - anonymous events. In this case, you have no event, so your syntax would become: CurrentState() [Guard()]/(action()) = DestState() But now the guard/action are "attached" to the source state, which means 2 grammars to support with the corresponding flow of compiler risks and compile-time increases. The first issue is only my worry that users would be confused (eUML already being quite a change). I'd be interested to hear from others about it. The second issue is not so big that it's not worth a try. I think I'll have a look at it and if it works we can then decide which one we prefer. Regards, Christophe

4 3

[iostreams] Fix for restrict/slice
by Daniel James 07 Dec '09

07 Dec '09

Hi, I don't want to merge the new iostreams changes until the unit test results are looking better. So I had a go at fixing restrict_test and slice_test. It would be really helpful if someone more familiar with the library than I am check this. There are two changes, the first is just to fix a problem with running the tests (which I suspect is why the test failure wasn't noticed before). The second one is the one that matters. It look like that when a write to a restricted/sliced stream goes past the end of the restricted area it wasn't writing the last part of the data, so I've tried to fix that. The change is here: https://svn.boost.org/trac/boost/changeset/58225 If it's wrong, I'll revert it. I know little about the library, so I'd appreciate any help here. thanks, Daniel

1 0

Re: [boost] [Boost-users] Updated performance results using Boost Serialization 1.41
by Brian Wood 07 Dec '09

07 Dec '09

Kim Barrett writes: >On Dec 4, 2009, at 7:11 PM, Hartmut Kaiser wrote: >> Our measurements show Boost.Serialization spends most of its time creating >> (constructing) archives and there it's mainly initializing the locale... > > The locale initialization can be avoided if your application can get away with using the > boost::archive::no_codecvt construction flag. (Assuming that's still behaving the same > as when I looked into this performance area back around boost 1.33.) > > These threads may also be of interest: > > http://lists.boost.org/Archives/boost/2005/07/90814.php Based on that link I tried it as follows: int const binary_archive_flags = boost::archive::no_header | boost::archive::no_codecvt; filebuf fb; fb.open("ofile", ios_base::out); binary_oarchive oa(fb, binary_archive_flags); clock_t start(clock()); oa << lst; clock_t end(clock()); I didn't discern any improvement to the performance of this test from adding those flags. > http://lists.boost.org/Archives/boost/2006/03/102133.php I don't see how that is relevant. > > I keep promising myself that I will soon collect sufficient round tuits to do something > about this, but so far those promises remain broken. Maybe once I upgrade my team to boost 1.41. -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net

1 0

Re: [boost] [Boost-users] Updated performance results using Boost Serialization 1.41
by Brian Wood 07 Dec '09

07 Dec '09

Hartmut Kaiser writes: > Our measurements show Boost.Serialization spends most of its time creating > (constructing) archives and there it's mainly initializing the locale... That seems a little different from what I've been testing. The test looks like this: filebuf fb; fb.open("ofile", ios_base::out); binary_oarchive oa(fb); clock_t start(clock()); oa << lst; clock_t end(clock()); The time to construct an oarchive is not included in the test. -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net

1 0

Re: [boost] [msm] internal/external conflicting transitions
by Christophe Henry 07 Dec '09

07 Dec '09

Hi Michael, >I'm hoping to test it thoroughly. I'm an HFSM geek and >ROOM/UML implementations are part of my livelihood. Great! Welcome to the club (though you probably were there before me). >Ok. So I think this is part of the issue. As you know, UML defines three >types of states: simple, composite and submachines. It appears that >MSM implements simple and maybe submachines. I'm still unclear on >what MSM exactly has and will write another email on the subject after >I have sorted it all out. MSM supports all but implements submachines and composite as one concept because I consider the difference isn't worth bringing 2 words. >Transitions can be either internal or external. Even for simple states. >An internal transition in a simple state will never execute exit or >entry code. I didn't find this in the standard, but I might have missed it out. Whatever, after a lengthy discussion with Juraj Ivancic, I came to the conclusion that MSM needed what we called an "execution row", which is pretty much your internal transitions for simple states. >And this is where I was unclear. A better question would be: For >a simple state, how do I create an internal transition? For the moment, you can't easily. The only way would be to specialize on_entry and on_exit on some events, but this is less than perfect, so this feature is quite at the top of my list. >This also disturbs me a bit... though it isn't your problem. Bran Selic >for some reason changed this behavior in UML. It used to be much more >well defined. Internal transitions were always evaluated before external >transitions. I don't know about that change, but I know that this depth-first strategy has some critics (which I failed to understand). Whatever, after the new type of row for simple states is added, you'll be able to define it wherever you want in the transition table and can therefore decide yourself of the priority. You will not however be able to do it for rows coming from composites because MSM will handle it alone, otherwise it'd break the exit points. I think it is a reasonable solution. >Perfect! This is what I wanted to know. I think it would be helpful >to describe the run-to-completion semantics (including the ordering) >in the documentation as well as a summary of rules for conflict >resolution. I do like the "last transition wins" rule you have >created. I also understand defining it as undefined (implementation-specific) >behavior. This has already been requested and will be done, along with a complete description of the dispatch algorithm. Christophe

2 1

Re: [boost] [msm] Review
by Christophe Henry 07 Dec '09

07 Dec '09

>I would expect both libraries to allow either mpl::vector or mpl::list. Sure. That the examples use mpl::vector doesn't mean list would not work.

1 0

Re: [boost] [msm] history pseudo states
by Christophe Henry 07 Dec '09

07 Dec '09

>I apologize. I'm still not clear on the distaste. Ignoring regions >for a minute.... does it make sense then? A composite state could >only have a single history. And the history's transition is the default >if the composite state hasn't been visited yet... so it makes sense >that there could only be one of those too. Not to apologize, I knew I was taking a risk when I decided to ignore this part of the standard. Sure, ignoring regions, shallow history makes sense. Except for the part about having to draw a transition from the top-level fsm to INSIDE the composite. Talk about UML favoring encapsulation... And if you count deep history, then it becomes even uglier. How do you mark the default state in the sub-submachine? I found no answer. >Adding in regions messes the whole thing up. And here might be >the sticking point. I can tell you that the history of "return to history" >was from an era without regions. In that context it is a very power >construct. Seeing the spec it is clear that regions were not included ;-) So, all this brought me to the conclusion that a policy was a greatly superior solution. Encapsulation ok, deep history ok, regions ok, and the possibility to define a new history policy. But I'm open to any solution answering my critics on this subjects. Of course, it's not the kind of solution that an OO-dominated body can come up with. Christophe

1 0

Re: [boost] [msm] Review
by Christophe Henry 07 Dec '09

07 Dec '09

Hi David, Thanks for bringing some depth to the discussion. >2. In Statechart, the definition of a state is coupled to the machine in which it resides > while in MSM the state can be defined totally in isolation of the machine, and, thus, reused in other machines >3. In Statechart, the transitions are coupled to the from-state, and defined therein, > whereas in MSM, the transitions are coupled to the machine itself; this makes it a bit tricky to reuse a state in Statechart This is an important interface difference, isn't it? > 5. MSM has eUML, which I have *not* used, to simplify the machine specification. I'd also count it as an important interface difference. You brought the following example, which will be a good starting point. Unfortunately, you seem to want to make it tell too much about Statechart/MSM similarities (I read "fairly similar") so let's tough it out a little. With Statechart, you had: struct State1 : simple_state<State1, Machine> { typedef transition<Event, State2, Machine, &Machine::action> reactions; }; And with MSM: typedef mpl::vector< a_row<State1, Event, State2, &Machine_::action> > transition_table; Now this example is a bit too simple to see a huge difference, so it is slightly misleading. If you don't mind, let's add a very simple thing, a guard (which is a boolean condition having the right to prevent the triggering of a transition). With MSM this becomes: typedef mpl::vector< row<State1, Event, State2, &Machine_::action, &Machine_::some_condition> > transition_table; Could you you maybe now show us how the Statechart version will look like? Let's now add a conflicting transition, which means another possible transition on the same event and the same source state, with guards deciding which (if any) transition will be taken. With MSM you'd have, for example: typedef mpl::vector< row<State1, Event, State2, &Machine_::action, &Machine_::some_condition>, row<State1, Event, State3, &Machine_::action, &Machine_::some_other_condition> > transition_table; Could you now write the Statechart version for us? How easy is your Statechart->MSM translator now? (Note: MSM->Statechart will stay pretty simple, right?) After seeing both versions, will we all agree that there are important interface differences and that these differences are an important distinguishing feature? Christophe

4 4

Re: [boost] Two FSM libraries, one interface
by Christophe Henry 07 Dec '09

07 Dec '09

>Out of curiosity, but since MSM is designed to have configurable >front-ends and back-ends, why cannot statemachine become a new >back-end and/or front-end to MSM? MSM supports everything >statemachine does so it should be possible with perhaps minor syntax >changes... You mean FSM_DEF? It could, but first it'd need to support a bit more to become interesting. If I have to maintain it, I want to be sure that it does what the other front-ends do. If I don't maintain it, then no problem for me.

1 0