- Boost - lists.boost.org

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