boost::unit_test Namespace Reference

Namespaces
	for_each
	framework
	log
	output
	results_reporter
	ut_detail

Classes
singleton	basic_cstring
class	basic_ifstream_line_iterator
class	basic_istream_line_iterator
class	basic_string_token_iterator
class	callback0
class	callback1
class	callback2
class	callback3
class	case_ins_less
class	class_property
struct	custom_manip
struct	custom_printer
class	fixed_mapping
class	global_fixture
class	input_iterator_core_access
class	input_iterator_facade
class	lazy_ostream
class	lazy_ostream_impl
struct	log_checkpoint_data
struct	log_entry_data
class	master_test_suite_t
class	progress_monitor_t
class	range_token_iterator
class	readonly_property
class	readwrite_property
class	results_collector_t
class	singleton
struct	test_being_aborted
class	test_case
class	test_case_counter
class	test_observer
class	test_results
class	test_suite
class	test_tree_visitor
class	test_unit
class	test_unit_generator
class	token_iterator_base
class	unit_test_log_formatter
class	unit_test_log_t
class	unit_test_monitor_t

Typedefs
typedef test_suite *(*	init_unit_test_func )(int, char *[])
typedef basic_cstring< char const >	const_string
typedef const_string const	literal_string
typedef char const *const	c_literal_string
typedef basic_ifstream_line_iterator < char >	ifstream_line_iterator
typedef basic_ifstream_line_iterator < wchar_t >	wifstream_line_iterator
typedef basic_istream_line_iterator < char >	istream_line_iterator
typedef basic_istream_line_iterator < wchar_t >	wistream_line_iterator
typedef basic_string_token_iterator < char >	string_token_iterator
typedef basic_string_token_iterator < wchar_t >	wstring_token_iterator
typedef custom_manip< struct attr_value_t >	attr_value
typedef custom_manip< struct cdata_t >	cdata

Enumerations
enum	ti_delimeter_type {   dt_char,   dt_ispunct,   dt_isspace,   dt_none }

Functions
template<typename ParamType , typename ParamIter >
ut_detail::param_test_case_generator < ParamType, ParamIter >	make_test_case (callback1< ParamType > const &test_func, const_string tc_name, ParamIter par_begin, ParamIter par_end)
template<typename ParamType , typename ParamIter >
ut_detail::param_test_case_generator < BOOST_DEDUCED_TYPENAME remove_const < BOOST_DEDUCED_TYPENAME remove_reference< ParamType > ::type >::type, ParamIter >	make_test_case (void(*test_func)(ParamType), const_string tc_name, ParamIter par_begin, ParamIter par_end)
template<typename UserTestCase , typename ParamType , typename ParamIter >
ut_detail::param_test_case_generator < BOOST_DEDUCED_TYPENAME remove_const < BOOST_DEDUCED_TYPENAME remove_reference< ParamType > ::type >::type, ParamIter >	make_test_case (void(UserTestCase::*test_method)(ParamType), const_string tc_name, boost::shared_ptr< UserTestCase > const &user_test_case, ParamIter par_begin, ParamIter par_end)
int BOOST_TEST_DECL	unit_test_main (init_unit_test_func init_func, int argc, char *argv[])
BOOST_TEST_DECL void	traverse_test_tree (test_case const &, test_tree_visitor &)
BOOST_TEST_DECL void	traverse_test_tree (test_suite const &, test_tree_visitor &)
BOOST_TEST_DECL void	traverse_test_tree (test_unit_id, test_tree_visitor &)
void	traverse_test_tree (test_unit const &tu, test_tree_visitor &V)
test_case *	make_test_case (callback0<> const &test_func, const_string tc_name)
template<typename UserTestCase , typename InstanceType >
test_case *	make_test_case (void(UserTestCase::*test_method)(), const_string tc_name, boost::shared_ptr< InstanceType > user_test_case)
template<class InputIter1 , class InputIter2 >
std::pair< InputIter1, InputIter2 >	mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2)
	this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one More...
