简单的程序诠释C++ STL算法系列之十四:copy_backward

本文介绍了C++ STL中的copy_backward算法,该算法与copy类似,但复制方向相反,从最后一个元素开始向前复制。通过示例展示了如何使用copy_backward进行元素的复制,并提供了完整的代码实现。

前文中展示了copy的魅力,现在我们来看一下它的孪生兄弟copy_backward,copy_backward算法与copy在行为方面相似,只不过它的复制过程与copy背道而驰,其复制过程是从最后的元素开始复制,直到首元素复制出来。也就是说,复制操作是从last-1开始,直到first结束。这些元素也被从后向前复制到目标容器中,从result-1开始,一直复制last-first个元素。举个简单的例子:已知vector {0, 1, 2, 3, 4, 5},现我们需要把最后三个元素(3, 4, 5)复制到前面三个(0, 1, 2)位置中,那我们可以这样设置:将first设置值3的位置,将last设置为5的下一个位置,而result设置为3的位置,这样,就会先将值5复制到2的位置,然后4复制到1的位置,最后3复制到0的位置,得到我们所要的序列{3, 4, 5, 3, 4, 5}。下面我们来看一下copy_backward的函数原型:

函数原型:

template<class BidirectionalIterator1, class BidirectionalIterator2> BidirectionalIterator2 copy_backward ( BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 result);

参数:

first, last
指出被复制的元素的区间范围[first,last).
result
指出复制到目标区间的具体位置[result-(last-first),result)

返回值:

返回一个迭代器,指出已被复制元素区间的起始位置

程序示例:

先通过一个简单的示例来阐述copy_backward的使用方法,程序比较简单,代码中做了详细的说明,在此不再累赘。

/******************************************************************* * Copyright (C) Jerry Jiang * * File Name : copy_backward.cpp * Author : Jerry Jiang * Create Time : 2012-3-21 23:14:57 * Mail : jbiaojerry@gmail.com * Blog : http://blog.youkuaiyun.com/jerryjbiao * * Description : 简单的程序诠释C++ STL算法系列之十四 * 变易算法 : 反向复制copy_backward * ******************************************************************/ #include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { vector<int> myvector; vector<int>::iterator iter; //为容器myvector赋初始值:10 20 30 40 50 for ( int i = 1; i <= 5; ++i ) { myvector.push_back( i*10 ); } //将myvector容器的大小增加3个单元 myvector.resize( myvector.size()+3 ); //将容器元素20、10拷贝到第八、第七个单元中:10 20 30 40 50 0 10 20 //注意copy_backward是反向复制,先将20拷贝到第八个单元,再将10拷贝到第七个单元 copy_backward( myvector.begin(), myvector.begin()+2, myvector.end() ); for ( iter = myvector.begin(); iter != myvector.end(); ++iter ) { cout << " " << *iter; } cout << endl; //清除myvector容器 myvector.clear(); //还原容器myvector的初始值:10 20 30 40 50 for ( i = 1; i <= 5; ++i ) { myvector.push_back( i*10 ); } //将容器元素40、50覆盖10、20, 即:40 50 30 40 50: copy_backward( myvector.end()-2, myvector.end(), myvector.end()-3 ); for ( iter = myvector.begin(); iter != myvector.end(); ++iter ) { cout << " " << *iter; } cout << endl; return 0; }


通过上例的简单介绍相信大家对copy_backward 的基本使用不再陌生了吧,^_^,下面我们结合前面所讲的for_search算法来巩固一下copy_backward的使用。

