In file included from /nix/gcc-13.2.0/include/c++/13.2.0/algorithm:61,
from stdc++.h:51:
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1942:5,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = int*]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:4861:18,
inlined from ‘int main()’ at foo.cc:10:6:
/nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1947:32: warning: array subscript -1 is outside array bounds of ‘int [1000]’ [-Warray-bounds=]
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
foo.cc: In function ‘int main()’:
foo.cc:3:22: note: at offset -4 into object ‘f’ of size 4000
3 | int a,b[1000],c,e=-1,f[1000];
| ^
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1950:31,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1942:5,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = int*]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:4861:18,
inlined from ‘int main()’ at foo.cc:10:6:
/nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1864:30: warning: array subscript -1 is outside array bounds of ‘int [1000]’ [-Warray-bounds=]
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
foo.cc: In function ‘int main()’:
foo.cc:3:22: note: at offset -4 into object ‘f’ of size 4000
3 | int a,b[1000],c,e=-1,f[1000];
| ^
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1854:5,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1950:31,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1942:5,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = int*]’ at /nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:4861:18,
inlined from ‘int main()’ at foo.cc:10:6:
/nix/gcc-13.2.0/include/c++/13.2.0/bits/stl_algo.h:1859:32: warning: array subscript -1 is outside array bounds of ‘int [1000]’ [-Warray-bounds=]
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foo.cc: In function ‘int main()’:
foo.cc:3:22: note: at offset -4 into object ‘f’ of size 4000
3 | int a,b[1000],c,e=-1,f[1000];
| ^