template<class InputIter1 , class InputIter2 , class Predicate >
std::pair< InputIter1, InputIter2 >	mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Predicate pred)
	this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one. More...
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator1	find_first_not_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for first element that does not belong a second one More...
template<class ForwardIterator1 , class ForwardIterator2 , class Predicate >
ForwardIterator1	find_first_not_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for first element that does not satisfy binary predicate in conjunction will any element in second collection More...
template<class BidirectionalIterator1 , class ForwardIterator2 >
BidirectionalIterator1	find_last_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for last element that belongs to a second one More...
template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >
BidirectionalIterator1	find_last_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for last element that satisfy binary predicate in conjunction will at least one element in second collection More...
template<class BidirectionalIterator1 , class ForwardIterator2 >
BidirectionalIterator1	find_last_not_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for last element that does not belong to a second one More...
template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >
BidirectionalIterator1	find_last_not_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for last element that does not satisfy binary predicate in conjunction will any element in second collection More...
template<typename T , typename S >
void	assign_op (T &t, S const &s, long)
template<typename CharT1 , typename CharT2 >
bool	operator== (basic_cstring< CharT1 > const &s1, basic_cstring< CharT2 > const &s2)
template<typename CharT1 , typename CharT2 >
bool	operator== (basic_cstring< CharT1 > const &s1, CharT2 *s2)
template<typename CharT >
bool	operator== (basic_cstring< CharT > const &s1, typename basic_cstring< CharT >::std_string const &s2)
template<typename CharT1 , typename CharT2 >
bool	operator== (CharT1 *s2, basic_cstring< CharT2 > const &s1)
template<typename CharT >
bool	operator== (typename basic_cstring< CharT >::std_string const &s2, basic_cstring< CharT > const &s1)
template<typename CharT >
bool	operator!= (basic_cstring< CharT > const &s1, CharT *s2)
template<typename CharT >
bool	operator!= (CharT *s2, basic_cstring< CharT > const &s1)
template<typename CharT >
bool	operator!= (basic_cstring< CharT > const &s1, basic_cstring< CharT > const &s2)
template<typename CharT >
bool	operator!= (basic_cstring< CharT > const &s1, typename basic_cstring< CharT >::std_string const &s2)
template<typename CharT >
bool	operator!= (typename basic_cstring< CharT >::std_string const &s2, basic_cstring< CharT > const &s1)
template<typename CharT >
basic_cstring< CharT >::value_type	first_char (basic_cstring< CharT > source)
template<typename CharT >
basic_cstring< CharT >::value_type	last_char (basic_cstring< CharT > source)
template<typename CharT1 , typename CharT2 >
void	assign_op (std::basic_string< CharT1 > &target, basic_cstring< CharT2 > src, int)
template<class CharT >
bool	case_ins_eq (basic_cstring< CharT > x, basic_cstring< CharT > y)
template<class CharT >
bool	operator< (boost::unit_test::basic_cstring< CharT > const &x, boost::unit_test::basic_cstring< CharT > const &y)
template<typename CharT1 , typename Tr , typename CharT2 >
std::basic_ostream< CharT1, Tr > &	operator<< (std::basic_ostream< CharT1, Tr > &os, basic_cstring< CharT2 > const &str)
template<typename CharT1 , typename Tr , class PropertyType >
std::basic_ostream< CharT1, Tr > &	operator<< (std::basic_ostream< CharT1, Tr > &os, class_property< PropertyType > const &p)
template<class PropertyType >
bool	operator== (PropertyType const &lhs, class_property< PropertyType > const &rhs)
template<class PropertyType >
bool	operator== (class_property< PropertyType > const &lhs, PropertyType const &rhs)
template<class PropertyType >
bool	operator== (class_property< PropertyType > const &lhs, class_property< PropertyType > const &rhs)
template<class PropertyType >
bool	operator!= (PropertyType const &lhs, class_property< PropertyType > const &rhs)
template<class PropertyType >
bool	operator!= (class_property< PropertyType > const &lhs, PropertyType const &rhs)
template<class PropertyType >
bool	operator!= (class_property< PropertyType > const &lhs, class_property< PropertyType > const &rhs)
template<typename Uniq >
custom_printer< custom_manip < Uniq > >	operator<< (std::ostream &ostr, custom_manip< Uniq > const &)
template<typename Iter >
range_token_iterator< Iter >	make_range_token_iterator (Iter begin, Iter end=Iter())
template<typename Iter , typename Modifier >
range_token_iterator< Iter >	make_range_token_iterator (Iter begin, Iter end, Modifier const &m)
template<typename T >
lazy_ostream_impl< T const & >	operator<< (lazy_ostream const &prev, T const &v)
void	print_escaped (std::ostream &where_to, const_string value)
void	print_escaped (std::ostream &where_to, std::string const &value)
template<typename T >
void	print_escaped (std::ostream &where_to, T const &value)
template<typename T >
std::ostream &	operator<< (custom_printer< attr_value > const &p, T const &value)
std::ostream &	operator<< (custom_printer< cdata > const &p, const_string value)

