selection_algorithms.hpp File Reference

Go to the source code of this file.

Classes
struct	logical_xor< C1, C2 >
	xor funtion object More...

Namespaces
namespace	adobe

Functions
template<typename S, typename O, typename P>
O	selection_operation_remainder (S first, S last, O output, bool this_inside, bool other_inside, P pred)
template<typename S1, typename S2, typename O, typename P, typename C>
O	selection_operation (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, O output, bool s1_inside, bool s2_inside, P pred, C comp)
	selection_operation implementation
template<typename S1, typename S2, typename O, typename C>
O	selection_union (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, O output, C comp, bool s1_inside=false, bool s2_inside=false)
	selection_union implementation
template<typename S1, typename S2, typename O, typename C>
O	selection_intersection (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, O output, C comp, bool s1_inside=false, bool s2_inside=false)
	selection_intersection implementation
template<typename S1, typename S2, typename O, typename C>
O	selection_difference (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, O output, C comp, bool s1_inside=false, bool s2_inside=false)
	selection_difference implementation
template<typename S1, typename S2, typename O, typename C>
O	selection_symmetric_difference (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, O output, C comp, bool s1_inside=false, bool s2_inside=false)
	selection_symmetric_difference implementation
template<typename S1, typename S2, typename C>
bool	selection_includes (S1 s1_first, S1 s1_last, S2 s2_first, S2 s2_last, C comp, bool s1_inside=false, bool s2_inside=false)
	selection_includes implementation
template<typename Selection1, typename Selection2>
Selection1	selection_intersection (const Selection1 &x, const Selection2 &y)
	selection_intersection implementation
template<typename Selection1, typename Selection2>
Selection1	selection_union (const Selection1 &x, const Selection2 &y)
	selection_union implementation
template<typename Selection1, typename Selection2>
Selection1	selection_difference (const Selection1 &x, const Selection2 &y)
	selection_difference implementation
template<typename Selection1, typename Selection2>
Selection1	selection_symmetric_difference (const Selection1 &x, const Selection2 &y)
	selection_symmetric_difference implementation
template<typename Selection1, typename Selection2>
bool	selection_includes (const Selection1 &x, const Selection2 &y)
	selection_includes implementation
template<typename Selection>
void	invert (Selection &x)
	invert implementation
template<typename Selection>
bool	start_selected (const Selection &x)
	start_selected implementation
template<typename Selection>
boost::range_size< Selection >::type	size (const Selection &x)
template<typename Selection, typename ForwardRange>
boost::range_size< Selection >::type	size (const Selection &x, const ForwardRange &range)
template<typename Selection>
bool	is_selected (const Selection &x, typename Selection::value_type index)
template<typename Selection, typename ForwardRange, typename OutputIterator>
OutputIterator	selection_copy (const Selection &x, const ForwardRange &range, OutputIterator output)
template<typename Selection, typename ForwardRange, typename O1, typename O2>
std::pair< O1, O2 >	selection_partition_copy (const Selection &selection, ForwardRange &range, O1 false_output, O2 true_output)
	selection_partition_copy implementation
template<typename Selection, typename ForwardRange, typename UnaryFunction>
UnaryFunction	selection_foreach (const Selection &x, const ForwardRange &range, UnaryFunction proc)
	selection_foreach implementation
template<typename Selection>
std::pair< typename boost::range_const_iterator< Selection >::type, typename boost::range_size< Selection >::type >	selection_find_boundary (const Selection &selection, typename Selection::size_type p, std::random_access_iterator_tag)
template<typename Selection>
std::pair< typename boost::range_const_iterator< Selection >::type, typename boost::range_size< Selection >::type >	selection_find_boundary (const Selection &selection, typename Selection::size_type p, std::forward_iterator_tag)
template<typename Selection>
std::pair< typename boost::range_const_iterator< Selection >::type, typename boost::range_size< Selection >::type >	selection_find_boundary (const Selection &selection, typename Selection::size_type p)
template<typename SelectionIterator, typename RangeIterator>
RangeIterator	selection_stable_partition (SelectionIterator selection_first, SelectionIterator selection_last, RangeIterator first, RangeIterator range_first, RangeIterator range_last, std::size_t boundary_count=0)
template<typename Selection, typename ForwardRange>
boost::range_iterator< ForwardRange >::type	selection_stable_partition (const Selection &selection, ForwardRange &range)
template<typename Selection, typename ForwardRange>
std::pair< typename boost::range_iterator< ForwardRange >::type, typename boost::range_iterator< ForwardRange >::type >	selection_stable_partition_about (const Selection &selection, ForwardRange &range, std::size_t p, typename boost::range_size< Selection >::type prior_boundary_count=0)
template<typename I, typename N>
std::pair< I, N >	find_sequence_end (I f, I l, N n)
template<typename I, typename O>
void	index_set_to_selection (I f, I l, O output)
template<typename Selection, typename ForwardRange>
Selection	index_set_to_selection (const ForwardRange &index_set)
template<typename Selection, typename OutputIterator>
OutputIterator	selection_to_index_set (const Selection &selection, typename boost::range_size< Selection >::type max_index, OutputIterator output)