The comment is simply wrong. Yes, it is a red-black tree, O(log(n)) for inserts. Taking a look with Reflector bears this out, the private AddIfNotPresent() method contains a while() loop to find the insertion point, using normal red-black node traversal. This doc bug has already been submitted by you-know-who.
I poked around TreeSet and its interfaces for a while, and the best way I found to get the index of an element is: set.headSet(element).size() headSet(element) returns the sub-TreeSet of elements less than its argument, so the size of this set will be the index of the element in question. A strange solution indeed.
There’s also a python sortedcontainers module that implements sorted list, dict, and set types. It’s very similar to blist but implemented in pure-Python and in most cases faster. >>> from sortedcontainers import SortedSet >>> ss = SortedSet([3, 7, 2, 2]) >>> ss SortedSet([2, 3, 7]) It also has functionality uncommon to other packages: >>> from … Read more
This might not be a direct answer, but : it is a way that I’ve used successfully for a similar system of similar scale. This is for the “tag engine” that drives the question lists here on Stack Overflow; Essentially, I have a: struct Question { // basic members – score, dates, id, etc – … Read more
about the version field UPDATE1: In my memory, a lot of (maybe all?) collections in BCL have the field version. First, about foreach: according to this msdn link The foreach statement repeats a group of embedded statements for each element in an array or an object collection. The foreach statement is used to iterate through the collection to get … Read more
As others have noted, there is no in-built way. But you can always subclass that TreeSet, with your constructor(s) of choice, and add in the required functionality: public class UpdateableTreeSet<T extends Updateable> extends TreeSet<T> { // definition of updateable interface Updateable{ void update(Object value); } // constructors here … // ‘update’ method; returns false if … Read more