does STL set have FindKth() functionality?

[blackswift]

hello all,

i found set does not have a FindKth(), althought
it is realized using a red-black tree.

i have two questions:
1. is there any better SET?
2. can set be augmented?
thanks in advance.

best regareds.

[Maxim Yegorushkin]

blackswift wrote:

hello all,

i found set does not have a FindKth(), althought
it is realized using a red-black tree.
Do you mean access by index? If so it can be implemented this way:

template<class T, class U, class V>
typename std::set<T, U, V>::const_iterator find_kth(std::set<T, U, V>
const& s, unsigned k)
{
typename std::set<T, U, V>::const_iterator i(s.begin());
std::advance(i, k);
return i;
}

Note that the complexity of this code is O(k), because std::set<> only
support bidirectional iterators.
i have two questions:
1. is there any better SET?
better than what?
boost::multi_index is often better than the standard associative
containers.
2. can set be augmented?

yes. http://www.sgi.com/tech/stl/set.html

[blackswift]

thanks a lot!