1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/ossrv_pub/boost_apis/boost/bind.hpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,1651 @@
1.4 +#ifndef BOOST_BIND_HPP_INCLUDED
1.5 +#define BOOST_BIND_HPP_INCLUDED
1.6 +
1.7 +// MS compatible compilers support #pragma once
1.8 +
1.9 +#if defined(_MSC_VER) && (_MSC_VER >= 1020)
1.10 +# pragma once
1.11 +#endif
1.12 +
1.13 +//
1.14 +// bind.hpp - binds function objects to arguments
1.15 +//
1.16 +// Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd.
1.17 +// Copyright (c) 2001 David Abrahams
1.18 +// Copyright (c) 2005 Peter Dimov
1.19 +//
1.20 +// Distributed under the Boost Software License, Version 1.0. (See
1.21 +// accompanying file LICENSE_1_0.txt or copy at
1.22 +// http://www.boost.org/LICENSE_1_0.txt)
1.23 +//
1.24 +// See http://www.boost.org/libs/bind/bind.html for documentation.
1.25 +//
1.26 +
1.27 +#include <boost/config.hpp>
1.28 +#include <boost/ref.hpp>
1.29 +#include <boost/mem_fn.hpp>
1.30 +#include <boost/type.hpp>
1.31 +#include <boost/bind/arg.hpp>
1.32 +#include <boost/detail/workaround.hpp>
1.33 +#include <boost/visit_each.hpp>
1.34 +
1.35 +// Borland-specific bug, visit_each() silently fails to produce code
1.36 +
1.37 +#if defined(__BORLANDC__)
1.38 +# define BOOST_BIND_VISIT_EACH boost::visit_each
1.39 +#else
1.40 +# define BOOST_BIND_VISIT_EACH visit_each
1.41 +#endif
1.42 +
1.43 +#include <boost/bind/storage.hpp>
1.44 +
1.45 +#ifdef BOOST_MSVC
1.46 +# pragma warning(push)
1.47 +# pragma warning(disable: 4512) // assignment operator could not be generated
1.48 +#endif
1.49 +
1.50 +namespace boost
1.51 +{
1.52 +
1.53 +namespace _bi // implementation details
1.54 +{
1.55 +
1.56 +// result_traits
1.57 +
1.58 +template<class R, class F> struct result_traits
1.59 +{
1.60 + typedef R type;
1.61 +};
1.62 +
1.63 +#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
1.64 +
1.65 +struct unspecified {};
1.66 +
1.67 +template<class F> struct result_traits<unspecified, F>
1.68 +{
1.69 + typedef typename F::result_type type;
1.70 +};
1.71 +
1.72 +template<class F> struct result_traits< unspecified, reference_wrapper<F> >
1.73 +{
1.74 + typedef typename F::result_type type;
1.75 +};
1.76 +
1.77 +#endif
1.78 +
1.79 +// ref_compare
1.80 +
1.81 +template<class T> bool ref_compare( T const & a, T const & b, long )
1.82 +{
1.83 + return a == b;
1.84 +}
1.85 +
1.86 +template<int I> bool ref_compare( arg<I> const &, arg<I> const &, int )
1.87 +{
1.88 + return true;
1.89 +}
1.90 +
1.91 +template<int I> bool ref_compare( arg<I> (*) (), arg<I> (*) (), int )
1.92 +{
1.93 + return true;
1.94 +}
1.95 +
1.96 +template<class T> bool ref_compare( reference_wrapper<T> const & a, reference_wrapper<T> const & b, int )
1.97 +{
1.98 + return a.get_pointer() == b.get_pointer();
1.99 +}
1.100 +
1.101 +// bind_t forward declaration for listN
1.102 +
1.103 +template<class R, class F, class L> class bind_t;
1.104 +
1.105 +// value
1.106 +
1.107 +template<class T> class value
1.108 +{
1.109 +public:
1.110 +
1.111 + value(T const & t): t_(t) {}
1.112 +
1.113 + T & get() { return t_; }
1.114 + T const & get() const { return t_; }
1.115 +
1.116 + bool operator==(value const & rhs) const
1.117 + {
1.118 + return t_ == rhs.t_;
1.119 + }
1.120 +
1.121 +private:
1.122 +
1.123 + T t_;
1.124 +};
1.125 +
1.126 +// type
1.127 +
1.128 +template<class T> class type {};
1.129 +
1.130 +// unwrap
1.131 +
1.132 +template<class F> struct unwrapper
1.133 +{
1.134 + static inline F & unwrap( F & f, long )
1.135 + {
1.136 + return f;
1.137 + }
1.138 +
1.139 + template<class F2> static inline F2 & unwrap( reference_wrapper<F2> rf, int )
1.140 + {
1.141 + return rf.get();
1.142 + }
1.143 +
1.144 + template<class R, class T> static inline _mfi::dm<R, T> unwrap( R T::* pm, int )
1.145 + {
1.146 + return _mfi::dm<R, T>( pm );
1.147 + }
1.148 +};
1.149 +
1.150 +// listN
1.151 +
1.152 +class list0
1.153 +{
1.154 +public:
1.155 +
1.156 + list0() {}
1.157 +
1.158 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.159 +
1.160 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.161 +
1.162 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.163 +
1.164 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.165 +
1.166 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.167 +
1.168 + template<class R, class F, class A> R operator()(type<R>, F & f, A &, long)
1.169 + {
1.170 + return unwrapper<F>::unwrap(f, 0)();
1.171 + }
1.172 +
1.173 + template<class R, class F, class A> R operator()(type<R>, F const & f, A &, long) const
1.174 + {
1.175 + return unwrapper<F const>::unwrap(f, 0)();
1.176 + }
1.177 +
1.178 + template<class F, class A> void operator()(type<void>, F & f, A &, int)
1.179 + {
1.180 + unwrapper<F>::unwrap(f, 0)();
1.181 + }
1.182 +
1.183 + template<class F, class A> void operator()(type<void>, F const & f, A &, int) const
1.184 + {
1.185 + unwrapper<F const>::unwrap(f, 0)();
1.186 + }
1.187 +
1.188 + template<class V> void accept(V &) const
1.189 + {
1.190 + }
1.191 +
1.192 + bool operator==(list0 const &) const
1.193 + {
1.194 + return true;
1.195 + }
1.196 +};
1.197 +
1.198 +template< class A1 > class list1: private storage1< A1 >
1.199 +{
1.200 +private:
1.201 +
1.202 + typedef storage1< A1 > base_type;
1.203 +
1.204 +public:
1.205 +
1.206 + explicit list1( A1 a1 ): base_type( a1 ) {}
1.207 +
1.208 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.209 +
1.210 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.211 +
1.212 + template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
1.213 +
1.214 + template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
1.215 +
1.216 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.217 +
1.218 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.219 +
1.220 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.221 +
1.222 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.223 + {
1.224 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_]);
1.225 + }
1.226 +
1.227 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.228 + {
1.229 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_]);
1.230 + }
1.231 +
1.232 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.233 + {
1.234 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_]);
1.235 + }
1.236 +
1.237 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.238 + {
1.239 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_]);
1.240 + }
1.241 +
1.242 + template<class V> void accept(V & v) const
1.243 + {
1.244 + base_type::accept(v);
1.245 + }
1.246 +
1.247 + bool operator==(list1 const & rhs) const
1.248 + {
1.249 + return ref_compare(base_type::a1_, rhs.a1_, 0);
1.250 + }
1.251 +};
1.252 +
1.253 +template< class A1, class A2 > class list2: private storage2< A1, A2 >
1.254 +{
1.255 +private:
1.256 +
1.257 + typedef storage2< A1, A2 > base_type;
1.258 +
1.259 +public:
1.260 +
1.261 + list2( A1 a1, A2 a2 ): base_type( a1, a2 ) {}
1.262 +
1.263 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.264 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.265 +
1.266 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.267 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.268 +
1.269 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.270 +
1.271 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.272 +
1.273 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.274 +
1.275 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.276 +
1.277 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.278 +
1.279 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.280 + {
1.281 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
1.282 + }
1.283 +
1.284 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.285 + {
1.286 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
1.287 + }
1.288 +
1.289 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.290 + {
1.291 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
1.292 + }
1.293 +
1.294 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.295 + {
1.296 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
1.297 + }
1.298 +
1.299 + template<class V> void accept(V & v) const
1.300 + {
1.301 + base_type::accept(v);
1.302 + }
1.303 +
1.304 + bool operator==(list2 const & rhs) const
1.305 + {
1.306 + return ref_compare(base_type::a1_, rhs.a1_, 0) && ref_compare(base_type::a2_, rhs.a2_, 0);
1.307 + }
1.308 +};
1.309 +
1.310 +template< class A1, class A2, class A3 > class list3: private storage3< A1, A2, A3 >
1.311 +{
1.312 +private:
1.313 +
1.314 + typedef storage3< A1, A2, A3 > base_type;
1.315 +
1.316 +public:
1.317 +
1.318 + list3( A1 a1, A2 a2, A3 a3 ): base_type( a1, a2, a3 ) {}
1.319 +
1.320 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.321 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.322 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.323 +
1.324 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.325 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.326 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.327 +
1.328 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.329 +
1.330 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.331 +
1.332 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.333 +
1.334 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.335 +
1.336 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.337 +
1.338 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.339 + {
1.340 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
1.341 + }
1.342 +
1.343 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.344 + {
1.345 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
1.346 + }
1.347 +
1.348 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.349 + {
1.350 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
1.351 + }
1.352 +
1.353 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.354 + {
1.355 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
1.356 + }
1.357 +
1.358 + template<class V> void accept(V & v) const
1.359 + {
1.360 + base_type::accept(v);
1.361 + }
1.362 +
1.363 + bool operator==(list3 const & rhs) const
1.364 + {
1.365 + return
1.366 +
1.367 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.368 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.369 + ref_compare( base_type::a3_, rhs.a3_, 0 );
1.370 + }
1.371 +};
1.372 +
1.373 +template< class A1, class A2, class A3, class A4 > class list4: private storage4< A1, A2, A3, A4 >
1.374 +{
1.375 +private:
1.376 +
1.377 + typedef storage4< A1, A2, A3, A4 > base_type;
1.378 +
1.379 +public:
1.380 +
1.381 + list4( A1 a1, A2 a2, A3 a3, A4 a4 ): base_type( a1, a2, a3, a4 ) {}
1.382 +
1.383 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.384 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.385 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.386 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.387 +
1.388 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.389 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.390 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.391 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.392 +
1.393 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.394 +
1.395 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.396 +
1.397 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.398 +
1.399 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.400 +
1.401 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.402 +
1.403 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.404 + {
1.405 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
1.406 + }
1.407 +
1.408 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.409 + {
1.410 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
1.411 + }
1.412 +
1.413 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.414 + {
1.415 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
1.416 + }
1.417 +
1.418 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.419 + {
1.420 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
1.421 + }
1.422 +
1.423 + template<class V> void accept(V & v) const
1.424 + {
1.425 + base_type::accept(v);
1.426 + }
1.427 +
1.428 + bool operator==(list4 const & rhs) const
1.429 + {
1.430 + return
1.431 +
1.432 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.433 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.434 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.435 + ref_compare( base_type::a4_, rhs.a4_, 0 );
1.436 + }
1.437 +};
1.438 +
1.439 +template< class A1, class A2, class A3, class A4, class A5 > class list5: private storage5< A1, A2, A3, A4, A5 >
1.440 +{
1.441 +private:
1.442 +
1.443 + typedef storage5< A1, A2, A3, A4, A5 > base_type;
1.444 +
1.445 +public:
1.446 +
1.447 + list5( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5 ): base_type( a1, a2, a3, a4, a5 ) {}
1.448 +
1.449 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.450 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.451 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.452 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.453 + A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
1.454 +
1.455 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.456 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.457 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.458 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.459 + A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
1.460 +
1.461 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.462 +
1.463 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.464 +
1.465 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.466 +
1.467 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.468 +
1.469 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.470 +
1.471 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.472 + {
1.473 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
1.474 + }
1.475 +
1.476 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.477 + {
1.478 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
1.479 + }
1.480 +
1.481 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.482 + {
1.483 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
1.484 + }
1.485 +
1.486 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.487 + {
1.488 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
1.489 + }
1.490 +
1.491 + template<class V> void accept(V & v) const
1.492 + {
1.493 + base_type::accept(v);
1.494 + }
1.495 +
1.496 + bool operator==(list5 const & rhs) const
1.497 + {
1.498 + return
1.499 +
1.500 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.501 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.502 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.503 + ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
1.504 + ref_compare( base_type::a5_, rhs.a5_, 0 );
1.505 + }
1.506 +};
1.507 +
1.508 +template<class A1, class A2, class A3, class A4, class A5, class A6> class list6: private storage6< A1, A2, A3, A4, A5, A6 >
1.509 +{
1.510 +private:
1.511 +
1.512 + typedef storage6< A1, A2, A3, A4, A5, A6 > base_type;
1.513 +
1.514 +public:
1.515 +
1.516 + list6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6 ): base_type( a1, a2, a3, a4, a5, a6 ) {}
1.517 +
1.518 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.519 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.520 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.521 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.522 + A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
1.523 + A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
1.524 +
1.525 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.526 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.527 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.528 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.529 + A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
1.530 + A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
1.531 +
1.532 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.533 +
1.534 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.535 +
1.536 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.537 +
1.538 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.539 +
1.540 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.541 +
1.542 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.543 + {
1.544 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
1.545 + }
1.546 +
1.547 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.548 + {
1.549 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
1.550 + }
1.551 +
1.552 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.553 + {
1.554 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
1.555 + }
1.556 +
1.557 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.558 + {
1.559 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
1.560 + }
1.561 +
1.562 + template<class V> void accept(V & v) const
1.563 + {
1.564 + base_type::accept(v);
1.565 + }
1.566 +
1.567 + bool operator==(list6 const & rhs) const
1.568 + {
1.569 + return
1.570 +
1.571 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.572 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.573 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.574 + ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
1.575 + ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
1.576 + ref_compare( base_type::a6_, rhs.a6_, 0 );
1.577 + }
1.578 +};
1.579 +
1.580 +template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> class list7: private storage7< A1, A2, A3, A4, A5, A6, A7 >
1.581 +{
1.582 +private:
1.583 +
1.584 + typedef storage7< A1, A2, A3, A4, A5, A6, A7 > base_type;
1.585 +
1.586 +public:
1.587 +
1.588 + list7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7 ): base_type( a1, a2, a3, a4, a5, a6, a7 ) {}
1.589 +
1.590 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.591 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.592 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.593 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.594 + A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
1.595 + A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
1.596 + A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
1.597 +
1.598 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.599 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.600 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.601 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.602 + A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
1.603 + A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
1.604 + A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
1.605 +
1.606 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.607 +
1.608 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.609 +
1.610 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.611 +
1.612 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.613 +
1.614 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.615 +
1.616 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.617 + {
1.618 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
1.619 + }
1.620 +
1.621 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.622 + {
1.623 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
1.624 + }
1.625 +
1.626 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.627 + {
1.628 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
1.629 + }
1.630 +
1.631 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.632 + {
1.633 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
1.634 + }
1.635 +
1.636 + template<class V> void accept(V & v) const
1.637 + {
1.638 + base_type::accept(v);
1.639 + }
1.640 +
1.641 + bool operator==(list7 const & rhs) const
1.642 + {
1.643 + return
1.644 +
1.645 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.646 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.647 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.648 + ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
1.649 + ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
1.650 + ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
1.651 + ref_compare( base_type::a7_, rhs.a7_, 0 );
1.652 + }
1.653 +};
1.654 +
1.655 +template< class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8 > class list8: private storage8< A1, A2, A3, A4, A5, A6, A7, A8 >
1.656 +{
1.657 +private:
1.658 +
1.659 + typedef storage8< A1, A2, A3, A4, A5, A6, A7, A8 > base_type;
1.660 +
1.661 +public:
1.662 +
1.663 + list8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8 ) {}
1.664 +
1.665 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.666 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.667 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.668 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.669 + A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
1.670 + A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
1.671 + A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
1.672 + A8 operator[] (boost::arg<8>) const { return base_type::a8_; }
1.673 +
1.674 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.675 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.676 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.677 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.678 + A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
1.679 + A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
1.680 + A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
1.681 + A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; }
1.682 +
1.683 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.684 +
1.685 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.686 +
1.687 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.688 +
1.689 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.690 +
1.691 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.692 +
1.693 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.694 + {
1.695 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
1.696 + }
1.697 +
1.698 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.699 + {
1.700 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
1.701 + }
1.702 +
1.703 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.704 + {
1.705 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
1.706 + }
1.707 +
1.708 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.709 + {
1.710 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
1.711 + }
1.712 +
1.713 + template<class V> void accept(V & v) const
1.714 + {
1.715 + base_type::accept(v);
1.716 + }
1.717 +
1.718 + bool operator==(list8 const & rhs) const
1.719 + {
1.720 + return
1.721 +
1.722 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.723 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.724 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.725 + ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
1.726 + ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
1.727 + ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
1.728 + ref_compare( base_type::a7_, rhs.a7_, 0 ) &&
1.729 + ref_compare( base_type::a8_, rhs.a8_, 0 );
1.730 + }
1.731 +};
1.732 +
1.733 +template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> class list9: private storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 >
1.734 +{
1.735 +private:
1.736 +
1.737 + typedef storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > base_type;
1.738 +
1.739 +public:
1.740 +
1.741 + list9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8, a9 ) {}
1.742 +
1.743 + A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
1.744 + A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
1.745 + A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
1.746 + A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
1.747 + A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
1.748 + A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
1.749 + A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
1.750 + A8 operator[] (boost::arg<8>) const { return base_type::a8_; }
1.751 + A9 operator[] (boost::arg<9>) const { return base_type::a9_; }
1.752 +
1.753 + A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
1.754 + A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
1.755 + A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
1.756 + A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
1.757 + A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
1.758 + A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
1.759 + A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
1.760 + A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; }
1.761 + A9 operator[] (boost::arg<9> (*) ()) const { return base_type::a9_; }
1.762 +
1.763 + template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
1.764 +
1.765 + template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
1.766 +
1.767 + template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
1.768 +
1.769 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
1.770 +
1.771 + template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
1.772 +
1.773 + template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
1.774 + {
1.775 + return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
1.776 + }
1.777 +
1.778 + template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
1.779 + {
1.780 + return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
1.781 + }
1.782 +
1.783 + template<class F, class A> void operator()(type<void>, F & f, A & a, int)
1.784 + {
1.785 + unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
1.786 + }
1.787 +
1.788 + template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
1.789 + {
1.790 + unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
1.791 + }
1.792 +
1.793 + template<class V> void accept(V & v) const
1.794 + {
1.795 + base_type::accept(v);
1.796 + }
1.797 +
1.798 + bool operator==(list9 const & rhs) const
1.799 + {
1.800 + return
1.801 +
1.802 + ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
1.803 + ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
1.804 + ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
1.805 + ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
1.806 + ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
1.807 + ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
1.808 + ref_compare( base_type::a7_, rhs.a7_, 0 ) &&
1.809 + ref_compare( base_type::a8_, rhs.a8_, 0 ) &&
1.810 + ref_compare( base_type::a9_, rhs.a9_, 0 );
1.811 + }
1.812 +};
1.813 +
1.814 +// bind_t
1.815 +
1.816 +#ifndef BOOST_NO_VOID_RETURNS
1.817 +
1.818 +template<class R, class F, class L> class bind_t
1.819 +{
1.820 +public:
1.821 +
1.822 + typedef bind_t this_type;
1.823 +
1.824 + bind_t(F f, L const & l): f_(f), l_(l) {}
1.825 +
1.826 +#define BOOST_BIND_RETURN return
1.827 +#include <boost/bind/bind_template.hpp>
1.828 +#undef BOOST_BIND_RETURN
1.829 +
1.830 +};
1.831 +
1.832 +#else
1.833 +
1.834 +template<class R> struct bind_t_generator
1.835 +{
1.836 +
1.837 +template<class F, class L> class implementation
1.838 +{
1.839 +public:
1.840 +
1.841 + typedef implementation this_type;
1.842 +
1.843 + implementation(F f, L const & l): f_(f), l_(l) {}
1.844 +
1.845 +#define BOOST_BIND_RETURN return
1.846 +#include <boost/bind/bind_template.hpp>
1.847 +#undef BOOST_BIND_RETURN
1.848 +
1.849 +};
1.850 +
1.851 +};
1.852 +
1.853 +template<> struct bind_t_generator<void>
1.854 +{
1.855 +
1.856 +template<class F, class L> class implementation
1.857 +{
1.858 +private:
1.859 +
1.860 + typedef void R;
1.861 +
1.862 +public:
1.863 +
1.864 + typedef implementation this_type;
1.865 +
1.866 + implementation(F f, L const & l): f_(f), l_(l) {}
1.867 +
1.868 +#define BOOST_BIND_RETURN
1.869 +#include <boost/bind/bind_template.hpp>
1.870 +#undef BOOST_BIND_RETURN
1.871 +
1.872 +};
1.873 +
1.874 +};
1.875 +
1.876 +template<class R2, class F, class L> class bind_t: public bind_t_generator<R2>::BOOST_NESTED_TEMPLATE implementation<F, L>
1.877 +{
1.878 +public:
1.879 +
1.880 + bind_t(F f, L const & l): bind_t_generator<R2>::BOOST_NESTED_TEMPLATE implementation<F, L>(f, l) {}
1.881 +
1.882 +};
1.883 +
1.884 +#endif
1.885 +
1.886 +// function_equal
1.887 +
1.888 +#ifndef BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
1.889 +
1.890 +// put overloads in _bi, rely on ADL
1.891 +
1.892 +# ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
1.893 +
1.894 +template<class R, class F, class L> bool function_equal( bind_t<R, F, L> const & a, bind_t<R, F, L> const & b )
1.895 +{
1.896 + return a.compare(b);
1.897 +}
1.898 +
1.899 +# else
1.900 +
1.901 +template<class R, class F, class L> bool function_equal_impl( bind_t<R, F, L> const & a, bind_t<R, F, L> const & b, int )
1.902 +{
1.903 + return a.compare(b);
1.904 +}
1.905 +
1.906 +# endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
1.907 +
1.908 +#else // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
1.909 +
1.910 +// put overloads in boost
1.911 +
1.912 +} // namespace _bi
1.913 +
1.914 +# ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
1.915 +
1.916 +template<class R, class F, class L> bool function_equal( _bi::bind_t<R, F, L> const & a, _bi::bind_t<R, F, L> const & b )
1.917 +{
1.918 + return a.compare(b);
1.919 +}
1.920 +
1.921 +# else
1.922 +
1.923 +template<class R, class F, class L> bool function_equal_impl( _bi::bind_t<R, F, L> const & a, _bi::bind_t<R, F, L> const & b, int )
1.924 +{
1.925 + return a.compare(b);
1.926 +}
1.927 +
1.928 +# endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
1.929 +
1.930 +namespace _bi
1.931 +{
1.932 +
1.933 +#endif // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
1.934 +
1.935 +// add_value
1.936 +
1.937 +#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || (__SUNPRO_CC >= 0x530)
1.938 +
1.939 +template<class T> struct add_value
1.940 +{
1.941 + typedef _bi::value<T> type;
1.942 +};
1.943 +
1.944 +template<class T> struct add_value< value<T> >
1.945 +{
1.946 + typedef _bi::value<T> type;
1.947 +};
1.948 +
1.949 +template<class T> struct add_value< reference_wrapper<T> >
1.950 +{
1.951 + typedef reference_wrapper<T> type;
1.952 +};
1.953 +
1.954 +template<int I> struct add_value< arg<I> >
1.955 +{
1.956 + typedef boost::arg<I> type;
1.957 +};
1.958 +
1.959 +template<int I> struct add_value< arg<I> (*) () >
1.960 +{
1.961 + typedef boost::arg<I> (*type) ();
1.962 +};
1.963 +
1.964 +template<class R, class F, class L> struct add_value< bind_t<R, F, L> >
1.965 +{
1.966 + typedef bind_t<R, F, L> type;
1.967 +};
1.968 +
1.969 +#else
1.970 +
1.971 +template<int I> struct _avt_0;
1.972 +
1.973 +template<> struct _avt_0<1>
1.974 +{
1.975 + template<class T> struct inner
1.976 + {
1.977 + typedef T type;
1.978 + };
1.979 +};
1.980 +
1.981 +template<> struct _avt_0<2>
1.982 +{
1.983 + template<class T> struct inner
1.984 + {
1.985 + typedef value<T> type;
1.986 + };
1.987 +};
1.988 +
1.989 +typedef char (&_avt_r1) [1];
1.990 +typedef char (&_avt_r2) [2];
1.991 +
1.992 +template<class T> _avt_r1 _avt_f(value<T>);
1.993 +template<class T> _avt_r1 _avt_f(reference_wrapper<T>);
1.994 +template<int I> _avt_r1 _avt_f(arg<I>);
1.995 +template<int I> _avt_r1 _avt_f(arg<I> (*) ());
1.996 +template<class R, class F, class L> _avt_r1 _avt_f(bind_t<R, F, L>);
1.997 +
1.998 +_avt_r2 _avt_f(...);
1.999 +
1.1000 +template<class T> struct add_value
1.1001 +{
1.1002 + static T t();
1.1003 + typedef typename _avt_0<sizeof(_avt_f(t()))>::template inner<T>::type type;
1.1004 +};
1.1005 +
1.1006 +#endif
1.1007 +
1.1008 +// list_av_N
1.1009 +
1.1010 +template<class A1> struct list_av_1
1.1011 +{
1.1012 + typedef typename add_value<A1>::type B1;
1.1013 + typedef list1<B1> type;
1.1014 +};
1.1015 +
1.1016 +template<class A1, class A2> struct list_av_2
1.1017 +{
1.1018 + typedef typename add_value<A1>::type B1;
1.1019 + typedef typename add_value<A2>::type B2;
1.1020 + typedef list2<B1, B2> type;
1.1021 +};
1.1022 +
1.1023 +template<class A1, class A2, class A3> struct list_av_3
1.1024 +{
1.1025 + typedef typename add_value<A1>::type B1;
1.1026 + typedef typename add_value<A2>::type B2;
1.1027 + typedef typename add_value<A3>::type B3;
1.1028 + typedef list3<B1, B2, B3> type;
1.1029 +};
1.1030 +
1.1031 +template<class A1, class A2, class A3, class A4> struct list_av_4
1.1032 +{
1.1033 + typedef typename add_value<A1>::type B1;
1.1034 + typedef typename add_value<A2>::type B2;
1.1035 + typedef typename add_value<A3>::type B3;
1.1036 + typedef typename add_value<A4>::type B4;
1.1037 + typedef list4<B1, B2, B3, B4> type;
1.1038 +};
1.1039 +
1.1040 +template<class A1, class A2, class A3, class A4, class A5> struct list_av_5
1.1041 +{
1.1042 + typedef typename add_value<A1>::type B1;
1.1043 + typedef typename add_value<A2>::type B2;
1.1044 + typedef typename add_value<A3>::type B3;
1.1045 + typedef typename add_value<A4>::type B4;
1.1046 + typedef typename add_value<A5>::type B5;
1.1047 + typedef list5<B1, B2, B3, B4, B5> type;
1.1048 +};
1.1049 +
1.1050 +template<class A1, class A2, class A3, class A4, class A5, class A6> struct list_av_6
1.1051 +{
1.1052 + typedef typename add_value<A1>::type B1;
1.1053 + typedef typename add_value<A2>::type B2;
1.1054 + typedef typename add_value<A3>::type B3;
1.1055 + typedef typename add_value<A4>::type B4;
1.1056 + typedef typename add_value<A5>::type B5;
1.1057 + typedef typename add_value<A6>::type B6;
1.1058 + typedef list6<B1, B2, B3, B4, B5, B6> type;
1.1059 +};
1.1060 +
1.1061 +template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> struct list_av_7
1.1062 +{
1.1063 + typedef typename add_value<A1>::type B1;
1.1064 + typedef typename add_value<A2>::type B2;
1.1065 + typedef typename add_value<A3>::type B3;
1.1066 + typedef typename add_value<A4>::type B4;
1.1067 + typedef typename add_value<A5>::type B5;
1.1068 + typedef typename add_value<A6>::type B6;
1.1069 + typedef typename add_value<A7>::type B7;
1.1070 + typedef list7<B1, B2, B3, B4, B5, B6, B7> type;
1.1071 +};
1.1072 +
1.1073 +template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> struct list_av_8
1.1074 +{
1.1075 + typedef typename add_value<A1>::type B1;
1.1076 + typedef typename add_value<A2>::type B2;
1.1077 + typedef typename add_value<A3>::type B3;
1.1078 + typedef typename add_value<A4>::type B4;
1.1079 + typedef typename add_value<A5>::type B5;
1.1080 + typedef typename add_value<A6>::type B6;
1.1081 + typedef typename add_value<A7>::type B7;
1.1082 + typedef typename add_value<A8>::type B8;
1.1083 + typedef list8<B1, B2, B3, B4, B5, B6, B7, B8> type;
1.1084 +};
1.1085 +
1.1086 +template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> struct list_av_9
1.1087 +{
1.1088 + typedef typename add_value<A1>::type B1;
1.1089 + typedef typename add_value<A2>::type B2;
1.1090 + typedef typename add_value<A3>::type B3;
1.1091 + typedef typename add_value<A4>::type B4;
1.1092 + typedef typename add_value<A5>::type B5;
1.1093 + typedef typename add_value<A6>::type B6;
1.1094 + typedef typename add_value<A7>::type B7;
1.1095 + typedef typename add_value<A8>::type B8;
1.1096 + typedef typename add_value<A9>::type B9;
1.1097 + typedef list9<B1, B2, B3, B4, B5, B6, B7, B8, B9> type;
1.1098 +};
1.1099 +
1.1100 +// operator!
1.1101 +
1.1102 +struct logical_not
1.1103 +{
1.1104 + template<class V> bool operator()(V const & v) const { return !v; }
1.1105 +};
1.1106 +
1.1107 +template<class R, class F, class L>
1.1108 + bind_t< bool, logical_not, list1< bind_t<R, F, L> > >
1.1109 + operator! (bind_t<R, F, L> const & f)
1.1110 +{
1.1111 + typedef list1< bind_t<R, F, L> > list_type;
1.1112 + return bind_t<bool, logical_not, list_type> ( logical_not(), list_type(f) );
1.1113 +}
1.1114 +
1.1115 +// relational operators
1.1116 +
1.1117 +#define BOOST_BIND_OPERATOR( op, name ) \
1.1118 +\
1.1119 +struct name \
1.1120 +{ \
1.1121 + template<class V, class W> bool operator()(V const & v, W const & w) const { return v op w; } \
1.1122 +}; \
1.1123 + \
1.1124 +template<class R, class F, class L, class A2> \
1.1125 + bind_t< bool, name, list2< bind_t<R, F, L>, typename add_value<A2>::type > > \
1.1126 + operator op (bind_t<R, F, L> const & f, A2 a2) \
1.1127 +{ \
1.1128 + typedef typename add_value<A2>::type B2; \
1.1129 + typedef list2< bind_t<R, F, L>, B2> list_type; \
1.1130 + return bind_t<bool, name, list_type> ( name(), list_type(f, a2) ); \
1.1131 +}
1.1132 +
1.1133 +BOOST_BIND_OPERATOR( ==, equal )
1.1134 +BOOST_BIND_OPERATOR( !=, not_equal )
1.1135 +
1.1136 +BOOST_BIND_OPERATOR( <, less )
1.1137 +BOOST_BIND_OPERATOR( <=, less_equal )
1.1138 +
1.1139 +BOOST_BIND_OPERATOR( >, greater )
1.1140 +BOOST_BIND_OPERATOR( >=, greater_equal )
1.1141 +
1.1142 +#undef BOOST_BIND_OPERATOR
1.1143 +
1.1144 +#if defined(__GNUC__) && BOOST_WORKAROUND(__GNUC__, < 3)
1.1145 +
1.1146 +// resolve ambiguity with rel_ops
1.1147 +
1.1148 +#define BOOST_BIND_OPERATOR( op, name ) \
1.1149 +\
1.1150 +template<class R, class F, class L> \
1.1151 + bind_t< bool, name, list2< bind_t<R, F, L>, bind_t<R, F, L> > > \
1.1152 + operator op (bind_t<R, F, L> const & f, bind_t<R, F, L> const & g) \
1.1153 +{ \
1.1154 + typedef list2< bind_t<R, F, L>, bind_t<R, F, L> > list_type; \
1.1155 + return bind_t<bool, name, list_type> ( name(), list_type(f, g) ); \
1.1156 +}
1.1157 +
1.1158 +BOOST_BIND_OPERATOR( !=, not_equal )
1.1159 +BOOST_BIND_OPERATOR( <=, less_equal )
1.1160 +BOOST_BIND_OPERATOR( >, greater )
1.1161 +BOOST_BIND_OPERATOR( >=, greater_equal )
1.1162 +
1.1163 +#endif
1.1164 +
1.1165 +// visit_each, ADL
1.1166 +
1.1167 +#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( __BORLANDC__ ) \
1.1168 + && !(defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
1.1169 +
1.1170 +template<class V, class T> void visit_each( V & v, value<T> const & t, int )
1.1171 +{
1.1172 + using boost::visit_each;
1.1173 + BOOST_BIND_VISIT_EACH( v, t.get(), 0 );
1.1174 +}
1.1175 +
1.1176 +template<class V, class R, class F, class L> void visit_each( V & v, bind_t<R, F, L> const & t, int )
1.1177 +{
1.1178 + t.accept( v );
1.1179 +}
1.1180 +
1.1181 +#endif
1.1182 +
1.1183 +} // namespace _bi
1.1184 +
1.1185 +// visit_each, no ADL
1.1186 +
1.1187 +#if defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) || defined( __BORLANDC__ ) \
1.1188 + || (defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
1.1189 +
1.1190 +template<class V, class T> void visit_each( V & v, _bi::value<T> const & t, int )
1.1191 +{
1.1192 + BOOST_BIND_VISIT_EACH( v, t.get(), 0 );
1.1193 +}
1.1194 +
1.1195 +template<class V, class R, class F, class L> void visit_each( V & v, _bi::bind_t<R, F, L> const & t, int )
1.1196 +{
1.1197 + t.accept( v );
1.1198 +}
1.1199 +
1.1200 +#endif
1.1201 +
1.1202 +// bind
1.1203 +
1.1204 +#ifndef BOOST_BIND
1.1205 +#define BOOST_BIND bind
1.1206 +#endif
1.1207 +
1.1208 +// generic function objects
1.1209 +
1.1210 +template<class R, class F>
1.1211 + _bi::bind_t<R, F, _bi::list0>
1.1212 + BOOST_BIND(F f)
1.1213 +{
1.1214 + typedef _bi::list0 list_type;
1.1215 + return _bi::bind_t<R, F, list_type> (f, list_type());
1.1216 +}
1.1217 +
1.1218 +template<class R, class F, class A1>
1.1219 + _bi::bind_t<R, F, typename _bi::list_av_1<A1>::type>
1.1220 + BOOST_BIND(F f, A1 a1)
1.1221 +{
1.1222 + typedef typename _bi::list_av_1<A1>::type list_type;
1.1223 + return _bi::bind_t<R, F, list_type> (f, list_type(a1));
1.1224 +}
1.1225 +
1.1226 +template<class R, class F, class A1, class A2>
1.1227 + _bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type>
1.1228 + BOOST_BIND(F f, A1 a1, A2 a2)
1.1229 +{
1.1230 + typedef typename _bi::list_av_2<A1, A2>::type list_type;
1.1231 + return _bi::bind_t<R, F, list_type> (f, list_type(a1, a2));
1.1232 +}
1.1233 +
1.1234 +template<class R, class F, class A1, class A2, class A3>
1.1235 + _bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type>
1.1236 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3)
1.1237 +{
1.1238 + typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
1.1239 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3));
1.1240 +}
1.1241 +
1.1242 +template<class R, class F, class A1, class A2, class A3, class A4>
1.1243 + _bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
1.1244 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4)
1.1245 +{
1.1246 + typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
1.1247 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4));
1.1248 +}
1.1249 +
1.1250 +template<class R, class F, class A1, class A2, class A3, class A4, class A5>
1.1251 + _bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
1.1252 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
1.1253 +{
1.1254 + typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
1.1255 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
1.1256 +}
1.1257 +
1.1258 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6>
1.1259 + _bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
1.1260 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
1.1261 +{
1.1262 + typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
1.1263 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
1.1264 +}
1.1265 +
1.1266 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
1.1267 + _bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
1.1268 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
1.1269 +{
1.1270 + typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
1.1271 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
1.1272 +}
1.1273 +
1.1274 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
1.1275 + _bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
1.1276 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
1.1277 +{
1.1278 + typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
1.1279 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
1.1280 +}
1.1281 +
1.1282 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
1.1283 + _bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
1.1284 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
1.1285 +{
1.1286 + typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
1.1287 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
1.1288 +}
1.1289 +
1.1290 +// generic function objects, alternative syntax
1.1291 +
1.1292 +template<class R, class F>
1.1293 + _bi::bind_t<R, F, _bi::list0>
1.1294 + BOOST_BIND(boost::type<R>, F f)
1.1295 +{
1.1296 + typedef _bi::list0 list_type;
1.1297 + return _bi::bind_t<R, F, list_type> (f, list_type());
1.1298 +}
1.1299 +
1.1300 +template<class R, class F, class A1>
1.1301 + _bi::bind_t<R, F, typename _bi::list_av_1<A1>::type>
1.1302 + BOOST_BIND(boost::type<R>, F f, A1 a1)
1.1303 +{
1.1304 + typedef typename _bi::list_av_1<A1>::type list_type;
1.1305 + return _bi::bind_t<R, F, list_type> (f, list_type(a1));
1.1306 +}
1.1307 +
1.1308 +template<class R, class F, class A1, class A2>
1.1309 + _bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type>
1.1310 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2)
1.1311 +{
1.1312 + typedef typename _bi::list_av_2<A1, A2>::type list_type;
1.1313 + return _bi::bind_t<R, F, list_type> (f, list_type(a1, a2));
1.1314 +}
1.1315 +
1.1316 +template<class R, class F, class A1, class A2, class A3>
1.1317 + _bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type>
1.1318 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3)
1.1319 +{
1.1320 + typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
1.1321 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3));
1.1322 +}
1.1323 +
1.1324 +template<class R, class F, class A1, class A2, class A3, class A4>
1.1325 + _bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
1.1326 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4)
1.1327 +{
1.1328 + typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
1.1329 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4));
1.1330 +}
1.1331 +
1.1332 +template<class R, class F, class A1, class A2, class A3, class A4, class A5>
1.1333 + _bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
1.1334 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
1.1335 +{
1.1336 + typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
1.1337 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
1.1338 +}
1.1339 +
1.1340 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6>
1.1341 + _bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
1.1342 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
1.1343 +{
1.1344 + typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
1.1345 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
1.1346 +}
1.1347 +
1.1348 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
1.1349 + _bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
1.1350 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
1.1351 +{
1.1352 + typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
1.1353 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
1.1354 +}
1.1355 +
1.1356 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
1.1357 + _bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
1.1358 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
1.1359 +{
1.1360 + typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
1.1361 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
1.1362 +}
1.1363 +
1.1364 +template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
1.1365 + _bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
1.1366 + BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
1.1367 +{
1.1368 + typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
1.1369 + return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
1.1370 +}
1.1371 +
1.1372 +#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
1.1373 +
1.1374 +// adaptable function objects
1.1375 +
1.1376 +template<class F>
1.1377 + _bi::bind_t<_bi::unspecified, F, _bi::list0>
1.1378 + BOOST_BIND(F f)
1.1379 +{
1.1380 + typedef _bi::list0 list_type;
1.1381 + return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type());
1.1382 +}
1.1383 +
1.1384 +template<class F, class A1>
1.1385 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_1<A1>::type>
1.1386 + BOOST_BIND(F f, A1 a1)
1.1387 +{
1.1388 + typedef typename _bi::list_av_1<A1>::type list_type;
1.1389 + return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1));
1.1390 +}
1.1391 +
1.1392 +template<class F, class A1, class A2>
1.1393 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_2<A1, A2>::type>
1.1394 + BOOST_BIND(F f, A1 a1, A2 a2)
1.1395 +{
1.1396 + typedef typename _bi::list_av_2<A1, A2>::type list_type;
1.1397 + return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1, a2));
1.1398 +}
1.1399 +
1.1400 +template<class F, class A1, class A2, class A3>
1.1401 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_3<A1, A2, A3>::type>
1.1402 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3)
1.1403 +{
1.1404 + typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
1.1405 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3));
1.1406 +}
1.1407 +
1.1408 +template<class F, class A1, class A2, class A3, class A4>
1.1409 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
1.1410 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4)
1.1411 +{
1.1412 + typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
1.1413 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4));
1.1414 +}
1.1415 +
1.1416 +template<class F, class A1, class A2, class A3, class A4, class A5>
1.1417 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
1.1418 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
1.1419 +{
1.1420 + typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
1.1421 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
1.1422 +}
1.1423 +
1.1424 +template<class F, class A1, class A2, class A3, class A4, class A5, class A6>
1.1425 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
1.1426 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
1.1427 +{
1.1428 + typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
1.1429 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
1.1430 +}
1.1431 +
1.1432 +template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
1.1433 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
1.1434 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
1.1435 +{
1.1436 + typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
1.1437 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
1.1438 +}
1.1439 +
1.1440 +template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
1.1441 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
1.1442 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
1.1443 +{
1.1444 + typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
1.1445 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
1.1446 +}
1.1447 +
1.1448 +template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
1.1449 + _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
1.1450 + BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
1.1451 +{
1.1452 + typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
1.1453 + return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
1.1454 +}
1.1455 +
1.1456 +#endif // !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
1.1457 +
1.1458 +// function pointers
1.1459 +
1.1460 +#define BOOST_BIND_CC
1.1461 +#define BOOST_BIND_ST
1.1462 +
1.1463 +#include <boost/bind/bind_cc.hpp>
1.1464 +
1.1465 +#undef BOOST_BIND_CC
1.1466 +#undef BOOST_BIND_ST
1.1467 +
1.1468 +#ifdef BOOST_BIND_ENABLE_STDCALL
1.1469 +
1.1470 +#define BOOST_BIND_CC __stdcall
1.1471 +#define BOOST_BIND_ST
1.1472 +
1.1473 +#include <boost/bind/bind_cc.hpp>
1.1474 +
1.1475 +#undef BOOST_BIND_CC
1.1476 +#undef BOOST_BIND_ST
1.1477 +
1.1478 +#endif
1.1479 +
1.1480 +#ifdef BOOST_BIND_ENABLE_FASTCALL
1.1481 +
1.1482 +#define BOOST_BIND_CC __fastcall
1.1483 +#define BOOST_BIND_ST
1.1484 +
1.1485 +#include <boost/bind/bind_cc.hpp>
1.1486 +
1.1487 +#undef BOOST_BIND_CC
1.1488 +#undef BOOST_BIND_ST
1.1489 +
1.1490 +#endif
1.1491 +
1.1492 +#ifdef BOOST_BIND_ENABLE_PASCAL
1.1493 +
1.1494 +#define BOOST_BIND_ST pascal
1.1495 +#define BOOST_BIND_CC
1.1496 +
1.1497 +#include <boost/bind/bind_cc.hpp>
1.1498 +
1.1499 +#undef BOOST_BIND_ST
1.1500 +#undef BOOST_BIND_CC
1.1501 +
1.1502 +#endif
1.1503 +
1.1504 +// member function pointers
1.1505 +
1.1506 +#define BOOST_BIND_MF_NAME(X) X
1.1507 +#define BOOST_BIND_MF_CC
1.1508 +
1.1509 +#include <boost/bind/bind_mf_cc.hpp>
1.1510 +
1.1511 +#undef BOOST_BIND_MF_NAME
1.1512 +#undef BOOST_BIND_MF_CC
1.1513 +
1.1514 +#ifdef BOOST_MEM_FN_ENABLE_CDECL
1.1515 +
1.1516 +#define BOOST_BIND_MF_NAME(X) X##_cdecl
1.1517 +#define BOOST_BIND_MF_CC __cdecl
1.1518 +
1.1519 +#include <boost/bind/bind_mf_cc.hpp>
1.1520 +
1.1521 +#undef BOOST_BIND_MF_NAME
1.1522 +#undef BOOST_BIND_MF_CC
1.1523 +
1.1524 +#endif
1.1525 +
1.1526 +#ifdef BOOST_MEM_FN_ENABLE_STDCALL
1.1527 +
1.1528 +#define BOOST_BIND_MF_NAME(X) X##_stdcall
1.1529 +#define BOOST_BIND_MF_CC __stdcall
1.1530 +
1.1531 +#include <boost/bind/bind_mf_cc.hpp>
1.1532 +
1.1533 +#undef BOOST_BIND_MF_NAME
1.1534 +#undef BOOST_BIND_MF_CC
1.1535 +
1.1536 +#endif
1.1537 +
1.1538 +#ifdef BOOST_MEM_FN_ENABLE_FASTCALL
1.1539 +
1.1540 +#define BOOST_BIND_MF_NAME(X) X##_fastcall
1.1541 +#define BOOST_BIND_MF_CC __fastcall
1.1542 +
1.1543 +#include <boost/bind/bind_mf_cc.hpp>
1.1544 +
1.1545 +#undef BOOST_BIND_MF_NAME
1.1546 +#undef BOOST_BIND_MF_CC
1.1547 +
1.1548 +#endif
1.1549 +
1.1550 +// data member pointers
1.1551 +
1.1552 +#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
1.1553 + || ( defined(__BORLANDC__) && BOOST_WORKAROUND( __BORLANDC__, < 0x600 ) )
1.1554 +
1.1555 +template<class R, class T, class A1>
1.1556 +_bi::bind_t< R, _mfi::dm<R, T>, typename _bi::list_av_1<A1>::type >
1.1557 + BOOST_BIND(R T::*f, A1 a1)
1.1558 +{
1.1559 + typedef _mfi::dm<R, T> F;
1.1560 + typedef typename _bi::list_av_1<A1>::type list_type;
1.1561 + return _bi::bind_t<R, F, list_type>( F(f), list_type(a1) );
1.1562 +}
1.1563 +
1.1564 +#else
1.1565 +
1.1566 +namespace _bi
1.1567 +{
1.1568 +
1.1569 +template< class Pm, int I > struct add_cref;
1.1570 +
1.1571 +template< class M, class T > struct add_cref< M T::*, 0 >
1.1572 +{
1.1573 + typedef M type;
1.1574 +};
1.1575 +
1.1576 +template< class M, class T > struct add_cref< M T::*, 1 >
1.1577 +{
1.1578 + typedef M const & type;
1.1579 +};
1.1580 +
1.1581 +template< class R, class T > struct add_cref< R (T::*) (), 1 >
1.1582 +{
1.1583 + typedef void type;
1.1584 +};
1.1585 +
1.1586 +#if !( defined(__IBMCPP__) && BOOST_WORKAROUND( __IBMCPP__, BOOST_TESTED_AT(600) ) )
1.1587 +
1.1588 +template< class R, class T > struct add_cref< R (T::*) () const, 1 >
1.1589 +{
1.1590 + typedef void type;
1.1591 +};
1.1592 +
1.1593 +#endif // __IBMCPP__
1.1594 +
1.1595 +template<class R> struct isref
1.1596 +{
1.1597 + enum value_type { value = 0 };
1.1598 +};
1.1599 +
1.1600 +template<class R> struct isref< R& >
1.1601 +{
1.1602 + enum value_type { value = 1 };
1.1603 +};
1.1604 +
1.1605 +template<class R> struct isref< R* >
1.1606 +{
1.1607 + enum value_type { value = 1 };
1.1608 +};
1.1609 +
1.1610 +template<class Pm, class A1> struct dm_result
1.1611 +{
1.1612 + typedef typename add_cref< Pm, 1 >::type type;
1.1613 +};
1.1614 +
1.1615 +template<class Pm, class R, class F, class L> struct dm_result< Pm, bind_t<R, F, L> >
1.1616 +{
1.1617 + typedef typename bind_t<R, F, L>::result_type result_type;
1.1618 + typedef typename add_cref< Pm, isref< result_type >::value >::type type;
1.1619 +};
1.1620 +
1.1621 +} // namespace _bi
1.1622 +
1.1623 +template< class A1, class M, class T >
1.1624 +
1.1625 +_bi::bind_t<
1.1626 + typename _bi::dm_result< M T::*, A1 >::type,
1.1627 + _mfi::dm<M, T>,
1.1628 + typename _bi::list_av_1<A1>::type
1.1629 +>
1.1630 +
1.1631 +BOOST_BIND( M T::*f, A1 a1 )
1.1632 +{
1.1633 + typedef typename _bi::dm_result< M T::*, A1 >::type result_type;
1.1634 + typedef _mfi::dm<M, T> F;
1.1635 + typedef typename _bi::list_av_1<A1>::type list_type;
1.1636 + return _bi::bind_t< result_type, F, list_type >( F( f ), list_type( a1 ) );
1.1637 +}
1.1638 +
1.1639 +#endif
1.1640 +
1.1641 +} // namespace boost
1.1642 +
1.1643 +#ifndef BOOST_BIND_NO_PLACEHOLDERS
1.1644 +
1.1645 +# include <boost/bind/placeholders.hpp>
1.1646 +
1.1647 +#endif
1.1648 +
1.1649 +#ifdef BOOST_MSVC
1.1650 +# pragma warning(default: 4512) // assignment operator could not be generated
1.1651 +# pragma warning(pop)
1.1652 +#endif
1.1653 +
1.1654 +#endif // #ifndef BOOST_BIND_HPP_INCLUDED