/* TRAIT.hpp - type handling and type detection helpers Copyright (C) Lumiera.org 2009, Hermann Vosseler This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef LIB_META_TRAIT_H #define LIB_META_TRAIT_H #include "lib/meta/util.hpp" #include "lib/meta/duck-detector.hpp" #include #include #include #include #include #include #include //Forward declarations for the Unwrap helper.... namespace boost{ template class reference_wrapper; } namespace std { namespace tr1 { template class reference_wrapper; template class shared_ptr; }} namespace lib{ template class P; } namespace mobject{ template class Placement; } namespace lib { namespace meta { /** * Helper for type analysis: * tries to extract a base type from various wrappers. * Additionally allows to extract/deref the wrapped element. * @warning strips away any const */ template struct Unwrap { typedef X Type; static X& extract (X const& x) { return const_cast (x); } }; template struct Unwrap { typedef typename boost::remove_cv::type Type; static Type& extract (const X* ptr) { ASSERT (ptr); return const_cast (*ptr); } }; template struct Unwrap > { typedef X Type; static X& extract (boost::reference_wrapper wrapped) { return wrapped; } }; template struct Unwrap > { typedef X Type; static X& extract (std::tr1::reference_wrapper wrapped) { return wrapped; } }; template struct Unwrap > { typedef X Type; static X& extract (std::tr1::shared_ptr ptr) { ASSERT (ptr); return *ptr; } }; template struct Unwrap > { typedef X Type; static X& extract (P ptr) { ASSERT (ptr); return *ptr; } }; template struct Unwrap > { typedef X Type; static X& extract (mobject::Placement placement) { ASSERT (placement.isValid()); return *placement; } }; /** convenience shortcut: unwrapping free function. * @return reference to the bare element. * @warning this function is dangerous: it strips away * any managing smart-ptr and any const! * You might even access and return a * reference to an anonymous temporary. */ template typename Unwrap::Type& unwrap (X const& wrapped) { return Unwrap::extract(wrapped); } /** Helper for type analysis: tries to strip all kinds of type adornments */ template struct Strip { typedef typename boost::remove_cv ::type TypeUnconst; typedef typename boost::remove_reference::type TypeReferred; typedef typename boost::remove_pointer ::type TypePointee; typedef typename boost::remove_cv ::type TypePlain; typedef typename Unwrap ::Type Type; }; /** Type definition helper for pointer and reference types. * Allows to create a member field and to get the basic type * irrespective if the given type is plain, pointer or reference */ template struct RefTraits { typedef TY* pointer; typedef TY& reference; typedef TY value_type; }; template struct RefTraits { typedef TY* pointer; typedef TY& reference; typedef TY value_type; }; template struct RefTraits { typedef TY* pointer; typedef TY& reference; typedef TY value_type; }; /** Trait template for detecting if a type can be converted to string. * For example, this allows to write specialisations with the help of * boost::enable_if */ template struct can_ToString { enum { value = boost::is_convertible::value }; }; /** Trait template for guarding \c lexical_cast<..> expressions. * Such an expression won't even compile for some types, because of * missing or ambiguous output operator(s). * Ideally, there would be some automatic detection (relying on the * existence of an operator<< for the given type. But I couldn't make * this work, so I fell back on just declaring types which are known * to work with lexical_cast to string * @note this compile-time trait can't predict if such an conversion * to string will be successful at runtime; indeed it may throw, * so you should additionally guard the invocation with try-catch! */ template struct can_lexical2string { enum { value = boost::is_arithmetic::value }; }; /** Trait template to detect a type usable with the STL for-each loop. * Basically we're looking for the functions to get the begin/end iterator */ template class can_STL_ForEach { typedef typename Strip::Type Type; struct is_iterable { META_DETECT_NESTED(iterator); META_DETECT_FUNCTION(typename X::iterator, begin,(void)); META_DETECT_FUNCTION(typename X::iterator, end ,(void)); enum { value = HasNested_iterator::value && HasFunSig_begin::value && HasFunSig_end::value }; }; struct is_const_iterable { META_DETECT_NESTED(const_iterator); META_DETECT_FUNCTION(typename X::const_iterator, begin,(void) const); META_DETECT_FUNCTION(typename X::const_iterator, end ,(void) const); enum { value = HasNested_const_iterator::value && HasFunSig_begin::value && HasFunSig_end::value }; }; public: enum { value = is_iterable::value || is_const_iterable::value }; }; /** Trait template to detect a type usable immediately as * "Lumiera Forward Iterator" in a specialised for-each loop * This is just a heuristic, based on some common properties * of such iterators; it is enough to distinguish it from an * STL container, but can certainly be refined. */ template class can_IterForEach { typedef typename Strip::Type Type; META_DETECT_NESTED(value_type); META_DETECT_OPERATOR_DEREF(); META_DETECT_OPERATOR_INC(); public: enum{ value = boost::is_convertible::value && HasNested_value_type::value && HasOperator_deref::value && HasOperator_inc::value }; }; }} // namespace lib::meta #endif