/******************************************************************* * Copyright (C) Jerry Jiang * * File Name : copy_backward02.cpp * Author : Jerry Jiang * Create Time : 2012-3-21 23:48:14 * Mail : jbiaojerry@gmail.com * Blog : http://blog.youkuaiyun.com/jerryjbiao * * Description : 简单的程序诠释C++ STL算法系列之十四 * 变易算法 : 反向复制copy_backward * ******************************************************************/ #include <iostream> #include <algorithm> #include <vector> #include <iterator> #include <string> using namespace std; class output_element { public: //重载运算符() void operator() (string element) { cout << element << ( _line_cnt++ % 7 ? " " : "\n\t"); //格式化输出,即每7个换行和制表位 } static void reset_line_cnt() { _line_cnt = 1; } private: static int _line_cnt; }; int output_element::_line_cnt = 1; //定义并初始静态数据成员 int main() { string sa[] = { "The", "light", "untonusred", "hair", "grained", "and", "hued", "like", "pale", "oak" }; vector<string> svec(sa, sa+10); //还记得for_each吧,呵呵,这里用它来作为输出 //for_each具体用法参考 http://blog.youkuaiyun.com/jerryjbiao/article/details/6827508 cout << "Original list of strings:\n\t"; for_each( svec.begin(), svec.end(), output_element() ); cout << "\n" << endl; //将"The", "light", "untonusred", "hair","grained", //"and", "hued"后移三个单元覆盖了"like", "pale", "oak" copy_backward(svec.begin(), svec.end()-3, svec.end()); output_element::reset_line_cnt(); cout << "sequence after " << "copy_backward(svec.begin(), svec.end()-3, svec.end()): \n\t"; for_each( svec.begin(), svec.end(), output_element() ); cout << "\n" << endl; return 0; }

*******************************************************************************************************************************

C++经典书目索引及资源下载:http://blog.youkuaiyun.com/jerryjbiao/article/details/7358796

********************************************************************************************************************************

