public IndexedSet(IComparer <T> comparer)
{
this.tree = new RedBlackTree <T>(comparer);
}
public IndexedSet()
{
this.tree = new RedBlackTree <T>(Comparer <T> .Default);
}
public IndexedDictionary(IComparer <KeyValuePair <TKey, TValue> > comparer)
{
this.tree = new NonDuplicateRedBlackTree <KeyValuePair <TKey, TValue> >(comparer);
}
internal KeyCollection(ISelfBalanceTree <KeyValuePair <TKey, TValue> > root)
{
this.tree = root;
}
public IndexedDictionary()
{
this.tree = new NonDuplicateRedBlackTree <KeyValuePair <TKey, TValue> >(new KeyCalueCompare <TKey, TValue>());
}