This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/78231] Should std::sort use unqualifed iter_swap?
- From: "correaa at llnl dot gov" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 08 Nov 2016 01:20:25 +0000
- Subject: [Bug libstdc++/78231] Should std::sort use unqualifed iter_swap?
- Auto-submitted: auto-generated
- References: <bug-78231-4@http.gcc.gnu.org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78231
--- Comment #4 from Alfredo <correaa at llnl dot gov> ---
ok, thanks for the clarification.
So algorithms on iterators that swap use `::std::iter_swap`? (I didn't know
that.) That is step forward.
Is then one allowed to overload/specialize `std::iter_swap`? Just like one does
with `swap`?