Is there a difference between using .begin() vs .end() for std::inserter for std::set?

c++ stl stdset insert-iterator
Loom picture Loom · May 6, 2011 · Viewed 12.8k times · Source

If there is any difference between it1 and it2? 

std::set<sometype> s;

auto it1 = std::inserter(s, s.begin());
auto it2 = std::inserter(s, s.end());

Answer

James Kanze picture James Kanze · May 6, 2011

In practice, not much. If you're inserting a large number of already in order elements into an empty set, the second will be somewhat faster, but that's about it. std::insert_iterator calls insert with the iterator; std::set interprets it as a hint, and inserts in constant time (rather than lg n) if the insertion is immediately before the hint. (Actually, if the set is empty, I think both will do exactly the same thing.)

Related questions

c++ STL set difference

Does the C++ STL set data structure have a set difference operator?

Read More
How do I find the largest int in a std::set<int>?

I have a std::set<int>, what's the proper way to find the largest int in this set?

Read More
Is the C++ std::set thread-safe?

I've a question about the thread safety of std::set. As far as I know I can iterate over a set and add/erase members and that doesn't invalidate the iterators. But consider following scenario: thread 'A' iterates over a …

Read More