BOOST_NO_MPL_AUX_HAS_XXX -> BOOST_MPL_NO_AUX_HAS_XXX

[SVN r18974]
This commit is contained in:
Aleksey Gurtovoy committed 2003-07-08 05:10:04 +00:00
1 parent bc30ed2002
commit b8a4930412
8 files changed
+98 -85

No files matched your search

+1 -1
View File
@@ -154,7 +154,7 @@ template<> struct trait<T> \
#else
// agurt, 11/jan/03: signals a stub-only implementation
# define BOOST_NO_MPL_AUX_HAS_XXX
# define BOOST_MPL_NO_AUX_HAS_XXX
# define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, default_value) \
template< typename T > \
@@ -5,8 +5,11 @@ namespace boost {
namespace mpl {
namespace aux {
template< long N > struct advance_backward;
#if !defined(PRIOR)
# define PRIOR(x) x::prior
#endif
template< long N > struct advance_backward;
template<>
struct advance_backward<0>
{
@@ -15,7 +18,6 @@ struct advance_backward<0>
typedef Iterator iter0;
typedef iter0 type;
};
};
template<>
@@ -24,10 +26,9 @@ struct advance_backward<1>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename PRIOR(iter0) iter1;
typedef iter1 type;
};
};
template<>
@@ -36,11 +37,10 @@ struct advance_backward<2>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef iter2 type;
};
};
template<>
@@ -49,12 +49,11 @@ struct advance_backward<3>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename iter2::prior iter3;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef typename PRIOR(iter2) iter3;
typedef iter3 type;
};
};
template<>
@@ -63,13 +62,12 @@ struct advance_backward<4>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename iter2::prior iter3;
typedef typename iter3::prior iter4;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef typename PRIOR(iter2) iter3;
typedef typename PRIOR(iter3) iter4;
typedef iter4 type;
};
};
template< long N >
@@ -5,8 +5,11 @@ namespace boost {
namespace mpl {
namespace aux {
template< long N > struct advance_forward;
#if !defined(NEXT)
# define NEXT(x) x::next
#endif
template< long N > struct advance_forward;
template<>
struct advance_forward<0>
{
@@ -15,7 +18,6 @@ struct advance_forward<0>
typedef Iterator iter0;
typedef iter0 type;
};
};
template<>
@@ -24,10 +26,9 @@ struct advance_forward<1>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename NEXT(iter0) iter1;
typedef iter1 type;
};
};
template<>
@@ -36,11 +37,10 @@ struct advance_forward<2>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef iter2 type;
};
};
template<>
@@ -49,12 +49,11 @@ struct advance_forward<3>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename iter2::next iter3;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef typename NEXT(iter2) iter3;
typedef iter3 type;
};
};
template<>
@@ -63,16 +62,15 @@ struct advance_forward<4>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename iter2::next iter3;
typedef typename iter3::next iter4;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef typename NEXT(iter2) iter3;
typedef typename NEXT(iter3) iter4;
typedef iter4 type;
};
};
template< long N >
template< long N >
struct advance_forward
{
template< typename Iterator > struct apply
@@ -5,6 +5,10 @@ namespace boost {
namespace mpl {
namespace aux {
#if !defined(PRIOR)
# define PRIOR(x) x::prior
#endif
template< long N > struct advance_backward;
template<>
struct advance_backward<0>
@@ -22,7 +26,7 @@ struct advance_backward<1>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename PRIOR(iter0) iter1;
typedef iter1 type;
};
};
@@ -33,8 +37,8 @@ struct advance_backward<2>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef iter2 type;
};
};
@@ -45,9 +49,9 @@ struct advance_backward<3>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename iter2::prior iter3;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef typename PRIOR(iter2) iter3;
typedef iter3 type;
};
};
@@ -58,10 +62,10 @@ struct advance_backward<4>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::prior iter1;
typedef typename iter1::prior iter2;
typedef typename iter2::prior iter3;
typedef typename iter3::prior iter4;
typedef typename PRIOR(iter0) iter1;
typedef typename PRIOR(iter1) iter2;
typedef typename PRIOR(iter2) iter3;
typedef typename PRIOR(iter3) iter4;
typedef iter4 type;
};
};
@@ -5,6 +5,10 @@ namespace boost {
namespace mpl {
namespace aux {
#if !defined(NEXT)
# define NEXT(x) x::next
#endif
template< long N > struct advance_forward;
template<>
struct advance_forward<0>
@@ -22,7 +26,7 @@ struct advance_forward<1>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename NEXT(iter0) iter1;
typedef iter1 type;
};
};
@@ -33,8 +37,8 @@ struct advance_forward<2>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef iter2 type;
};
};
@@ -45,9 +49,9 @@ struct advance_forward<3>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename iter2::next iter3;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef typename NEXT(iter2) iter3;
typedef iter3 type;
};
};
@@ -58,10 +62,10 @@ struct advance_forward<4>
template< typename Iterator > struct apply
{
typedef Iterator iter0;
typedef typename iter0::next iter1;
typedef typename iter1::next iter2;
typedef typename iter2::next iter3;
typedef typename iter3::next iter4;
typedef typename NEXT(iter0) iter1;
typedef typename NEXT(iter1) iter2;
typedef typename NEXT(iter2) iter3;
typedef typename NEXT(iter3) iter4;
typedef iter4 type;
};
};
+1 -1
View File
@@ -69,7 +69,7 @@ struct is_sequence
BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_sequence,(T))
};
#elif defined(BOOST_NO_MPL_AUX_HAS_XXX)
#elif defined(BOOST_MPL_NO_AUX_HAS_XXX)
template<
typename BOOST_MPL_AUX_VOID_SPEC_PARAM(T)