#include <utility>
Go to the source code of this file.
|
| template<class fwd_it_t , class predicate_t > |
| fwd_it_t | qx::remove_if_i (fwd_it_t itBegin, fwd_it_t itEnd, const predicate_t &predicate, size_t nStartIndex=0) |
| | std::remove_if with index instead of data reference More...
|
| |
| template<class container_t , class predicate_t > |
| auto | qx::remove_if_i (container_t &container, const predicate_t &predicate) |
| | std::remove_if with index instead of data reference More...
|
| |
- Author
- Khrapov
- Date
- 6.08.2022
- Copyright
- © Nick Khrapov, 2022. All right reserved.
Definition in file remove.h.
◆ remove_if_i() [1/2]
template<class container_t , class predicate_t >
| auto qx::remove_if_i |
( |
container_t & |
container, |
|
|
const predicate_t & |
predicate |
|
) |
| |
std::remove_if with index instead of data reference
- Template Parameters
-
| container_t | - container type |
| predicate_t | - predicate type |
- Parameters
-
| container | - the range of elements |
| predicate | - unary predicate which returns true if the element should be removed |
- Return values
-
| - | past-the-end iterator for the new range of values |
Definition at line 50 of file remove.h.
◆ remove_if_i() [2/2]
template<class fwd_it_t , class predicate_t >
| fwd_it_t qx::remove_if_i |
( |
fwd_it_t |
itBegin, |
|
|
fwd_it_t |
itEnd, |
|
|
const predicate_t & |
predicate, |
|
|
size_t |
nStartIndex = 0 |
|
) |
| |
std::remove_if with index instead of data reference
- Template Parameters
-
| fwd_it_t | - iterator type |
| predicate_t | - predicate type |
- Parameters
-
| itBegin | - the range of elements begin iterator |
| itEnd | - the range of elements end iterator |
| predicate | - unary predicate which returns true if the element should be removed |
| nStartIndex | - we can't find out the index of itBegin so you should specify it |
- Return values
-
| - | past-the-end iterator for the new range of values |
Definition at line 27 of file remove.h.