Typedef Documentation

typedef custom_manip<struct attr_value_t> boost::unit_test::attr_value

typedef char const* const boost::unit_test::c_literal_string

typedef custom_manip<struct cdata_t> boost::unit_test::cdata

typedef basic_cstring<char const> boost::unit_test::const_string

typedef basic_ifstream_line_iterator<char> boost::unit_test::ifstream_line_iterator

typedef test_suite*(* boost::unit_test::init_unit_test_func)(int, char *[])

typedef basic_istream_line_iterator<char> boost::unit_test::istream_line_iterator

typedef const_string const boost::unit_test::literal_string

typedef basic_string_token_iterator<char> boost::unit_test::string_token_iterator

typedef basic_ifstream_line_iterator<wchar_t> boost::unit_test::wifstream_line_iterator

typedef basic_istream_line_iterator<wchar_t> boost::unit_test::wistream_line_iterator

typedef basic_string_token_iterator<wchar_t> boost::unit_test::wstring_token_iterator

Enumeration Type Documentation

enum boost::unit_test::ti_delimeter_type

Enumerator
dt_char
dt_ispunct
dt_isspace
dt_none

Function Documentation

template<typename T , typename S >

void boost::unit_test::assign_op ( T &  t, S const &  s, long    )

inline

References boost::asio::s.

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::interpret_argument_value_impl< dstring >::_(), boost::BOOST_RT_PARAM_NAMESPACE::cla::char_name_policy::char_name_policy(), boost::BOOST_RT_PARAM_NAMESPACE::environment::rt_env_detail::new_var_record(), boost::unit_test::ut_detail::generate_test_case_4_type< Generator, TestCaseTemplate >::operator()(), boost::nfp::optionally_assign(), boost::BOOST_RT_PARAM_NAMESPACE::file::param_namespace::param_namespace(), boost::BOOST_RT_PARAM_NAMESPACE::file::parameter::parameter(), boost::BOOST_RT_PARAM_NAMESPACE::cla::parser::parser(), boost::BOOST_RT_PARAM_NAMESPACE::file::config_file_iterator::set_parameter(), boost::BOOST_RT_PARAM_NAMESPACE::cla::string_name_policy::string_name_policy(), and boost::BOOST_RT_PARAM_NAMESPACE::cla::parser::usage().

template<typename CharT1 , typename CharT2 >

void boost::unit_test::assign_op ( std::basic_string< CharT1 > &  target, basic_cstring< CharT2 >  src, int    )

inline

References boost::unit_test::basic_cstring< CharT >::begin(), and boost::unit_test::basic_cstring< CharT >::size().

template<class CharT >

bool boost::unit_test::case_ins_eq ( basic_cstring< CharT >  x, basic_cstring< CharT >  y  )

inline

References boost::unit_test::basic_cstring< CharT >::begin(), boost::unit_test::ut_detail::case_ins< CharT >::compare(), and boost::unit_test::basic_cstring< CharT >::size().

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::interpret_argument_value_impl< bool >::_().

template<class ForwardIterator1 , class ForwardIterator2 >

