2 Copyright (c) Vladimir Batov 2009-2016
3 Distributed under the Boost Software License, Version 1.0.
4 See copy at http://www.boost.org/LICENSE_1_0.txt.
7 [section:supporting_tools Supporting Tools]
9 This section describes a few supporting tools written as part of ['Boost.Convert] but which might be useful in their own rights.
11 [section BOOST_DECLARE_HAS_MEMBER]
13 The BOOST_DECLARE_HAS_MEMBER macro allows to declare a trait which would then let introspect the existence of a class member (a data member or a member function) with the specified name.
15 For example, the following declarations introduce `local::has_begin` and `local::has_funop` traits which then allow to test if the supplied class has respectively `begin` and `operator()` members:
17 [has_member_declaration]
19 Now these traits can be used as follows:
21 [has_member_classes_tested]
24 As it can be seen from the example the traits only check for the existence of a member (be that a data member or a member function) with the specified name.
27 [section BOOST_DECLARE_IS_CALLABLE]
29 The BOOST_DECLARE_IS_CALLABLE macro extends the functonality provided by BOOST_DECLARE_HAS_MEMBER and allows to declare a trait which would then let introspect the existence of a named class member function ['callable with the supplied signature].
31 For example, the following declarations introduce `local::can_call_funop` and `local::can_call_func` traits:
33 [is_callable_declaration]
35 The traits allow to test if the supplied class has respectively `operator()` and `func()` member functions callable with the specified signature:
37 [is_callable_classes_tested]
41 As it can be seen from the example the traits check for the existence of a ['callable] member function but ['not necessarily of the specified signature]. Please check the ['Boost.TTI] library for the latter.
44 [section boost::cnv::range]
46 ['boost::cnv::range] is a consolidation of the [begin, end)-based ranges (such as ['std::string]) and the sentry-based ranges (such as null-terminated C-style strings). It allows universal traversal of both types of ranges with
48 for (iterator s = range.begin(); s != range.sentry(); ++s)
50 without the penalty or the need for an extra traversal of the sentry-based ranges in order to find the end.
55 [section boost::cnv::is_range]
60 [section boost::cnv::is_cnv]