g++.exe D:\clion\kexin\countMid\C++_multi_files_20251012165246089\main.cpp -o main In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/algorithm:61, from D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:7, from D:\clion\kexin\countMid\C++_multi_files_20251012165246089\main.cpp:12: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1859:25: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1950:31: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1824:24: error: assignment of read-only location '__first.__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator*()' 1824 | *__first = _GLIBCXX_MOVE(__val); | ^ In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:61: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h: In instantiation of 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1638:19: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1910:25: required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1926:27: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1947:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h:263:17: error: assignment of read-only location '__result.__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator*()' 263 | *__result = _GLIBCXX_MOVE(*__first); | ^ In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/string:51, from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/locale_classes.h:40, from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/ios_base.h:41, from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/ios:44, from D:\clion\kexin\countMid\C++_multi_files_20251012165246089\main.cpp:7: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h: In instantiation of 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<const int*, vector<int> >]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:91:20: required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1897:34: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1931:38: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1947:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:185:11: error: no matching function for call to 'swap(const int&, const int&)' 185 | swap(*__a, *__b); | ~~~~^~~~~~~~~~~~ In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/exception:164, from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/ios:41: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/exception_ptr.h:230:5: note: candidate: 'void std::__exception_ptr::swap(exception_ptr&, exception_ptr&)' 230 | swap(exception_ptr& __lhs, exception_ptr& __rhs) | ^~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/exception_ptr.h:230:25: note: no known conversion for argument 1 from 'const int' to 'std::__exception_ptr::exception_ptr&' 230 | swap(exception_ptr& __lhs, exception_ptr& __rhs) | ~~~~~~~~~~~~~~~^~~~~ In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/exception_ptr.h:41: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:196:5: note: candidate: 'template<class _Tp> std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&)' 196 | swap(_Tp& __a, _Tp& __b) | ^~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:196:5: note: template argument deduction/substitution failed: In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:57: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/type_traits: In substitution of 'template<bool _Cond, class _Tp> using std::__enable_if_t = typename std::enable_if::type [with bool _Cond = false; _Tp = void]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/type_traits:2224:11: required by substitution of 'template<class ... _Cond> using std::_Require = std::__enable_if_t<std::__and_<_Bn>::value> [with _Cond = {std::__not_<std::__is_tuple_like<const int> >, std::is_move_constructible<const int>, std::is_move_assignable<const int>}]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:196:5: required by substitution of 'template<class _Tp> std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = const int]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:185:11: required from 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:91:20: required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1897:34: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1931:38: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1947:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/type_traits:116:11: error: no type named 'type' in 'struct std::enable_if<false, void>' 116 | using __enable_if_t = typename enable_if<_Cond, _Tp>::type; | ^~~~~~~~~~~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h: In instantiation of 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<const int*, vector<int> >]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:91:20: required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1897:34: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1931:38: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1947:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:220:5: note: candidate: 'template<class _Tp, long long unsigned int _Nm> std::__enable_if_t<std::__is_swappable<_Tp>::value> std::swap(_Tp (&)[_Nm], _Tp (&)[_Nm])' 220 | swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) | ^~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/move.h:220:5: note: template argument deduction/substitution failed: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:185:11: note: mismatched types '_Tp [_Nm]' and 'const int' 185 | swap(*__a, *__b); | ~~~~^~~~~~~~~~~~ In file included from D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:64: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_pair.h:879:5: note: candidate: 'template<class _T1, class _T2> typename std::enable_if<std::__and_<std::__is_swappable<_T1>, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&)' 879 | swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) | ^~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_pair.h:879:5: note: template argument deduction/substitution failed: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:185:11: note: mismatched types 'std::pair<_T1, _T2>' and 'const int' 185 | swap(*__a, *__b); | ~~~~^~~~~~~~~~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_pair.h:896:5: note: candidate: 'template<class _T1, class _T2> typename std::enable_if<(! std::__and_<std::__is_swappable<_T1>, std::__is_swappable<_T2> >::value)>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&)' (deleted) 896 | swap(pair<_T1, _T2>&, pair<_T1, _T2>&) = delete; | ^~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_pair.h:896:5: note: template argument deduction/substitution failed: D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:185:11: note: mismatched types 'std::pair<_T1, _T2>' and 'const int' 185 | swap(*__a, *__b); | ~~~~^~~~~~~~~~~~ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Distance = long long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h:356:22: required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1635:23: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1910:25: required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1926:27: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1947:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h:235:36: error: assignment of read-only location '__first.__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator+(__holeIndex).__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator*()' 235 | *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild)); | ^ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_heap.h:241:36: error: assignment of read-only location '__first.__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator+(__holeIndex).__gnu_cxx::__normal_iterator<const int*, std::vector<int> >::operator*()' 241 | *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first | ^ D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h: In instantiation of 'static _Up* std::__copy_move_backward<_IsMove, true, std::random_access_iterator_tag>::__copy_move_b(_Tp*, _Tp*, _Up*) [with _Tp = const int; _Up = const int; bool _IsMove = true]': D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:769:37: required from '_BI2 std::__copy_move_backward_a2(_BI1, _BI1, _BI2) [with bool _IsMove = true; _BI1 = const int*; _BI2 = const int*]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:778:51: required from '_BI2 std::__copy_move_backward_a1(_BI1, _BI1, _BI2) [with bool _IsMove = true; _BI1 = const int*; _BI2 = const int*]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:809:5: required from '_OI std::__copy_move_backward_a(_II, _II, _OI) [with bool _IsMove = true; _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:901:47: required from '_BI2 std::move_backward(_BI1, _BI1, _BI2) [with _BI1 = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _BI2 = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1823:8: required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1859:25: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:1950:31: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algo.h:4861:18: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<const int*, vector<int> >]' D:\clion\kexin\countMid\C++_multi_files_20251012165246089\solution.cpp:18:13: required from here D:/clion/CLion 2025.1.3/bin/mingw/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stl_algobase.h:748:40: error: invalid conversion from 'const void*' to 'void*' [-fpermissive] 748 | __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num); | ~~~~~~~~~^~~~~~ | | | const void* <built-in>: note: initializing argument 1 of 'void* __builtin_memmove(void*, const void*, long long unsigned int)' 进程已结束,退出代码为 1 为什么构建失败
10-13
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值