stabilize build system: depends, installer, boost/bdb fixes, cross targets groundwork
This commit is contained in:
@@ -0,0 +1,158 @@
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
/// \file iterator.hpp
|
||||
/// Proto callables for std functions found in \<iterator\>
|
||||
//
|
||||
// Copyright 2012 Eric Niebler. Distributed under the Boost
|
||||
// Software License, Version 1.0. (See accompanying file
|
||||
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
|
||||
#ifndef BOOST_PROTO_FUNCTIONAL_STD_ITERATOR_HPP_EAN_27_08_2012
|
||||
#define BOOST_PROTO_FUNCTIONAL_STD_ITERATOR_HPP_EAN_27_08_2012
|
||||
|
||||
#include <iterator>
|
||||
#include <boost/type_traits/remove_const.hpp>
|
||||
#include <boost/type_traits/remove_reference.hpp>
|
||||
#include <boost/proto/proto_fwd.hpp>
|
||||
|
||||
namespace boost { namespace proto { namespace functional
|
||||
{
|
||||
|
||||
// A PolymorphicFunctionObject wrapping std::advance
|
||||
struct advance
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
typedef void result_type;
|
||||
|
||||
template<typename InputIterator, typename Distance>
|
||||
void operator()(InputIterator &x, Distance n) const
|
||||
{
|
||||
std::advance(x, n);
|
||||
}
|
||||
};
|
||||
|
||||
// A PolymorphicFunctionObject wrapping std::distance
|
||||
struct distance
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename InputIter1, typename InputIter2>
|
||||
struct result<This(InputIter1, InputIter2)>
|
||||
{
|
||||
typedef
|
||||
typename std::iterator_traits<
|
||||
typename boost::remove_const<
|
||||
typename boost::remove_reference<InputIter1>::type
|
||||
>::type
|
||||
>::difference_type
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename InputIterator>
|
||||
typename std::iterator_traits<InputIterator>::difference_type
|
||||
operator()(InputIterator first, InputIterator last) const
|
||||
{
|
||||
return std::distance(first, last);
|
||||
}
|
||||
};
|
||||
|
||||
// A PolymorphicFunctionObject wrapping std::next
|
||||
struct next
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename ForwardIterator>
|
||||
struct result<This(ForwardIterator)>
|
||||
{
|
||||
typedef
|
||||
typename boost::remove_const<
|
||||
typename boost::remove_reference<ForwardIterator>::type
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename This, typename ForwardIterator, typename Distance>
|
||||
struct result<This(ForwardIterator, Distance)>
|
||||
{
|
||||
typedef
|
||||
typename boost::remove_const<
|
||||
typename boost::remove_reference<ForwardIterator>::type
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename ForwardIterator>
|
||||
ForwardIterator operator()(ForwardIterator x) const
|
||||
{
|
||||
return std::advance(
|
||||
x
|
||||
, static_cast<typename std::iterator_traits<ForwardIterator>::difference_type>(1)
|
||||
);
|
||||
}
|
||||
|
||||
template<typename ForwardIterator>
|
||||
ForwardIterator operator()(
|
||||
ForwardIterator x
|
||||
, typename std::iterator_traits<ForwardIterator>::difference_type n
|
||||
) const
|
||||
{
|
||||
return std::advance(x, n);
|
||||
}
|
||||
};
|
||||
|
||||
// A PolymorphicFunctionObject wrapping std::prior
|
||||
struct prior
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename BidirectionalIterator>
|
||||
struct result<This(BidirectionalIterator)>
|
||||
{
|
||||
typedef
|
||||
typename boost::remove_const<
|
||||
typename boost::remove_reference<BidirectionalIterator>::type
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename This, typename BidirectionalIterator, typename Distance>
|
||||
struct result<This(BidirectionalIterator, Distance)>
|
||||
{
|
||||
typedef
|
||||
typename boost::remove_const<
|
||||
typename boost::remove_reference<BidirectionalIterator>::type
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename BidirectionalIterator>
|
||||
BidirectionalIterator operator()(BidirectionalIterator x) const
|
||||
{
|
||||
return std::advance(
|
||||
x
|
||||
, -static_cast<typename std::iterator_traits<BidirectionalIterator>::difference_type>(1)
|
||||
);
|
||||
}
|
||||
|
||||
template<typename BidirectionalIterator>
|
||||
BidirectionalIterator operator()(
|
||||
BidirectionalIterator x
|
||||
, typename std::iterator_traits<BidirectionalIterator>::difference_type n
|
||||
) const
|
||||
{
|
||||
return std::advance(x, -n);
|
||||
}
|
||||
};
|
||||
|
||||
}}}
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,137 @@
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
/// \file utility.hpp
|
||||
/// Proto callables for things found in the std \<utility\> header
|
||||
//
|
||||
// Copyright 2010 Eric Niebler. Distributed under the Boost
|
||||
// Software License, Version 1.0. (See accompanying file
|
||||
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
|
||||
#ifndef BOOST_PROTO_FUNCTIONAL_STD_UTILITY_HPP_EAN_11_27_2010
|
||||
#define BOOST_PROTO_FUNCTIONAL_STD_UTILITY_HPP_EAN_11_27_2010
|
||||
|
||||
#include <utility>
|
||||
#include <boost/type_traits/remove_const.hpp>
|
||||
#include <boost/type_traits/remove_reference.hpp>
|
||||
#include <boost/proto/proto_fwd.hpp>
|
||||
|
||||
namespace boost { namespace proto { namespace functional
|
||||
{
|
||||
/// \brief A PolymorphicFunctionObject type that invokes the
|
||||
/// \c std::make_pair() algorithm on its arguments.
|
||||
///
|
||||
/// A PolymorphicFunctionObject type that invokes the
|
||||
/// \c std::make_pair() algorithm on its arguments.
|
||||
struct make_pair
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename First, typename Second>
|
||||
struct result<This(First, Second)>
|
||||
{
|
||||
typedef
|
||||
std::pair<
|
||||
typename remove_const<typename remove_reference<First>::type>::type
|
||||
, typename remove_const<typename remove_reference<Second>::type>::type
|
||||
>
|
||||
type;
|
||||
};
|
||||
|
||||
template<typename First, typename Second>
|
||||
std::pair<First, Second> operator()(First const &first, Second const &second) const
|
||||
{
|
||||
return std::make_pair(first, second);
|
||||
}
|
||||
};
|
||||
|
||||
/// \brief A PolymorphicFunctionObject type that returns
|
||||
/// the first element of a std::pair.
|
||||
///
|
||||
/// A PolymorphicFunctionObject type that returns
|
||||
/// the first element of a std::pair..
|
||||
struct first
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair)>
|
||||
{
|
||||
typedef typename Pair::first_type type;
|
||||
};
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair &)>
|
||||
{
|
||||
typedef typename Pair::first_type &type;
|
||||
};
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair const &)>
|
||||
{
|
||||
typedef typename Pair::first_type const &type;
|
||||
};
|
||||
|
||||
template<typename Pair>
|
||||
typename Pair::first_type &operator()(Pair &pair) const
|
||||
{
|
||||
return pair.first;
|
||||
}
|
||||
|
||||
template<typename Pair>
|
||||
typename Pair::first_type const &operator()(Pair const &pair) const
|
||||
{
|
||||
return pair.first;
|
||||
}
|
||||
};
|
||||
|
||||
/// \brief A PolymorphicFunctionObject type that returns
|
||||
/// the second element of a std::pair.
|
||||
///
|
||||
/// A PolymorphicFunctionObject type that returns
|
||||
/// the second element of a std::pair..
|
||||
struct second
|
||||
{
|
||||
BOOST_PROTO_CALLABLE()
|
||||
|
||||
template<typename Sig>
|
||||
struct result;
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair)>
|
||||
{
|
||||
typedef typename Pair::second_type type;
|
||||
};
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair &)>
|
||||
{
|
||||
typedef typename Pair::second_type &type;
|
||||
};
|
||||
|
||||
template<typename This, typename Pair>
|
||||
struct result<This(Pair const &)>
|
||||
{
|
||||
typedef typename Pair::second_type const &type;
|
||||
};
|
||||
|
||||
template<typename Pair>
|
||||
typename Pair::second_type &operator()(Pair &pair) const
|
||||
{
|
||||
return pair.second;
|
||||
}
|
||||
|
||||
template<typename Pair>
|
||||
typename Pair::second_type const &operator()(Pair const &pair) const
|
||||
{
|
||||
return pair.second;
|
||||
}
|
||||
};
|
||||
|
||||
}}}
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user