private static RedBlackTree <T> /*!*/ InsertHelper(RedBlackTree <T> /*?*/ t, T /*?*/ o, bool replace, out bool added)
{
if ((object)t == null)
{
added = true;
return(new RedBlackTree <T>(Color.R, o, null, null));
}
else
{
int k = HashAlgorithms.CompareValues(o, t.value);
if (k == 0)
{
added = false;
return(replace ? new RedBlackTree <T>(t.color, o, t.left, t.right) : t);
}
else if (k < 0)
{
return(Balance(t.color, t.value, InsertHelper(t.left, o, replace, out added), t.right));
}
else
{
return(Balance(t.color, t.value, t.left, InsertHelper(t.right, o, replace, out added)));
}
}
}
private static RedBlackTree <T> Relink(RedBlackTree <T> t, RedBlackTree <T> /*?*/ s)
{
if ((object)s == null)
{
return(t);
}
else if (HashAlgorithms.CompareValues(t.value, s.value) < 0)
{
return(Balance(s.color, s.value, Relink(t, s.left), s.right));
}
else
{
return(Balance(s.color, s.value, s.left, Relink(t, s.right)));
}
}
/// <summary>
/// Looks up a value associated with a given key
/// </summary>
/// <param name="o">The key</param>
/// <param name="result">The value associated with this key (out parameter), or the default value if not found</param>
/// <returns>True if there a value associated with the key was found, false otherwise.</returns>
public bool TryGetValue(T /*?*/ o, out T /*?*/ result)
{
int k = HashAlgorithms.CompareValues(o, this.value);
result = default(T);
if (k == 0)
{
result = this.value;
return(true);
}
else if (k < 0)
{
return((object)this.left == null ? false : this.left.TryGetValue(o, out result));
}
else //if (k > 0)
{
return((object)this.right == null ? false : this.right.TryGetValue(o, out result));
}
}
private static RedBlackTree <T> /*?*/ RemoveHelper(RedBlackTree <T> /*?*/ t, T /*?*/ o, out bool deleted)
{
if ((object)t == null)
{
deleted = false;
return(t);
}
else
{
int k = HashAlgorithms.CompareValues(o, t.value);
if (k == 0)
{
deleted = true;
if (t.left == null)
{
return(t.right);
}
else if (t.right == null)
{
return(t.left);
}
else
{
return(Relink(t.left, t.right));
}
}
else if (k < 0)
{
return(Balance(t.color, t.value, RemoveHelper(t.left, o, out deleted), t.right));
}
else
{
return(Balance(t.color, t.value, t.left, RemoveHelper(t.right, o, out deleted)));
}
}
}