ForwardIterator1 boost::unit_test::find_first_not_of ( ForwardIterator1  first1, ForwardIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2  )

inline

this algorithm search through first collection for first element that does not belong a second one

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator

References boost::algorithm::find().

Referenced by boost::wave::util::flex_string< E, T, A, Storage >::find_first_not_of(), and boost::msm::front::euml::StringFindFirstNotOf_< Container, Param1, Param2, Param3, typename::boost::disable_if< typename::boost::is_same< Param3, void >::type >::type >::operator()().

template<class ForwardIterator1 , class ForwardIterator2 , class Predicate >

ForwardIterator1 boost::unit_test::find_first_not_of ( ForwardIterator1  first1, ForwardIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2, Predicate  pred  )

inline

this algorithm search through first collection for first element that does not satisfy binary predicate in conjunction will any element in second collection

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator
pred	- predicate to be used for search

References boost::bind1st(), and boost::fusion::find_if().

template<class BidirectionalIterator1 , class ForwardIterator2 >

BidirectionalIterator1 boost::unit_test::find_last_not_of ( BidirectionalIterator1  first1, BidirectionalIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2  )

inline

this algorithm search through first collection for last element that does not belong to a second one

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator

References boost::algorithm::find().

Referenced by boost::wave::util::flex_string< E, T, A, Storage >::find_last_not_of(), and boost::msm::front::euml::StringFindLastNotOf_< Container, Param1, Param2, Param3, typename::boost::disable_if< typename::boost::is_same< Param3, void >::type >::type >::operator()().

template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >

BidirectionalIterator1 boost::unit_test::find_last_not_of ( BidirectionalIterator1  first1, BidirectionalIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2, Predicate  pred  )

inline

this algorithm search through first collection for last element that does not satisfy binary predicate in conjunction will any element in second collection

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator
pred	- predicate to be used for search

References boost::bind1st(), and boost::fusion::find_if().

template<class BidirectionalIterator1 , class ForwardIterator2 >

BidirectionalIterator1 boost::unit_test::find_last_of ( BidirectionalIterator1  first1, BidirectionalIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2  )

inline

this algorithm search through first collection for last element that belongs to a second one

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator

References boost::algorithm::find().

Referenced by boost::wave::util::flex_string< E, T, A, Storage >::find_last_of(), and boost::msm::front::euml::StringFindLastOf_< Container, Param1, Param2, Param3, typename::boost::disable_if< typename::boost::is_same< Param3, void >::type >::type >::operator()().

template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >

BidirectionalIterator1 boost::unit_test::find_last_of ( BidirectionalIterator1  first1, BidirectionalIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2, Predicate  pred  )

inline

this algorithm search through first collection for last element that satisfy binary predicate in conjunction will at least one element in second collection

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator
pred	- predicate to be used for search

References boost::bind1st(), and boost::fusion::find_if().

template<typename CharT >

basic_cstring<CharT>::value_type boost::unit_test::first_char ( basic_cstring< CharT >  source )

inline

References boost::unit_test::basic_cstring< CharT >::begin(), and boost::unit_test::basic_cstring< CharT >::is_empty().

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::cla::string_name_policy::conflict_with(), and boost::BOOST_RT_PARAM_NAMESPACE::cla::argv_traverser::match_front().

template<typename CharT >

basic_cstring<CharT>::value_type boost::unit_test::last_char ( basic_cstring< CharT >  source )

inline

References boost::unit_test::basic_cstring< CharT >::end(), and boost::unit_test::basic_cstring< CharT >::is_empty().

template<typename Iter >

range_token_iterator<Iter> boost::unit_test::make_range_token_iterator ( Iter  begin, Iter  end = Iter()  )

inline

References boost::asio::begin, and boost::end.

template<typename Iter , typename Modifier >

range_token_iterator<Iter> boost::unit_test::make_range_token_iterator ( Iter  begin, Iter  end, Modifier const &  m  )

inline

References boost::asio::begin, and boost::end.

template<typename ParamType , typename ParamIter >

