range_algorithm.h File Reference
#include "stde_common.h"
Include dependency graph for range_algorithm.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| namespace | lass |
| Library for Assembled Shared Sources. | |
| namespace | lass::stde |
| lass extensions to the standard library | |
Functions | |
| template<typename InputRange , typename Op > | |
| Op | lass::stde::for_each_r (InputRange &range, Op op) |
| std::for_each wrapper for ranges | |
| template<typename InputRange , typename T > | |
| InputRange::iterator | lass::stde::find_r (const InputRange &range, const T &value) |
| std::find wrapper for ranges | |
| template<typename InputRange , typename Predicate > | |
| InputRange::iterator | lass::stde::find_if_r (const InputRange &range, Predicate pred) |
| std::find_if wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 > | |
| ForwardRange1::iterator | lass::stde::find_end_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
| std::find_end wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
| ForwardRange1::iterator | lass::stde::find_end_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
| std::find_end wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 > | |
| ForwardRange1::iterator | lass::stde::find_first_of_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
| std::find_first_of wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
| ForwardRange1::iterator | lass::stde::find_first_of_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
| std::find_first_of wrapper for ranges | |
| template<typename ForwardRange > | |
| ForwardRange::iterator | lass::stde::adjacent_find_r (const ForwardRange &range) |
| std::adjacent_find wrapper for ranges | |
| template<typename ForwardRange , typename Predicate > | |
| ForwardRange::iterator | lass::stde::adjacent_find_r (const ForwardRange &range, Predicate pred) |
| std::adjacent_find wrapper for ranges | |
| template<typename InputRange , typename T > | |
| std::iterator_traits< typename InputRange::iterator > ::difference_type | lass::stde::count_r (const InputRange &range, const T &value) |
| std::count wrapper for ranges | |
| template<typename InputRange , typename Predicate > | |
| std::iterator_traits< typename InputRange::iterator > ::difference_type | lass::stde::count_if_r (const InputRange &range, Predicate pred) |
| std::count_if wrapper for ranges | |
| template<typename InputRange1 , typename InputRange2 , typename BinaryPredicate > | |
| std::pair< typename InputRange1::iterator, typename InputRange2::iterator > | lass::stde::mismatch_r (const InputRange1 &range1, const InputRange2 &range2, BinaryPredicate pred) |
| std::mismatch wrapper for ranges | |
| template<typename InputRange1 , typename InputRange2 > | |
| std::pair< typename InputRange1::iterator, typename InputRange2::iterator > | lass::stde::mismatch_r (const InputRange1 &range1, const InputRange2 &range2) |
| std::mismatch wrapper for ranges | |
| template<typename InputRange1 , typename InputRange2 > | |
| bool | lass::stde::equal_r (const InputRange1 &range1, const InputRange2 &range2) |
| std::mismatch wrapper for ranges | |
| template<typename InputRange1 , typename InputRange2 , typename BinaryPredicate > | |
| bool | lass::stde::equal_r (const InputRange1 &range1, const InputRange2 &range2, BinaryPredicate pred) |
| std::mismatch wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 > | |
| ForwardRange1::iterator | lass::stde::search_r (const ForwardRange1 &range1, const ForwardRange2 &range2) |
| std::search wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 , typename BinaryPredicate > | |
| ForwardRange1::iterator | lass::stde::search_r (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
| std::search wrapper for ranges | |
| template<typename ForwardRange , typename Size , typename T > | |
| ForwardRange::iterator | lass::stde::search_n_r (const ForwardRange &range, Size count, const T &value) |
| std::search_n wrapper for ranges | |
| template<typename ForwardRange , typename Size , typename T , typename BinaryPredicate > | |
| ForwardRange::iterator | lass::stde::search_n_r (const ForwardRange &range, Size count, const T &value, BinaryPredicate pred) |
| std::search_n wrapper for ranges | |
| template<typename InputRange , typename OutputIterator > | |
| OutputIterator | lass::stde::copy_r (const InputRange &range, OutputIterator result) |
| std::copy wrapper for ranges | |
| template<typename BidirectionalRange , typename BidirectionalIterator > | |
| BidirectionalIterator | lass::stde::copy_backward_r (const BidirectionalRange &range, BidirectionalIterator result) |
| std::copy_backward wrapper for ranges | |
| template<typename ForwardRange1 , typename ForwardRange2 > | |
| ForwardRange2::iterator | lass::stde::swap_ranges_r (ForwardRange1 &range1, ForwardRange2 &range2) |
| std::swap_ranges wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename UnaryOperation > | |
| OutputIterator | lass::stde::transform_r (const InputRange &range, OutputIterator result, UnaryOperation op) |
| std::transform wrapper for ranges | |
| template<typename InputRange1 , typename InputRange2 , typename OutputIterator , typename BinaryOperation > | |
| OutputIterator | lass::stde::transform_r (const InputRange1 &range1, const InputRange2 &range2, OutputIterator result, BinaryOperation op) |
| std::transform wrapper for ranges | |
| template<typename ForwardRange , typename T > | |
| void | lass::stde::replace_r (ForwardRange &range, const T &old_value, const T &new_value) |
| std::replace wrapper for ranges | |
| template<typename ForwardRange , typename Predicate , typename T > | |
| void | lass::stde::replace_if_r (ForwardRange &range, Predicate pred, const T &new_value) |
| std::replace_if wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename T > | |
| OutputIterator | lass::stde::replace_copy_r (const InputRange &range, OutputIterator result, const T &old_value, const T &new_value) |
| std::replace_copy wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename Predicate , typename T > | |
| OutputIterator | lass::stde::replace_copy_if_r (const InputRange &range, OutputIterator result, Predicate pred, const T &new_value) |
| std::replace_copy_if wrapper for ranges | |
| template<typename ForwardRange , typename T > | |
| void | lass::stde::fill_r (ForwardRange &range, const T &value) |
| std::fill wrapper for ranges | |
| template<typename ForwardRange , typename Generator > | |
| void | lass::stde::generate_r (ForwardRange &range, Generator gen) |
| std::generate wrapper for ranges | |
| template<typename ForwardRange , typename T > | |
| ForwardRange::iterator | lass::stde::remove_r (ForwardRange &range, const T &value) |
| std::remove wrapper for ranges | |
| template<typename ForwardRange , typename Predicate > | |
| ForwardRange::iterator | lass::stde::remove_if_r (ForwardRange &range, Predicate pred) |
| std::remove wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename T > | |
| OutputIterator | lass::stde::remove_copy_r (const InputRange &range, OutputIterator result, const T &value) |
| std::remove_copy wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename Predicate > | |
| OutputIterator | lass::stde::remove_copy_if_r (const InputRange &range, OutputIterator result, Predicate pred) |
| std::remove_copy wrapper for ranges | |
| template<typename ForwardRange > | |
| ForwardRange::iterator | lass::stde::unique_r (ForwardRange &range) |
| std::unique wrapper for ranges | |
| template<typename ForwardRange , typename Predicate > | |
| ForwardRange::iterator | lass::stde::unique_r (ForwardRange &range, Predicate pred) |
| std::unique wrapper for ranges | |
| template<typename InputRange , typename OutputIterator > | |
| OutputIterator | lass::stde::unique_copy_r (const InputRange &range, OutputIterator result) |
| std::unique_copy_r wrapper for ranges | |
| template<typename InputRange , typename OutputIterator , typename Predicate > | |
| OutputIterator | lass::stde::unique_copy_r (const InputRange &range, OutputIterator result, Predicate pred) |
| std::unique_copy_r wrapper for ranges | |
| template<typename BidirectionalRange > | |
| void | lass::stde::reverse_r (BidirectionalRange &range) |
| std::reverse wrapper for ranges | |
| template<typename BidirectionalRange , typename OutputIterator > | |
| OutputIterator | lass::stde::reverse_copy_r (const BidirectionalRange &range, OutputIterator result) |
| std::reverse_copy wrapper for ranges | |
| template<typename ForwardRange > | |
| void | lass::stde::rotate_r (ForwardRange &range, typename ForwardRange::iterator middle) |
| std::rotate wrapper for ranges | |
| template<typename ForwardRange , typename OutputIterator > | |
| void | lass::stde::rotate_copy_r (const ForwardRange &range, typename ForwardRange::iterator middle, OutputIterator result) |
| std::rotate_copy wrapper for ranges | |
| template<typename RandomAccessRange > | |
| void | lass::stde::random_shuffle_r (RandomAccessRange &range) |
| std::random_shuffle wrapper for ranges | |
| template<typename RandomAccessRange , typename RandomNumberGenerator > | |
| void | lass::stde::random_shuffle_r (RandomAccessRange &range, RandomNumberGenerator &rand) |
| std::random_shuffle wrapper for ranges | |
| template<typename BidirectionalRange , typename Predicate > | |
| BidirectionalRange::iterator | lass::stde::partition_r (BidirectionalRange &range, Predicate pred) |
| std::partition wrapper for ranges | |
| template<typename BidirectionalRange , typename Predicate > | |
| BidirectionalRange::iterator | lass::stde::stable_partition_r (BidirectionalRange &range, Predicate pred) |
| std::stable_partition wrapper for ranges | |
Detailed Description
*** BEGIN LICENSE INFORMATION ***The contents of this file are subject to the Common Public Attribution License Version 1.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://lass.sourceforge.net/cpal-license. The License is based on the Mozilla Public License Version 1.1 but Sections 14 and 15 have been added to cover use of software over a computer network and provide for limited attribution for the Original Developer. In addition, Exhibit A has been modified to be consistent with Exhibit B.
Software distributed under the License is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the specific language governing rights and limitations under the License.
The Original Code is LASS - Library of Assembled Shared Sources.
The Initial Developer of the Original Code is Bram de Greve and Tom De Muer. The Original Developer is the Initial Developer.
All portions of the code written by the Initial Developer are: Copyright (C) 2004-2007 the Initial Developer. All Rights Reserved.
Contributor(s):
Alternatively, the contents of this file may be used under the terms of the GNU General Public License Version 2 or later (the GPL), in which case the provisions of GPL are applicable instead of those above. If you wish to allow use of your version of this file only under the terms of the GPL and not to allow others to use your version of this file under the CPAL, indicate your decision by deleting the provisions above and replace them with the notice and other provisions required by the GPL License. If you do not delete the provisions above, a recipient may use your version of this file under either the CPAL or the GPL.
*** END LICENSE INFORMATION ***
Definition in file range_algorithm.h.
