public static void Add(ref DisjointSet left, Range right)
{
// An add is a normal binary tree insertion,
// followed by a splay of the inserted node to the root.
left = (left == null) ? right : Splay(left.Insert(right));
left.AssertWellOrdered();
}
public static void Add(ref DisjointSet left, Range right)
{
// An add is a normal binary tree insertion,
// followed by a splay of the inserted node to the root.
left = (left == null) ? right : Splay(left.Insert(right));
left.AssertWellOrdered();
}