ut_detail::param_test_case_generator<ParamType,ParamIter> boost::unit_test::make_test_case ( callback1< ParamType > const &  test_func, const_string  tc_name, ParamIter  par_begin, ParamIter  par_end  )

inline

template<typename ParamType , typename ParamIter >

ut_detail::param_test_case_generator< BOOST_DEDUCED_TYPENAME remove_const<BOOST_DEDUCED_TYPENAME remove_reference<ParamType>::type>::type,ParamIter> boost::unit_test::make_test_case ( void(*)(ParamType)  test_func, const_string  tc_name, ParamIter  par_begin, ParamIter  par_end  )

inline

References BOOST_DEDUCED_TYPENAME, and boost::detail::type.

template<typename UserTestCase , typename ParamType , typename ParamIter >

ut_detail::param_test_case_generator< BOOST_DEDUCED_TYPENAME remove_const<BOOST_DEDUCED_TYPENAME remove_reference<ParamType>::type>::type,ParamIter> boost::unit_test::make_test_case ( void(UserTestCase::*)(ParamType)  test_method, const_string  tc_name, boost::shared_ptr< UserTestCase > const &  user_test_case, ParamIter  par_begin, ParamIter  par_end  )

inline

References BOOST_DEDUCED_TYPENAME, and boost::detail::type.

test_case* boost::unit_test::make_test_case ( callback0<> const &  test_func, const_string  tc_name  )

inline

References boost::unit_test::ut_detail::normalize_test_case_name().

template<typename UserTestCase , typename InstanceType >

test_case* boost::unit_test::make_test_case ( void(UserTestCase::*)()  test_method, const_string  tc_name, boost::shared_ptr< InstanceType >  user_test_case  )

inline

References boost::unit_test::ut_detail::normalize_test_case_name().

template<class InputIter1 , class InputIter2 >

std::pair<InputIter1, InputIter2> boost::unit_test::mismatch ( InputIter1  first1, InputIter1  last1, InputIter2  first2, InputIter2  last2  )

inline

this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::cla::string_name_policy::conflict_with(), and boost::BOOST_RT_PARAM_NAMESPACE::cla::string_name_policy::responds_to().

template<class InputIter1 , class InputIter2 , class Predicate >

std::pair<InputIter1, InputIter2> boost::unit_test::mismatch ( InputIter1  first1, InputIter1  last1, InputIter2  first2, InputIter2  last2, Predicate  pred  )

inline

this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one.

This algorithms uses supplied predicate for collection elements comparison

Parameters

first1	- first collection begin iterator
last1	- first collection end iterator
first2	- second collection begin iterator
last2	- second collection end iterator
pred	- predicate to be used for search

Referenced by boost::lambda::ll::mismatch::operator()().

template<class PropertyType >

bool boost::unit_test::operator!= ( PropertyType const &  lhs, class_property< PropertyType > const &  rhs  )

inline

template<class PropertyType >

bool boost::unit_test::operator!= ( class_property< PropertyType > const &  lhs, PropertyType const &  rhs  )

inline

template<class PropertyType >

bool boost::unit_test::operator!= ( class_property< PropertyType > const &  lhs, class_property< PropertyType > const &  rhs  )

inline

template<typename CharT >

