C++ boost::range::remove














































C++ boost::range::remove



Description:
The header 'boost/range/algorithm/remove.hpp'   contains the algorithm remove() in C++ boost library. This function rearranges all the occurrence from a sequence such that elements x from the range returns true for x == val. The function returns an iterator new_last such that [first, new_last) contains no elements equal to val. The range [new_last, last) consists of unspecified elements.

Syntax:
template<class ForwardRange, class Value>
typename range_iterator<ForwardRange>::type
remove(ForwardRange& rng, const Value& val);

template<class ForwardRange, class Value>
typename range_iterator<const ForwardRange>::type
remove(const ForwardRange& rng, const Value& val);

template<range_return_value re, class ForwardRange, class Value>
typename range_return<ForwardRange,re>::type
remove(ForwardRange& rng, const Value& val);

template<range_return_value re, class ForwardRange, class Value>
typename range_return<const ForwardRange,re>::type
remove(const ForwardRange& rng, const Value& val);



Parameters:
The following parameters are accepted by the function:
1.) rng: It specifies the sequence whose elements as to be eliminated.
2.) val: The value to be removed.


The function returns an iterator new_last such that [first, new_last) contains no elements equal to val.


Program:
#include <boost/range/algorithm/remove.hpp>
#include <vector>
#include <iostream>
using namespace std;

int main()
{
   
vector<int> Arr = {1, 2, 5, 9, 5, 7, 5}, Arr1;
    Arr1 = {
1, 1, 1, 1, 1};

   
// remove all the occurrence of 5 from Arr
   
auto Arr_new_size = boost::range::remove(Arr, 5);
   
// remove all the occurrence of 1 from Arr1
   
auto Arr1_new_size = boost::range::remove(Arr1, 1);
   
// Resizing the array to new_last
    Arr.resize(Arr_new_size - Arr.begin());
    Arr1.resize(Arr1_new_size - Arr1.begin());

   
cout << "The elements of Arr after removing are: {";
   
for(auto it = boost::begin(Arr); it != boost::end(Arr); it++)
       
cout << *it << " ";
   
cout << "}";

   
cout << endl << "The elements of Arr1 after removing are: {";
   
for(auto it = boost::begin(Arr1); it != boost::end(Arr1); it++)
       
cout << *it << " ";
   
cout << "}";
}


Output:
The elements of Arr after removing are: {1 2 9 7 }
The elements of Arr1 after removing are: {}


Complexity:
Time Complexity: The time complexity is linear between the first and last elements. There are exactly distance(rng) number of comparisons performed.

Please write on comment section if you find any mistake or for any suggestions.

More Articles of Abhishek Kumar Singh:

Name Views Likes
C++ boost::range::replace_if 1020 0
C++ boost::range::copy_backward 759 1
C++ boost::range::max_element 1234 0
C++ boost::range::inplace_merge 686 0
C++ boost::range::copy 1351 1
C++ boost::algorithm::is_partitioned() 857 1
C++ boost::algorithm::copy_if() 1048 0
C++ boost::range::for_each (version 2) 768 0
C++ boost::range::set_symmetric_difference 684 0
C++ boost::remove_copy_if 769 0
C++ boost::range::set_intersection 1028 0
C++ boost::range::find_end 707 0
C++ boost::range::remove_erase_if 1652 0
C++ boost::range::push_back 1174 0
C++ boost::range::generate 672 0
C++ boost::algorithm::any_of() 739 0
C++ boost::range::insert 737 0
C++ boost::range::remove_erase 948 0
C++ boost::range::reverse 1266 0
C++ boost::algorithm::equal() 775 1
C++ boost::range::copy_n 848 0
C++ boost::range::random_shuffle 1286 1
C++ boost::algorithm::partition_point() 653 0
C++ boost::algorithm::one_of_equal() 545 0
C++ boost::algorithm::all_of() 918 1
C++ boost::range::merge 1059 0
C++ boost::range::reverse_copy 773 0
C++ boost::range::find 781 0
C++ boost::range::fill_n 627 0
Removing duplicate elements from std::vector (using std::unique and std::set) 2477 1
C++ boost::range::equal 739 0
C++ boost::algorithm::iota() 1015 0
C++ boost::range::is_sorted 853 0
test article 800 2
C++ boost::algorithm::is_permutation() 883 1
C++ boost::partial_sum 893 0
C++ boost::range::partial_sort 948 1
C++ boost::range::min_element 1085 0
C++ boost::range::iota 1084 0
C++ boost::range::set_union 736 0
C++ boost::algorithm::partition_copy() 1093 3
C++ boost::range::swap_ranges 634 0
C++ boost::range::for_each 920 0
C++ boost::range::upper_bound 1091 0
C++ boost::range::binary_search 1249 0
C++ boost::algorithm::all_of_equal() 569 0
C++ boost::algorithm::copy_n() 707 1
C++ boost::range::lower_bound 1048 0
C++ boost::algorithm::gather() 1534 0
C++ boost::algorithm::none_of_equal() 612 0
C++ boost::algorithm::one_of() 727 2
C++ boost::range::rotate 877 0
C++ boost::algorithm::any_of_equal() 881 0
Use of Comparator in C++ 2130 0
C++ boost::range::count 828 0
C++ boost::range::replace_copy_if 649 0
C++ boost::range::remove 842 2
C++ boost::remove_if 1463 1
C++ boost::range::nth_element 1155 1
C++ boost::range::partition 759 1
C++ boost::range::erase 672 0
C++ boost::range::fill 908 1
C++ boost::range::find_if 1364 0
C++ boost::range::lexicographical_compare 817 0
C++ boost::algorithm::none_of() 600 0
C++ boost::algorithm::hex() 3753 0
C++ boost::range::replace 751 0
C++ boost::range::replace_copy 825 1
C++ boost::range::set_difference 980 0
C++ boost::range::overwrite 729 0
C++ boost::range::count_if 982 0
C++ boost::range::push_front 674 0
C++ boost::range::includes 670 0
C++ boost::algorithm::is_sorted() 713 0
C++ boost::range::remove_copy 633 1
C++ boost::algorithm::minmax_element 632 1
Deletion of leaf node of a Binary Search Tree 1728 1
Nth Fibonacci Number (Recursive Solution, Dynamic Programming, Iterative Solution 3928 1
C++ boost::range::rotate_copy 664 0

Comments