Information Home Overview Documentation Search Browse ASL Code Getting Started Release Notes ASL Wiki License Indices Success Stories Contributors Media Download ASL Perforce Depots Support ASL SourceForge Home Mailing Lists Discussion Forums Report Bugs Suggest Features Contributing to ASL RSS Short-text news Full-text news File releases Other Adobe Projects Adobe Apollo Adobe GIL Adobe Labs Adobe Media Gallery Adobe XMP Tamarin project (Mozilla Foundation) Other Resources Boost SGI STL

Standard Extensions [Algorithms] Extends the C++ standard algorithms with ConvertibleToRange and ConvertibleToFunction concepts. More... Functions template<class ForwardRange, class BinaryPredicate> boost::range_const_iterator< ForwardRange >::type  adobe::adjacent_find (const ForwardRange &range, BinaryPredicate pred) template<class ForwardRange, class BinaryPredicate> boost::range_iterator< ForwardRange >::type  adobe::adjacent_find (ForwardRange &range, BinaryPredicate pred) template<class ForwardIterator, class BinaryPredicate> ForwardIterator  adobe::adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate pred) template<class ForwardRange> boost::range_const_iterator< ForwardRange >::type  adobe::adjacent_find (const ForwardRange &range) template<class ForwardRange> boost::range_iterator< ForwardRange >::type  adobe::adjacent_find (ForwardRange &range) template<class ForwardRange, class T, class Compare> bool  adobe::binary_search (const ForwardRange &range, const T &value, Compare comp) template<class ForwardRange, class T, class Compare> bool  adobe::binary_search (ForwardRange &range, const T &value, Compare comp) template<class ForwardIterator, class T, class Compare> bool  adobe::binary_search (ForwardIterator first, ForwardIterator last, const T &value, Compare comp) template<class ForwardRange, class T> bool  adobe::binary_search (const ForwardRange &range, const T &value) template<class ForwardRange, class T> bool  adobe::binary_search (ForwardRange &range, const T &value) template<class InputRange, class OutputIterator> OutputIterator  adobe::copy (const InputRange &range, OutputIterator result) template<class InputRange, class OutputIterator> OutputIterator  adobe::copy (InputRange &range, OutputIterator result) template<class BidirectionalRange1, class BidirectionalIterator2> BidirectionalIterator2  adobe::copy_backward (const BidirectionalRange1 &range1, BidirectionalIterator2 result) template<class BidirectionalRange1, class BidirectionalIterator2> BidirectionalIterator2  adobe::copy_backward (BidirectionalRange1 &range1, BidirectionalIterator2 result) template<class InputRange, class T> std::iterator_traits< typename boost::range_const_iterator< InputRange >::type >::difference_type  adobe::count (const InputRange &range, T &value) template<class InputRange, class T> std::iterator_traits< typename boost::range_iterator< InputRange >::type >::difference_type  adobe::count (InputRange &range, T &value) template<class InputRange, class Predicate> std::iterator_traits< typename boost::range_const_iterator< InputRange >::type >::difference_type  adobe::count_if (const InputRange &range, Predicate pred) template<class InputRange, class Predicate> std::iterator_traits< typename boost::range_iterator< InputRange >::type >::difference_type  adobe::count_if (InputRange &range, Predicate pred) template<class InputIterator, class Predicate> std::iterator_traits< InputIterator >::difference_type  adobe::count_if (InputIterator first, InputIterator last, Predicate pred) template<class InputRange1, class InputIterator2, class BinaryPredicate> bool  adobe::equal (const InputRange1 &range1, InputIterator2 first2, BinaryPredicate pred) template<class InputIterator1, class InputIterator2, class BinaryPredicate> bool  adobe::equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred) template<class InputRange1, class InputIterator2> bool  adobe::equal (const InputRange1 &range1, InputIterator2 first2) template<class ForwardRange, class T, class Compare> std::pair< typename boost::range_const_iterator< ForwardRange >::type, typename boost::range_const_iterator< ForwardRange >::type >  adobe::equal_range (const ForwardRange &range, const T &value, Compare comp) template<class ForwardRange, class T, class Compare> std::pair< typename boost::range_iterator< ForwardRange >::type, typename boost::range_iterator< ForwardRange >::type >  adobe::equal_range (ForwardRange &range, const T &value, Compare comp) template<class ForwardIterator, class T, class Compare> std::pair< ForwardIterator, ForwardIterator >  adobe::equal_range (ForwardIterator first, ForwardIterator last, const T &value, Compare comp) template<class ForwardRange, class T> std::pair< typename boost::range_const_iterator< ForwardRange >::type, typename boost::range_const_iterator< ForwardRange >::type >  adobe::equal_range (const ForwardRange &range, const T &value) template<class ForwardRange, class T> std::pair< typename boost::range_iterator< ForwardRange >::type, typename boost::range_iterator< ForwardRange >::type >  adobe::equal_range (ForwardRange &range, const T &value) template<class ForwardRange, class T> void  adobe::fill (ForwardRange &range, const T &value) template<class InputRange, class T> boost::range_const_iterator< InputRange >::type  adobe::find (const InputRange &range, const T &value) template<class InputRange, class T> boost::range_iterator< InputRange >::type  adobe::find (InputRange &range, const T &value) template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> boost::range_const_iterator< ForwardRange1 >::type  adobe::find_end (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate comp) template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> boost::range_iterator< ForwardRange1 >::type  adobe::find_end (ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate comp) template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1  adobe::find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp) template<class ForwardRange1, class ForwardRange2> boost::range_const_iterator< ForwardRange1 >::type  adobe::find_end (const ForwardRange1 &range1, const ForwardRange2 &range2) template<class ForwardRange1, class ForwardRange2> boost::range_iterator< ForwardRange1 >::type  adobe::find_end (ForwardRange1 &range1, const ForwardRange2 &range2) template<class InputRange, class ForwardRange, class BinaryPredicate> boost::range_const_iterator< InputRange >::type  adobe::find_first_of (const InputRange &range1, const ForwardRange &range2, BinaryPredicate comp) template<class InputRange, class ForwardRange, class BinaryPredicate> boost::range_iterator< InputRange >::type  adobe::find_first_of (InputRange &range1, const ForwardRange &range2, BinaryPredicate comp) template<class InputIterator, class ForwardIterator, class BinaryPredicate> InputIterator  adobe::find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, BinaryPredicate comp) template<class InputRange, class ForwardRange> boost::range_const_iterator< InputRange >::type  adobe::find_first_of (const InputRange &range1, const ForwardRange &range2) template<class InputRange, class ForwardRange> boost::range_iterator< InputRange >::type  adobe::find_first_of (InputRange &range1, const ForwardRange &range2) template<class InputRange, class Predicate> boost::range_const_iterator< InputRange >::type  adobe::find_if (const InputRange &range, Predicate pred) template<class InputRange, class Predicate> boost::range_iterator< InputRange >::type  adobe::find_if (InputRange &range, Predicate pred) template<class InputIterator, class Predicate> InputIterator  adobe::find_if (InputIterator first, InputIterator last, Predicate pred) template<class ForwardRange, class Generator> void  adobe::generate (ForwardRange &range, Generator gen) template<class InputRange1, class InputRange2, class Compare> bool  adobe::includes (const InputRange1 &range1, const InputRange2 &range2, Compare comp) template<class InputIterator1, class InputIterator2, class Compare> bool  adobe::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) template<class InputRange1, class InputRange2> bool  adobe::includes (const InputRange1 &range1, const InputRange2 &range2) template<class InputRange1, class InputRange2, class Compare> bool  adobe::lexicographical_compare (const InputRange1 &range1, const InputRange2 &range2, Compare comp) template<class InputIterator1, class InputIterator2, class Compare> bool  adobe::lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) template<class InputRange1, class InputRange2> bool  adobe::lexicographical_compare (const InputRange1 &range1, const InputRange2 &range2) template<class ForwardRange, class T, class Compare> boost::range_const_iterator< ForwardRange >::type  adobe::lower_bound (const ForwardRange &range, const T &value, Compare comp) template<class ForwardRange, class T, class Compare> boost::range_iterator< ForwardRange >::type  adobe::lower_bound (ForwardRange &range, const T &value, Compare comp) template<class ForwardIterator, class T, class Compare> ForwardIterator  adobe::lower_bound (ForwardIterator first, ForwardIterator last, const T &value, Compare comp) template<class ForwardRange, class T> boost::range_const_iterator< ForwardRange >::type  adobe::lower_bound (const ForwardRange &range, const T &value) template<class ForwardRange, class T> boost::range_iterator< ForwardRange >::type  adobe::lower_bound (ForwardRange &range, const T &value) template<class RandomAccessRange, class Compare> void  adobe::make_heap (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::make_heap (RandomAccessRange &range) template<class T, class Compare> const T &  adobe::max (const T &a, const T &b, Compare comp) template<class ForwardRange, class Compare> boost::range_const_iterator< ForwardRange >::type  adobe::max_element (const ForwardRange &range, Compare comp) template<class ForwardRange, class Compare> boost::range_iterator< ForwardRange >::type  adobe::max_element (ForwardRange &range, Compare comp) template<class ForwardIterator, class Compare> ForwardIterator  adobe::max_element (ForwardIterator first, ForwardIterator last, Compare comp) template<class ForwardRange> boost::range_const_iterator< ForwardRange >::type  adobe::max_element (const ForwardRange &range) template<class ForwardRange> boost::range_iterator< ForwardRange >::type  adobe::max_element (ForwardRange &range) template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator  adobe::merge (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, Compare comp) template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator  adobe::merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator  adobe::merge (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result) template<class T, class Compare> const T &  adobe::min (const T &a, const T &b, Compare comp) template<class ForwardRange, class Compare> boost::range_const_iterator< ForwardRange >::type  adobe::min_element (const ForwardRange &range, Compare comp) template<class ForwardRange, class Compare> boost::range_iterator< ForwardRange >::type  adobe::min_element (ForwardRange &range, Compare comp) template<class ForwardIterator, class Compare> ForwardIterator  adobe::min_element (ForwardIterator first, ForwardIterator last, Compare comp) template<class ForwardRange> boost::range_const_iterator< ForwardRange >::type  adobe::min_element (const ForwardRange &range) template<class ForwardRange> boost::range_iterator< ForwardRange >::type  adobe::min_element (ForwardRange &range) template<class InputRange1, class InputIterator2, class BinaryPredicate> std::pair< typename boost::range_const_iterator< InputRange1 >::type, InputIterator2 >  adobe::mismatch (const InputRange1 &range1, InputIterator2 first2, BinaryPredicate pred) template<class InputRange1, class InputIterator2, class BinaryPredicate> std::pair< typename boost::range_iterator< InputRange1 >::type, InputIterator2 >  adobe::mismatch (InputRange1 &range1, InputIterator2 first2, BinaryPredicate pred) template<class InputIterator1, class InputIterator2, class BinaryPredicate> std::pair< InputIterator1, InputIterator2 >  adobe::mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred) template<class InputRange1, class InputIterator2> std::pair< typename boost::range_const_iterator< InputRange1 >::type, InputIterator2 >  adobe::mismatch (const InputRange1 &range1, InputIterator2 first2) template<class InputRange1, class InputIterator2> std::pair< typename boost::range_iterator< InputRange1 >::type, InputIterator2 >  adobe::mismatch (InputRange1 &range1, InputIterator2 first2) template<class BidirectionalRange, class Compare> bool  adobe::next_permutation (BidirectionalRange &range, Compare comp) template<class BidirectionalIterator, class Compare> bool  adobe::next_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) template<class BidirectionalRange> bool  adobe::next_permutation (BidirectionalRange &range) template<class InputRange, class RandomAccessRange, class Compare> void  adobe::partial_sort_copy (const InputRange &range, RandomAccessRange &result_range, Compare comp) template<class InputRange, class RandomAccessRange, class Compare> void  adobe::partial_sort_copy (InputRange &range, RandomAccessRange &result_range, Compare comp) template<class InputIterator, class RandomAccessIterator, class Compare> void  adobe::partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp) template<class InputRange, class RandomAccessRange> void  adobe::partial_sort_copy (const InputRange &range, RandomAccessRange &result_range) template<class InputRange, class RandomAccessRange> void  adobe::partial_sort_copy (InputRange &range, RandomAccessRange &result_range) template<class BidirectionalRange, class Predicate> boost::range_iterator< BidirectionalRange >::type  adobe::partition (BidirectionalRange &range, Predicate pred) template<class BidirectionalIterator, class Predicate> BidirectionalIterator  adobe::partition (BidirectionalIterator first, BidirectionalIterator last, Predicate pred) template<class RandomAccessRange, class Compare> void  adobe::pop_heap (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::pop_heap (RandomAccessRange &range) template<class BidirectionalRange, class Compare> bool  adobe::prev_permutation (BidirectionalRange &range, Compare comp) template<class BidirectionalIterator, class Compare> bool  adobe::prev_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) template<class BidirectionalRange> bool  adobe::prev_permutation (BidirectionalRange &range) template<class RandomAccessRange, class Compare> void  adobe::push_heap (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::push_heap (RandomAccessRange &range) template<class RandomAccessRange, class RandomNumberGenerator> void  adobe::random_shuffle (RandomAccessRange &range, RandomNumberGenerator &rand) template<class RandomAccessIterator, class RandomNumberGenerator> void  adobe::random_shuffle (RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator &rand) template<class RandomAccessRange> void  adobe::random_shuffle (RandomAccessRange &range) template<class InputRange, class T> boost::range_iterator< InputRange >::type  adobe::remove (InputRange &range, const T &value) template<class InputRange, class OutputIterator, class T> boost::range_const_iterator< InputRange >::type  adobe::remove_copy (const InputRange &range, OutputIterator result, const T &value) template<class InputRange, class OutputIterator, class T> boost::range_iterator< InputRange >::type  adobe::remove_copy (InputRange &range, OutputIterator result, const T &value) template<class InputRange, class OutputIterator, class Predicate> boost::range_const_iterator< InputRange >::type  adobe::remove_copy_if (const InputRange &range, OutputIterator result, Predicate pred) template<class InputRange, class OutputIterator, class Predicate> boost::range_iterator< InputRange >::type  adobe::remove_copy_if (InputRange &range, OutputIterator result, Predicate pred) template<class InputIterator, class OutputIterator, class Predicate> InputIterator  adobe::remove_copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred) template<class InputRange, class Predicate> boost::range_iterator< InputRange >::type  adobe::remove_if (InputRange &range, Predicate pred) template<class InputIterator, class Predicate> InputIterator  adobe::remove_if (InputIterator first, InputIterator last, Predicate pred) template<class ForwardRange, class T> void  adobe::replace (ForwardRange &range, const T &old_value, const T &new_value) template<class ForwardRange, class OutputIterator, class T> OutputIterator  adobe::replace_copy (const ForwardRange &range, OutputIterator result, const T &old_value, const T &new_value) template<class ForwardRange, class OutputIterator, class T> OutputIterator  adobe::replace_copy (ForwardRange &range, OutputIterator result, const T &old_value, const T &new_value) template<class ForwardRange, class OutputIterator, class Predicate, class T> OutputIterator  adobe::replace_copy_if (const ForwardRange &range, OutputIterator result, Predicate pred, const T &new_value) template<class ForwardRange, class OutputIterator, class Predicate, class T> OutputIterator  adobe::replace_copy_if (ForwardRange &range, OutputIterator result, Predicate pred, const T &new_value) template<class ForwardIterator, class OutputIterator, class Predicate, class T> OutputIterator  adobe::replace_copy_if (ForwardIterator first, ForwardIterator last, OutputIterator result, Predicate pred, const T &new_value) template<class ForwardRange, class Predicate, class T> void  adobe::replace_if (ForwardRange &range, Predicate pred, const T &new_value) template<class ForwardIterator, class Predicate, class T> void  adobe::replace_if (ForwardIterator first, ForwardIterator last, Predicate pred, const T &new_value) template<class BidirectionalRange> void  adobe::reverse (BidirectionalRange &range) template<class BidirectionalRange, class OutputIterator> void  adobe::reverse_copy (const BidirectionalRange &range, OutputIterator result) template<class BidirectionalRange, class OutputIterator> void  adobe::reverse_copy (BidirectionalRange &range, OutputIterator result) template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> boost::range_const_iterator< ForwardRange1 >::type  adobe::search (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> boost::range_iterator< ForwardRange1 >::type  adobe::search (ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1  adobe::search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred) template<class ForwardRange1, class ForwardRange2> boost::range_iterator< ForwardRange1 >::type  adobe::search (ForwardRange1 &range1, const ForwardRange2 &range2) template<class ForwardRange1, class ForwardRange2> boost::range_const_iterator< ForwardRange1 >::type  adobe::search (const ForwardRange1 &range1, const ForwardRange2 &range2) template<class ForwardRange, class Size, class T, class BinaryPredicate> boost::range_const_iterator< ForwardRange >::type  adobe::search_n (const ForwardRange &range, Size count, const T &value, BinaryPredicate pred) template<class ForwardRange, class Size, class T, class BinaryPredicate> boost::range_iterator< ForwardRange >::type  adobe::search_n (ForwardRange &range, Size count, const T &value, BinaryPredicate pred) template<class ForwardIterator, class Size, class T, class BinaryPredicate> ForwardIterator  adobe::search_n (ForwardIterator first, ForwardIterator last, Size count, const T &value, BinaryPredicate pred) template<class ForwardRange, class Size, class T> boost::range_const_iterator< ForwardRange >::type  adobe::search_n (const ForwardRange &range, Size count, const T &value) template<class ForwardRange, class Size, class T> boost::range_iterator< ForwardRange >::type  adobe::search_n (ForwardRange &range, Size count, const T &value) template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator  adobe::set_difference (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, Compare comp) template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator  adobe::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator  adobe::set_difference (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result) template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator  adobe::set_intersection (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, Compare comp) template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator  adobe::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator  adobe::set_intersection (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result) template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator  adobe::set_symmetric_difference (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, Compare comp) template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator  adobe::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator  adobe::set_symmetric_difference (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result) template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator  adobe::set_union (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, Compare comp) template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator  adobe::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator  adobe::set_union (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result) template<class RandomAccessRange, class Compare> void  adobe::sort (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::sort (RandomAccessRange &range) template<class RandomAccessRange, class Compare> void  adobe::sort_heap (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::sort_heap (RandomAccessRange &range) template<class BidirectionalRange, class Predicate> boost::range_iterator< BidirectionalRange >::type  adobe::stable_partition (BidirectionalRange &range, Predicate pred) template<class BidirectionalIterator, class Predicate> BidirectionalIterator  adobe::stable_partition (BidirectionalIterator first, BidirectionalIterator last, Predicate pred) template<class RandomAccessRange, class Compare> void  adobe::stable_sort (RandomAccessRange &range, Compare comp) template<class RandomAccessIterator, class Compare> void  adobe::stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) template<class RandomAccessRange> void  adobe::stable_sort (RandomAccessRange &range) template<class ForwardRange1, class ForwardIterator2> ForwardIterator2  adobe::swap_ranges (ForwardRange1 &range1, ForwardIterator2 first2) template<class InputRange1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator  adobe::transform (const InputRange1 &range1, InputIterator2 first2, OutputIterator result, BinaryOperation binary_op) template<class InputRange1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator  adobe::transform (InputRange1 &range1, InputIterator2 first2, OutputIterator result, BinaryOperation binary_op) template<class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator  adobe::transform (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator result, BinaryOperation binary_op) template<class InputRange, class OutputIterator, class UnaryOperation> OutputIterator  adobe::transform (const InputRange &range, OutputIterator result, UnaryOperation op) template<class InputRange, class OutputIterator, class UnaryOperation> OutputIterator  adobe::transform (InputRange &range, OutputIterator result, UnaryOperation op) template<class InputIterator, class OutputIterator, class UnaryOperation> OutputIterator  adobe::transform (InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op) template<class ForwardRange, class BinaryPredicate> boost::range_iterator< ForwardRange >::type  adobe::unique (ForwardRange &range, BinaryPredicate pred) template<class ForwardIterator, class BinaryPredicate> ForwardIterator  adobe::unique (ForwardIterator first, ForwardIterator last, BinaryPredicate pred) template<class ForwardRange> boost::range_iterator< ForwardRange >::type  adobe::unique (ForwardRange &range) template<class InputRange, class OutputIterator, class BinaryPredicate> OutputIterator  adobe::unique_copy (const InputRange &range, OutputIterator result, BinaryPredicate pred) template<class InputRange, class OutputIterator, class BinaryPredicate> OutputIterator  adobe::unique_copy (InputRange &range, OutputIterator result, BinaryPredicate pred) template<class InputIterator, class OutputIterator, class BinaryPredicate> OutputIterator  adobe::unique_copy (InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred) template<class InputRange, class OutputIterator> OutputIterator  adobe::unique_copy (const InputRange &range, OutputIterator result) template<class InputRange, class OutputIterator> OutputIterator  adobe::unique_copy (InputRange &range, OutputIterator result) template<class ForwardRange, class T, class Compare> boost::range_const_iterator< ForwardRange >::type  adobe::upper_bound (const ForwardRange &range, const T &value, Compare comp) template<class ForwardRange, class T, class Compare> boost::range_iterator< ForwardRange >::type  adobe::upper_bound (ForwardRange &range, const T &value, Compare comp) template<class ForwardIterator, class T, class Compare> ForwardIterator  adobe::upper_bound (ForwardIterator first, ForwardIterator last, const T &value, Compare comp) template<class ForwardRange, class T> boost::range_const_iterator< ForwardRange >::type  adobe::upper_bound (const ForwardRange &range, const T &value) template<class ForwardRange, class T> boost::range_iterator< ForwardRange >::type  adobe::upper_bound (ForwardRange &range, const T &value) Detailed Description Note: These extensions reside in the adobe:: namespace, not the std:: namespace. Function Documentation template<class ForwardRange, class BinaryPredicate> typename boost::range_const_iterator< ForwardRange >::type adobe::adjacent_find ( const ForwardRange &  range, BinaryPredicate  pred   ) See also: STL documentation for adjacent_find Definition at line 267 of file algorithm.hpp. template<class ForwardRange, class BinaryPredicate> typename boost::range_iterator< ForwardRange >::type adobe::adjacent_find ( ForwardRange &  range, BinaryPredicate  pred   ) See also: STL documentation for adjacent_find Definition at line 261 of file algorithm.hpp. template<class ForwardIterator, class BinaryPredicate> ForwardIterator adobe::adjacent_find ( ForwardIterator  first, ForwardIterator  last, BinaryPredicate  pred   ) See also: STL documentation for adjacent_find Definition at line 255 of file algorithm.hpp. template<class ForwardRange> typename boost::range_const_iterator< ForwardRange >::type adobe::adjacent_find ( const ForwardRange &  range  )  See also: STL documentation for adjacent_find Definition at line 249 of file algorithm.hpp. template<class ForwardRange> typename boost::range_iterator< ForwardRange >::type adobe::adjacent_find ( ForwardRange &  range  )  See also: STL documentation for adjacent_find Definition at line 243 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> bool adobe::binary_search ( const ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for binary_search Definition at line 891 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> bool adobe::binary_search ( ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for binary_search Definition at line 885 of file algorithm.hpp. template<class ForwardIterator, class T, class Compare> bool adobe::binary_search ( ForwardIterator  first, ForwardIterator  last, const T &  value, Compare  comp   ) See also: STL documentation for binary_search Definition at line 879 of file algorithm.hpp. template<class ForwardRange, class T> bool adobe::binary_search ( const ForwardRange &  range, const T &  value   ) See also: STL documentation for binary_search Definition at line 873 of file algorithm.hpp. template<class ForwardRange, class T> bool adobe::binary_search ( ForwardRange &  range, const T &  value   ) See also: STL documentation for binary_search Definition at line 867 of file algorithm.hpp. template<class InputRange, class OutputIterator> OutputIterator adobe::copy ( const InputRange &  range, OutputIterator  result   ) See also: STL documentation for copy Definition at line 434 of file algorithm.hpp. template<class InputRange, class OutputIterator> OutputIterator adobe::copy ( InputRange &  range, OutputIterator  result   ) See also: STL documentation for copy Definition at line 428 of file algorithm.hpp. template<class BidirectionalRange1, class BidirectionalIterator2> BidirectionalIterator2 adobe::copy_backward ( const BidirectionalRange1 &  range1, BidirectionalIterator2  result   ) See also: STL documentation for copy_backward Definition at line 446 of file algorithm.hpp. template<class BidirectionalRange1, class BidirectionalIterator2> BidirectionalIterator2 adobe::copy_backward ( BidirectionalRange1 &  range1, BidirectionalIterator2  result   ) See also: STL documentation for copy_backward Definition at line 440 of file algorithm.hpp. template<class InputRange, class T> typename std::iterator_traits< typename boost::range_const_iterator< InputRange >::type >::difference_type adobe::count ( const InputRange &  range, T &  value   ) See also: STL documentation for count Definition at line 279 of file algorithm.hpp. template<class InputRange, class T> typename std::iterator_traits< typename boost::range_iterator< InputRange >::type >::difference_type adobe::count ( InputRange &  range, T &  value   ) See also: STL documentation for count Definition at line 273 of file algorithm.hpp. template<class InputRange, class Predicate> typename std::iterator_traits< typename boost::range_const_iterator< InputRange >::type >::difference_type adobe::count_if ( const InputRange &  range, Predicate  pred   ) See also: STL documentation for count_if Definition at line 297 of file algorithm.hpp. template<class InputRange, class Predicate> typename std::iterator_traits< typename boost::range_iterator< InputRange >::type >::difference_type adobe::count_if ( InputRange &  range, Predicate  pred   ) See also: STL documentation for count_if Definition at line 291 of file algorithm.hpp. template<class InputIterator, class Predicate> typename std::iterator_traits< InputIterator >::difference_type adobe::count_if ( InputIterator  first, InputIterator  last, Predicate  pred   ) See also: STL documentation for count_if Definition at line 285 of file algorithm.hpp. template<class InputRange1, class InputIterator2, class BinaryPredicate> bool adobe::equal ( const InputRange1 &  range1, InputIterator2  first2, BinaryPredicate  pred   ) See also: STL documentation for equal Definition at line 350 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class BinaryPredicate> bool adobe::equal ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, BinaryPredicate  pred   ) See also: STL documentation for equal Definition at line 344 of file algorithm.hpp. template<class InputRange1, class InputIterator2> bool adobe::equal ( const InputRange1 &  range1, InputIterator2  first2   ) See also: STL documentation for equal Definition at line 338 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> std::pair< typename boost::range_const_iterator< ForwardRange >::type, typename boost::range_const_iterator< ForwardRange >::type > adobe::equal_range ( const ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for equal_range Definition at line 861 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> std::pair< typename boost::range_iterator< ForwardRange >::type, typename boost::range_iterator< ForwardRange >::type > adobe::equal_range ( ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for equal_range Definition at line 854 of file algorithm.hpp. template<class ForwardIterator, class T, class Compare> std::pair< ForwardIterator, ForwardIterator > adobe::equal_range ( ForwardIterator  first, ForwardIterator  last, const T &  value, Compare  comp   ) See also: STL documentation for equal_range Definition at line 847 of file algorithm.hpp. template<class ForwardRange, class T> std::pair< typename boost::range_const_iterator< ForwardRange >::type, typename boost::range_const_iterator< ForwardRange >::type > adobe::equal_range ( const ForwardRange &  range, const T &  value   ) See also: STL documentation for equal_range Definition at line 841 of file algorithm.hpp. template<class ForwardRange, class T> std::pair< typename boost::range_iterator< ForwardRange >::type, typename boost::range_iterator< ForwardRange >::type > adobe::equal_range ( ForwardRange &  range, const T &  value   ) See also: STL documentation for equal_range Definition at line 834 of file algorithm.hpp. template<class ForwardRange, class T> void adobe::fill ( ForwardRange &  range, const T &  value   ) See also: STL documentation for fill Definition at line 549 of file algorithm.hpp. template<class InputRange, class T> typename boost::range_const_iterator< InputRange >::type adobe::find ( const InputRange &  range, const T &  value   ) See also: STL documentation for find Definition at line 134 of file algorithm.hpp. template<class InputRange, class T> typename boost::range_iterator< InputRange >::type adobe::find ( InputRange &  range, const T &  value   ) See also: STL documentation for find Definition at line 128 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> typename boost::range_const_iterator< ForwardRange1 >::type adobe::find_end ( const ForwardRange1 &  range1, const ForwardRange2 &  range2, BinaryPredicate  comp   ) See also: STL documentation for find_end Definition at line 190 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> typename boost::range_iterator< ForwardRange1 >::type adobe::find_end ( ForwardRange1 &  range1, const ForwardRange2 &  range2, BinaryPredicate  comp   ) See also: STL documentation for find_end Definition at line 180 of file algorithm.hpp. template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 adobe::find_end ( ForwardIterator1  first1, ForwardIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2, BinaryPredicate  comp   ) See also: STL documentation for find_end Definition at line 172 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2> typename boost::range_const_iterator< ForwardRange1 >::type adobe::find_end ( const ForwardRange1 &  range1, const ForwardRange2 &  range2   ) See also: STL documentation for find_end Definition at line 165 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2> typename boost::range_iterator< ForwardRange1 >::type adobe::find_end ( ForwardRange1 &  range1, const ForwardRange2 &  range2   ) See also: STL documentation for find_end Definition at line 158 of file algorithm.hpp. template<class InputRange, class ForwardRange, class BinaryPredicate> typename boost::range_const_iterator< InputRange >::type adobe::find_first_of ( const InputRange &  range1, const ForwardRange &  range2, BinaryPredicate  comp   ) See also: STL documentation for find_first_of Definition at line 233 of file algorithm.hpp. template<class InputRange, class ForwardRange, class BinaryPredicate> typename boost::range_iterator< InputRange >::type adobe::find_first_of ( InputRange &  range1, const ForwardRange &  range2, BinaryPredicate  comp   ) See also: STL documentation for find_first_of Definition at line 223 of file algorithm.hpp. template<class InputIterator, class ForwardIterator, class BinaryPredicate> InputIterator adobe::find_first_of ( InputIterator  first1, InputIterator  last1, ForwardIterator  first2, ForwardIterator  last2, BinaryPredicate  comp   ) See also: STL documentation for find_first_of Definition at line 214 of file algorithm.hpp. template<class InputRange, class ForwardRange> typename boost::range_const_iterator< InputRange >::type adobe::find_first_of ( const InputRange &  range1, const ForwardRange &  range2   ) See also: STL documentation for find_first_of Definition at line 207 of file algorithm.hpp. template<class InputRange, class ForwardRange> typename boost::range_iterator< InputRange >::type adobe::find_first_of ( InputRange &  range1, const ForwardRange &  range2   ) See also: STL documentation for find_first_of Definition at line 200 of file algorithm.hpp. template<class InputRange, class Predicate> typename boost::range_const_iterator< InputRange >::type adobe::find_if ( const InputRange &  range, Predicate  pred   ) See also: STL documentation for find_if Definition at line 152 of file algorithm.hpp. template<class InputRange, class Predicate> typename boost::range_iterator< InputRange >::type adobe::find_if ( InputRange &  range, Predicate  pred   ) See also: STL documentation for find_if Definition at line 146 of file algorithm.hpp. template<class InputIterator, class Predicate> InputIterator adobe::find_if ( InputIterator  first, InputIterator  last, Predicate  pred   ) See also: STL documentation for find_if Definition at line 140 of file algorithm.hpp. template<class ForwardRange, class Generator> void adobe::generate ( ForwardRange &  range, Generator  gen   ) See also: STL documentation for generate Definition at line 555 of file algorithm.hpp. template<class InputRange1, class InputRange2, class Compare> bool adobe::includes ( const InputRange1 &  range1, const InputRange2 &  range2, Compare  comp   ) See also: STL documentation for includes Definition at line 937 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class Compare> bool adobe::includes ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, Compare  comp   ) See also: STL documentation for includes Definition at line 928 of file algorithm.hpp. template<class InputRange1, class InputRange2> bool adobe::includes ( const InputRange1 &  range1, const InputRange2 &  range2   ) See also: STL documentation for includes Definition at line 921 of file algorithm.hpp. template<class InputRange1, class InputRange2, class Compare> bool adobe::lexicographical_compare ( const InputRange1 &  range1, const InputRange2 &  range2, Compare  comp   ) See also: STL documentation for lexicographical_compare Definition at line 1209 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class Compare> bool adobe::lexicographical_compare ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, Compare  comp   ) See also: STL documentation for lexicographical_compare Definition at line 1200 of file algorithm.hpp. template<class InputRange1, class InputRange2> bool adobe::lexicographical_compare ( const InputRange1 &  range1, const InputRange2 &  range2   ) See also: STL documentation for lexicographical_compare Definition at line 1193 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> typename boost::range_const_iterator< ForwardRange >::type adobe::lower_bound ( const ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for lower_bound Definition at line 797 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> typename boost::range_iterator< ForwardRange >::type adobe::lower_bound ( ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for lower_bound Definition at line 791 of file algorithm.hpp. template<class ForwardIterator, class T, class Compare> ForwardIterator adobe::lower_bound ( ForwardIterator  first, ForwardIterator  last, const T &  value, Compare  comp   ) See also: STL documentation for lower_bound Definition at line 785 of file algorithm.hpp. template<class ForwardRange, class T> typename boost::range_const_iterator< ForwardRange >::type adobe::lower_bound ( const ForwardRange &  range, const T &  value   ) See also: STL documentation for lower_bound Definition at line 779 of file algorithm.hpp. template<class ForwardRange, class T> typename boost::range_iterator< ForwardRange >::type adobe::lower_bound ( ForwardRange &  range, const T &  value   ) See also: STL documentation for lower_bound Definition at line 773 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::make_heap ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for make_heap Definition at line 1089 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::make_heap ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for make_heap Definition at line 1083 of file algorithm.hpp. template<class RandomAccessRange> void adobe::make_heap ( RandomAccessRange &  range  )  See also: STL documentation for make_heap Definition at line 1077 of file algorithm.hpp. template<class T, class Compare> const T & adobe::max ( const T &  a, const T &  b, Compare  comp   ) See also: STL documentation for max Definition at line 1123 of file algorithm.hpp. template<class ForwardRange, class Compare> typename boost::range_const_iterator< ForwardRange >::type adobe::max_element ( const ForwardRange &  range, Compare  comp   ) See also: STL documentation for max_element Definition at line 1187 of file algorithm.hpp. template<class ForwardRange, class Compare> typename boost::range_iterator< ForwardRange >::type adobe::max_element ( ForwardRange &  range, Compare  comp   ) See also: STL documentation for max_element Definition at line 1181 of file algorithm.hpp. template<class ForwardIterator, class Compare> ForwardIterator adobe::max_element ( ForwardIterator  first, ForwardIterator  last, Compare  comp   ) See also: STL documentation for max_element Definition at line 1175 of file algorithm.hpp. template<class ForwardRange> typename boost::range_const_iterator< ForwardRange >::type adobe::max_element ( const ForwardRange &  range  )  See also: STL documentation for max_element Definition at line 1169 of file algorithm.hpp. template<class ForwardRange> typename boost::range_iterator< ForwardRange >::type adobe::max_element ( ForwardRange &  range  )  See also: STL documentation for max_element Definition at line 1163 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator adobe::merge ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result, Compare  comp   ) See also: STL documentation for merge Definition at line 913 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator adobe::merge ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, OutputIterator  result, Compare  comp   ) See also: STL documentation for merge Definition at line 905 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator adobe::merge ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result   ) See also: STL documentation for merge Definition at line 897 of file algorithm.hpp. template<class T, class Compare> const T & adobe::min ( const T &  a, const T &  b, Compare  comp   ) See also: STL documentation for min Definition at line 1113 of file algorithm.hpp. template<class ForwardRange, class Compare> typename boost::range_const_iterator< ForwardRange >::type adobe::min_element ( const ForwardRange &  range, Compare  comp   ) See also: STL documentation for min_element Definition at line 1157 of file algorithm.hpp. template<class ForwardRange, class Compare> typename boost::range_iterator< ForwardRange >::type adobe::min_element ( ForwardRange &  range, Compare  comp   ) See also: STL documentation for min_element Definition at line 1151 of file algorithm.hpp. template<class ForwardIterator, class Compare> ForwardIterator adobe::min_element ( ForwardIterator  first, ForwardIterator  last, Compare  comp   ) See also: STL documentation for min_element Definition at line 1145 of file algorithm.hpp. template<class ForwardRange> typename boost::range_const_iterator< ForwardRange >::type adobe::min_element ( const ForwardRange &  range  )  See also: STL documentation for min_element Definition at line 1139 of file algorithm.hpp. template<class ForwardRange> typename boost::range_iterator< ForwardRange >::type adobe::min_element ( ForwardRange &  range  )  See also: STL documentation for min_element Definition at line 1133 of file algorithm.hpp. template<class InputRange1, class InputIterator2, class BinaryPredicate> std::pair< typename boost::range_const_iterator< InputRange1 >::type, InputIterator2 > adobe::mismatch ( const InputRange1 &  range1, InputIterator2  first2, BinaryPredicate  pred   ) See also: STL documentation for mismatch Definition at line 330 of file algorithm.hpp. template<class InputRange1, class InputIterator2, class BinaryPredicate> std::pair< typename boost::range_iterator< InputRange1 >::type, InputIterator2 > adobe::mismatch ( InputRange1 &  range1, InputIterator2  first2, BinaryPredicate  pred   ) See also: STL documentation for mismatch Definition at line 322 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class BinaryPredicate> std::pair< InputIterator1, InputIterator2 > adobe::mismatch ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, BinaryPredicate  pred   ) See also: STL documentation for mismatch Definition at line 315 of file algorithm.hpp. template<class InputRange1, class InputIterator2> std::pair< typename boost::range_const_iterator< InputRange1 >::type, InputIterator2 > adobe::mismatch ( const InputRange1 &  range1, InputIterator2  first2   ) See also: STL documentation for mismatch Definition at line 309 of file algorithm.hpp. template<class InputRange1, class InputIterator2> std::pair< typename boost::range_iterator< InputRange1 >::type, InputIterator2 > adobe::mismatch ( InputRange1 &  range1, InputIterator2  first2   ) See also: STL documentation for mismatch Definition at line 303 of file algorithm.hpp. template<class BidirectionalRange, class Compare> bool adobe::next_permutation ( BidirectionalRange &  range, Compare  comp   ) See also: STL documentation for next_permutation Definition at line 1229 of file algorithm.hpp. template<class BidirectionalIterator, class Compare> bool adobe::next_permutation ( BidirectionalIterator  first, BidirectionalIterator  last, Compare  comp   ) See also: STL documentation for next_permutation Definition at line 1223 of file algorithm.hpp. template<class BidirectionalRange> bool adobe::next_permutation ( BidirectionalRange &  range  )  See also: STL documentation for next_permutation Definition at line 1217 of file algorithm.hpp. template<class InputRange, class RandomAccessRange, class Compare> void adobe::partial_sort_copy ( const InputRange &  range, RandomAccessRange &  result_range, Compare  comp   ) See also: STL documentation for partial_sort_copy Definition at line 765 of file algorithm.hpp. template<class InputRange, class RandomAccessRange, class Compare> void adobe::partial_sort_copy ( InputRange &  range, RandomAccessRange &  result_range, Compare  comp   ) See also: STL documentation for partial_sort_copy Definition at line 757 of file algorithm.hpp. template<class InputIterator, class RandomAccessIterator, class Compare> void adobe::partial_sort_copy ( InputIterator  first, InputIterator  last, RandomAccessIterator  result_first, RandomAccessIterator  result_last, Compare  comp   ) See also: STL documentation for partial_sort_copy Definition at line 749 of file algorithm.hpp. template<class InputRange, class RandomAccessRange> void adobe::partial_sort_copy ( const InputRange &  range, RandomAccessRange &  result_range   ) See also: STL documentation for partial_sort_copy Definition at line 742 of file algorithm.hpp. template<class InputRange, class RandomAccessRange> void adobe::partial_sort_copy ( InputRange &  range, RandomAccessRange &  result_range   ) See also: STL documentation for partial_sort_copy Definition at line 735 of file algorithm.hpp. template<class BidirectionalRange, class Predicate> typename boost::range_iterator< BidirectionalRange >::type adobe::partition ( BidirectionalRange &  range, Predicate  pred   ) See also: STL documentation for partition Definition at line 681 of file algorithm.hpp. template<class BidirectionalIterator, class Predicate> BidirectionalIterator adobe::partition ( BidirectionalIterator  first, BidirectionalIterator  last, Predicate  pred   ) See also: STL documentation for partition Definition at line 675 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::pop_heap ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for pop_heap Definition at line 1071 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::pop_heap ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for pop_heap Definition at line 1065 of file algorithm.hpp. template<class RandomAccessRange> void adobe::pop_heap ( RandomAccessRange &  range  )  See also: STL documentation for pop_heap Definition at line 1059 of file algorithm.hpp. template<class BidirectionalRange, class Compare> bool adobe::prev_permutation ( BidirectionalRange &  range, Compare  comp   ) See also: STL documentation for prev_permutation Definition at line 1247 of file algorithm.hpp. template<class BidirectionalIterator, class Compare> bool adobe::prev_permutation ( BidirectionalIterator  first, BidirectionalIterator  last, Compare  comp   ) See also: STL documentation for prev_permutation Definition at line 1241 of file algorithm.hpp. template<class BidirectionalRange> bool adobe::prev_permutation ( BidirectionalRange &  range  )  See also: STL documentation for prev_permutation Definition at line 1235 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::push_heap ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for push_heap Definition at line 1053 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::push_heap ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for push_heap Definition at line 1047 of file algorithm.hpp. template<class RandomAccessRange> void adobe::push_heap ( RandomAccessRange &  range  )  See also: STL documentation for push_heap Definition at line 1041 of file algorithm.hpp. template<class RandomAccessRange, class RandomNumberGenerator> void adobe::random_shuffle ( RandomAccessRange &  range, RandomNumberGenerator &  rand   ) See also: STL documentation for random_shuffle Definition at line 669 of file algorithm.hpp. template<class RandomAccessIterator, class RandomNumberGenerator> void adobe::random_shuffle ( RandomAccessIterator  first, RandomAccessIterator  last, RandomNumberGenerator &  rand   ) See also: STL documentation for random_shuffle Definition at line 663 of file algorithm.hpp. template<class RandomAccessRange> void adobe::random_shuffle ( RandomAccessRange &  range  )  See also: STL documentation for random_shuffle Definition at line 657 of file algorithm.hpp. template<class InputRange, class T> typename boost::range_iterator< InputRange >::type adobe::remove ( InputRange &  range, const T &  value   ) See also: STL documentation for remove Definition at line 561 of file algorithm.hpp. template<class InputRange, class OutputIterator, class T> typename boost::range_const_iterator< InputRange >::type adobe::remove_copy ( const InputRange &  range, OutputIterator  result, const T &  value   ) See also: STL documentation for remove_copy Definition at line 585 of file algorithm.hpp. template<class InputRange, class OutputIterator, class T> typename boost::range_iterator< InputRange >::type adobe::remove_copy ( InputRange &  range, OutputIterator  result, const T &  value   ) See also: STL documentation for remove_copy Definition at line 579 of file algorithm.hpp. template<class InputRange, class OutputIterator, class Predicate> typename boost::range_const_iterator< InputRange >::type adobe::remove_copy_if ( const InputRange &  range, OutputIterator  result, Predicate  pred   ) See also: STL documentation for remove_copy_if Definition at line 603 of file algorithm.hpp. template<class InputRange, class OutputIterator, class Predicate> typename boost::range_iterator< InputRange >::type adobe::remove_copy_if ( InputRange &  range, OutputIterator  result, Predicate  pred   ) See also: STL documentation for remove_copy_if Definition at line 597 of file algorithm.hpp. template<class InputIterator, class OutputIterator, class Predicate> InputIterator adobe::remove_copy_if ( InputIterator  first, InputIterator  last, OutputIterator  result, Predicate  pred   ) See also: STL documentation for remove_copy_if Definition at line 591 of file algorithm.hpp. template<class InputRange, class Predicate> typename boost::range_iterator< InputRange >::type adobe::remove_if ( InputRange &  range, Predicate  pred   ) See also: STL documentation for remove_if Definition at line 573 of file algorithm.hpp. template<class InputIterator, class Predicate> InputIterator adobe::remove_if ( InputIterator  first, InputIterator  last, Predicate  pred   ) See also: STL documentation for remove_if Definition at line 567 of file algorithm.hpp. template<class ForwardRange, class T> void adobe::replace ( ForwardRange &  range, const T &  old_value, const T &  new_value   ) See also: STL documentation for replace Definition at line 501 of file algorithm.hpp. template<class ForwardRange, class OutputIterator, class T> OutputIterator adobe::replace_copy ( const ForwardRange &  range, OutputIterator  result, const T &  old_value, const T &  new_value   ) See also: STL documentation for replace_copy Definition at line 525 of file algorithm.hpp. template<class ForwardRange, class OutputIterator, class T> OutputIterator adobe::replace_copy ( ForwardRange &  range, OutputIterator  result, const T &  old_value, const T &  new_value   ) See also: STL documentation for replace_copy Definition at line 519 of file algorithm.hpp. template<class ForwardRange, class OutputIterator, class Predicate, class T> OutputIterator adobe::replace_copy_if ( const ForwardRange &  range, OutputIterator  result, Predicate  pred, const T &  new_value   ) See also: STL documentation for replace_copy_if Definition at line 543 of file algorithm.hpp. template<class ForwardRange, class OutputIterator, class Predicate, class T> OutputIterator adobe::replace_copy_if ( ForwardRange &  range, OutputIterator  result, Predicate  pred, const T &  new_value   ) See also: STL documentation for replace_copy_if Definition at line 537 of file algorithm.hpp. template<class ForwardIterator, class OutputIterator, class Predicate, class T> OutputIterator adobe::replace_copy_if ( ForwardIterator  first, ForwardIterator  last, OutputIterator  result, Predicate  pred, const T &  new_value   ) See also: STL documentation for replace_copy_if Definition at line 531 of file algorithm.hpp. template<class ForwardRange, class Predicate, class T> void adobe::replace_if ( ForwardRange &  range, Predicate  pred, const T &  new_value   ) See also: STL documentation for replace_if Definition at line 513 of file algorithm.hpp. template<class ForwardIterator, class Predicate, class T> void adobe::replace_if ( ForwardIterator  first, ForwardIterator  last, Predicate  pred, const T &  new_value   ) See also: STL documentation for replace_if Definition at line 507 of file algorithm.hpp. template<class BidirectionalRange> void adobe::reverse ( BidirectionalRange &  range  )  See also: STL documentation for reverse Definition at line 69 of file reverse.hpp. template<class BidirectionalRange, class OutputIterator> void adobe::reverse_copy ( const BidirectionalRange &  range, OutputIterator  result   ) See also: STL documentation for reverse_copy Definition at line 81 of file reverse.hpp. template<class BidirectionalRange, class OutputIterator> void adobe::reverse_copy ( BidirectionalRange &  range, OutputIterator  result   ) See also: STL documentation for reverse_copy Definition at line 75 of file reverse.hpp. template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> typename boost::range_const_iterator< ForwardRange1 >::type adobe::search ( const ForwardRange1 &  range1, const ForwardRange2 &  range2, BinaryPredicate  pred   ) See also: STL documentation for search Definition at line 388 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2, class BinaryPredicate> typename boost::range_iterator< ForwardRange1 >::type adobe::search ( ForwardRange1 &  range1, const ForwardRange2 &  range2, BinaryPredicate  pred   ) See also: STL documentation for search Definition at line 378 of file algorithm.hpp. template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 adobe::search ( ForwardIterator1  first1, ForwardIterator1  last1, ForwardIterator2  first2, ForwardIterator2  last2, BinaryPredicate  pred   ) See also: STL documentation for search Definition at line 370 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2> typename boost::range_iterator< ForwardRange1 >::type adobe::search ( ForwardRange1 &  range1, const ForwardRange2 &  range2   ) See also: STL documentation for search Definition at line 363 of file algorithm.hpp. template<class ForwardRange1, class ForwardRange2> typename boost::range_const_iterator< ForwardRange1 >::type adobe::search ( const ForwardRange1 &  range1, const ForwardRange2 &  range2   ) See also: STL documentation for search Definition at line 356 of file algorithm.hpp. template<class ForwardRange, class Size, class T, class BinaryPredicate> typename boost::range_const_iterator< ForwardRange >::type adobe::search_n ( const ForwardRange &  range, Size  count, const T &  value, BinaryPredicate  pred   ) See also: STL documentation for search_n Definition at line 422 of file algorithm.hpp. template<class ForwardRange, class Size, class T, class BinaryPredicate> typename boost::range_iterator< ForwardRange >::type adobe::search_n ( ForwardRange &  range, Size  count, const T &  value, BinaryPredicate  pred   ) See also: STL documentation for search_n Definition at line 416 of file algorithm.hpp. template<class ForwardIterator, class Size, class T, class BinaryPredicate> ForwardIterator adobe::search_n ( ForwardIterator  first, ForwardIterator  last, Size  count, const T &  value, BinaryPredicate  pred   ) See also: STL documentation for search_n Definition at line 410 of file algorithm.hpp. template<class ForwardRange, class Size, class T> typename boost::range_const_iterator< ForwardRange >::type adobe::search_n ( const ForwardRange &  range, Size  count, const T &  value   ) See also: STL documentation for search_n Definition at line 404 of file algorithm.hpp. template<class ForwardRange, class Size, class T> typename boost::range_iterator< ForwardRange >::type adobe::search_n ( ForwardRange &  range, Size  count, const T &  value   ) See also: STL documentation for search_n Definition at line 398 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator adobe::set_difference ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_difference Definition at line 1009 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator adobe::set_difference ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_difference Definition at line 1001 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator adobe::set_difference ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result   ) See also: STL documentation for set_difference Definition at line 993 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator adobe::set_intersection ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_intersection Definition at line 985 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator adobe::set_intersection ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_intersection Definition at line 977 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator adobe::set_intersection ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result   ) See also: STL documentation for set_intersection Definition at line 969 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator adobe::set_symmetric_difference ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_symmetric_difference Definition at line 1033 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator adobe::set_symmetric_difference ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_symmetric_difference Definition at line 1025 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator adobe::set_symmetric_difference ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result   ) See also: STL documentation for set_symmetric_difference Definition at line 1017 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator, class Compare> OutputIterator adobe::set_union ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_union Definition at line 961 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator adobe::set_union ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator2  last2, OutputIterator  result, Compare  comp   ) See also: STL documentation for set_union Definition at line 953 of file algorithm.hpp. template<class InputRange1, class InputRange2, class OutputIterator> OutputIterator adobe::set_union ( const InputRange1 &  range1, const InputRange2 &  range2, OutputIterator  result   ) See also: STL documentation for set_union Definition at line 945 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::sort ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for sort Definition at line 711 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::sort ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for sort Definition at line 705 of file algorithm.hpp. template<class RandomAccessRange> void adobe::sort ( RandomAccessRange &  range  )  See also: STL documentation for sort Definition at line 699 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::sort_heap ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for sort_heap Definition at line 1107 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::sort_heap ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for sort_heap Definition at line 1101 of file algorithm.hpp. template<class RandomAccessRange> void adobe::sort_heap ( RandomAccessRange &  range  )  See also: STL documentation for sort_heap Definition at line 1095 of file algorithm.hpp. template<class BidirectionalRange, class Predicate> typename boost::range_iterator< BidirectionalRange >::type adobe::stable_partition ( BidirectionalRange &  range, Predicate  pred   ) See also: STL documentation for stable_partition Definition at line 693 of file algorithm.hpp. template<class BidirectionalIterator, class Predicate> BidirectionalIterator adobe::stable_partition ( BidirectionalIterator  first, BidirectionalIterator  last, Predicate  pred   ) See also: STL documentation for stable_partition Definition at line 687 of file algorithm.hpp. template<class RandomAccessRange, class Compare> void adobe::stable_sort ( RandomAccessRange &  range, Compare  comp   ) See also: STL documentation for stable_sort Definition at line 729 of file algorithm.hpp. template<class RandomAccessIterator, class Compare> void adobe::stable_sort ( RandomAccessIterator  first, RandomAccessIterator  last, Compare  comp   ) See also: STL documentation for stable_sort Definition at line 723 of file algorithm.hpp. template<class RandomAccessRange> void adobe::stable_sort ( RandomAccessRange &  range  )  See also: STL documentation for stable_sort Definition at line 717 of file algorithm.hpp. template<class ForwardRange1, class ForwardIterator2> ForwardIterator2 adobe::swap_ranges ( ForwardRange1 &  range1, ForwardIterator2  first2   ) See also: STL documentation for swap_ranges Definition at line 452 of file algorithm.hpp. template<class InputRange1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator adobe::transform ( const InputRange1 &  range1, InputIterator2  first2, OutputIterator  result, BinaryOperation  binary_op   ) See also: STL documentation for transform Definition at line 494 of file algorithm.hpp. template<class InputRange1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator adobe::transform ( InputRange1 &  range1, InputIterator2  first2, OutputIterator  result, BinaryOperation  binary_op   ) See also: STL documentation for transform Definition at line 487 of file algorithm.hpp. template<class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> OutputIterator adobe::transform ( InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, OutputIterator  result, BinaryOperation  binary_op   ) See also: STL documentation for transform Definition at line 479 of file algorithm.hpp. template<class InputRange, class OutputIterator, class UnaryOperation> OutputIterator adobe::transform ( const InputRange &  range, OutputIterator  result, UnaryOperation  op   ) See also: STL documentation for transform Definition at line 472 of file algorithm.hpp. template<class InputRange, class OutputIterator, class UnaryOperation> OutputIterator adobe::transform ( InputRange &  range, OutputIterator  result, UnaryOperation  op   ) See also: STL documentation for transform Definition at line 465 of file algorithm.hpp. template<class InputIterator, class OutputIterator, class UnaryOperation> OutputIterator adobe::transform ( InputIterator  first, InputIterator  last, OutputIterator  result, UnaryOperation  op   ) See also: STL documentation for transform Definition at line 458 of file algorithm.hpp. template<class ForwardRange, class BinaryPredicate> typename boost::range_iterator< ForwardRange >::type adobe::unique ( ForwardRange &  range, BinaryPredicate  pred   ) See also: STL documentation for unique Definition at line 621 of file algorithm.hpp. template<class ForwardIterator, class BinaryPredicate> ForwardIterator adobe::unique ( ForwardIterator  first, ForwardIterator  last, BinaryPredicate  pred   ) See also: STL documentation for unique Definition at line 615 of file algorithm.hpp. template<class ForwardRange> typename boost::range_iterator< ForwardRange >::type adobe::unique ( ForwardRange &  range  )  See also: STL documentation for unique Definition at line 609 of file algorithm.hpp. template<class InputRange, class OutputIterator, class BinaryPredicate> OutputIterator adobe::unique_copy ( const InputRange &  range, OutputIterator  result, BinaryPredicate  pred   ) See also: STL documentation for unique_copy Definition at line 651 of file algorithm.hpp. template<class InputRange, class OutputIterator, class BinaryPredicate> OutputIterator adobe::unique_copy ( InputRange &  range, OutputIterator  result, BinaryPredicate  pred   ) See also: STL documentation for unique_copy Definition at line 645 of file algorithm.hpp. template<class InputIterator, class OutputIterator, class BinaryPredicate> OutputIterator adobe::unique_copy ( InputIterator  first, InputIterator  last, OutputIterator  result, BinaryPredicate  pred   ) See also: STL documentation for unique_copy Definition at line 639 of file algorithm.hpp. template<class InputRange, class OutputIterator> OutputIterator adobe::unique_copy ( const InputRange &  range, OutputIterator  result   ) See also: STL documentation for unique_copy Definition at line 633 of file algorithm.hpp. template<class InputRange, class OutputIterator> OutputIterator adobe::unique_copy ( InputRange &  range, OutputIterator  result   ) See also: STL documentation for unique_copy Definition at line 627 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> typename boost::range_const_iterator< ForwardRange >::type adobe::upper_bound ( const ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for upper_bound Definition at line 827 of file algorithm.hpp. template<class ForwardRange, class T, class Compare> typename boost::range_iterator< ForwardRange >::type adobe::upper_bound ( ForwardRange &  range, const T &  value, Compare  comp   ) See also: STL documentation for upper_bound Definition at line 821 of file algorithm.hpp. template<class ForwardIterator, class T, class Compare> ForwardIterator adobe::upper_bound ( ForwardIterator  first, ForwardIterator  last, const T &  value, Compare  comp   ) See also: STL documentation for upper_bound Definition at line 815 of file algorithm.hpp. template<class ForwardRange, class T> typename boost::range_const_iterator< ForwardRange >::type adobe::upper_bound ( const ForwardRange &  range, const T &  value   ) See also: STL documentation for upper_bound Definition at line 809 of file algorithm.hpp. template<class ForwardRange, class T> typename boost::range_iterator< ForwardRange >::type adobe::upper_bound ( ForwardRange &  range, const T &  value   ) See also: STL documentation for upper_bound Definition at line 803 of file algorithm.hpp.

• Company | 
• Online Privacy Policy | 
• Terms of Use | 
• Contact Us | 
• Accessibility | 
• Report Piracy | 
• Permissions & Trademarks | 
• Product License Agreements | 
• Send Feedback

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google