bool boost::unit_test::operator!= ( basic_cstring< CharT > const &  s1, CharT *  s2  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator!= ( CharT *  s2, basic_cstring< CharT > const &  s1  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator!= ( basic_cstring< CharT > const &  s1, basic_cstring< CharT > const &  s2  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator!= ( basic_cstring< CharT > const &  s1, typename basic_cstring< CharT >::std_string const &  s2  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator!= ( typename basic_cstring< CharT >::std_string const &  s2, basic_cstring< CharT > const &  s1  )

inline

References boost::xpressive::s2.

template<class CharT >

bool boost::unit_test::operator< ( boost::unit_test::basic_cstring< CharT > const &  x, boost::unit_test::basic_cstring< CharT > const &  y  )

inline

References compare(), and boost::polygon::y().

template<typename CharT1 , typename Tr , typename CharT2 >

std::basic_ostream<CharT1,Tr>& boost::unit_test::operator<< ( std::basic_ostream< CharT1, Tr > &  os, basic_cstring< CharT2 > const &  str  )

inline

References boost::detail::const, and boost::str().

template<typename T >

std::ostream& boost::unit_test::operator<< ( custom_printer< attr_value > const &  p, T const &  value  )

inline

References boost::multiprecision::backends::p, print_escaped(), and boost::program_options::value().

std::ostream& boost::unit_test::operator<< ( custom_printer< cdata > const &  p, const_string  value  )

inline

References boost::program_options::value().

template<typename Uniq >

custom_printer<custom_manip<Uniq> > boost::unit_test::operator<< ( std::ostream &  ostr, custom_manip< Uniq > const &    )

inline

template<typename CharT1 , typename Tr , class PropertyType >

std::basic_ostream<CharT1,Tr>& boost::unit_test::operator<< ( std::basic_ostream< CharT1, Tr > &  os, class_property< PropertyType > const &  p  )

inline

References boost::unit_test::class_property< PropertyType >::get().

template<typename T >

lazy_ostream_impl<T const&> boost::unit_test::operator<< ( lazy_ostream const &  prev, T const &  v  )

inline

template<class PropertyType >

bool boost::unit_test::operator== ( PropertyType const &  lhs, class_property< PropertyType > const &  rhs  )

inline

template<class PropertyType >

bool boost::unit_test::operator== ( class_property< PropertyType > const &  lhs, PropertyType const &  rhs  )

inline

template<class PropertyType >

bool boost::unit_test::operator== ( class_property< PropertyType > const &  lhs, class_property< PropertyType > const &  rhs  )

inline

template<typename CharT1 , typename CharT2 >

bool boost::unit_test::operator== ( basic_cstring< CharT1 > const &  s1, basic_cstring< CharT2 > const &  s2  )

inline

References boost::unit_test::basic_cstring< CharT >::begin(), compare(), and boost::unit_test::basic_cstring< CharT >::size().

template<typename CharT1 , typename CharT2 >

bool boost::unit_test::operator== ( basic_cstring< CharT1 > const &  s1, CharT2 *  s2  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator== ( basic_cstring< CharT > const &  s1, typename basic_cstring< CharT >::std_string const &  s2  )

inline

References boost::xpressive::s2.

template<typename CharT1 , typename CharT2 >

bool boost::unit_test::operator== ( CharT1 *  s2, basic_cstring< CharT2 > const &  s1  )

inline

References boost::xpressive::s2.

template<typename CharT >

bool boost::unit_test::operator== ( typename basic_cstring< CharT >::std_string const &  s2, basic_cstring< CharT > const &  s1  )

inline

References boost::xpressive::s2.

void boost::unit_test::print_escaped ( std::ostream &  where_to, const_string  value  )

inline

References BOOST_TEST_FOREACH, boost::multiprecision::backends::c, and boost::ref().

Referenced by boost::expressions::c_ascii_pattern_replacer< CharT >::operator()(), operator<<(), and print_escaped().

void boost::unit_test::print_escaped ( std::ostream &  where_to, std::string const &  value  )

inline

References print_escaped().

template<typename T >

void boost::unit_test::print_escaped ( std::ostream &  where_to, T const &  value  )

inline

References boost::program_options::value().

BOOST_TEST_DECL void boost::unit_test::traverse_test_tree	(	test_case const &	,
		test_tree_visitor &
	)

Referenced by traverse_test_tree().

BOOST_TEST_DECL void boost::unit_test::traverse_test_tree	(	test_suite const &	,
		test_tree_visitor &
	)

BOOST_TEST_DECL void boost::unit_test::traverse_test_tree	(	test_unit_id	,
		test_tree_visitor &
	)

void boost::unit_test::traverse_test_tree ( test_unit const &  tu, test_tree_visitor &  V  )

inline

References boost::unit_test::test_unit::p_type, and traverse_test_tree().

int BOOST_TEST_DECL boost::unit_test::unit_test_main	(	init_unit_test_func	init_func,
		int	argc,
		char *	argv[]
	)