If there is any difference between it1 and it2?
std::set s;
auto it1 = std::inserter(s, s.begin());
auto it2 = std::inserter(s, s.end());
<
From http://www.sgi.com/tech/stl/insert_iterator.html
In the case of a Sorted Associative Container, however, the iterator in the insert_iterator's constructor is almost irrelevant. The new elements will not necessarily form a contiguous range; they will appear in the appropriate location in the container, in ascending order by key. The order in which they are inserted only affects efficiency: inserting an already-sorted range into a Sorted Associative Container is an O(N) operation.