public int CompareTo(VectorList <T> rhs)
{
if (rhs == null)
{
return(1);
}
return(1);
}
public bool Equals(VectorList <T> rhs)
{
if (object.ReferenceEquals(rhs, null)) // Equals must return false if rhs==null
{
return(false);
}
// TODO: implement
return(false);
}
public void Swap(VectorList <T> rhs)
{
// Note: This implementation is not exception safe. Without access to internals, it may
// be impossible to implement this in a correct manner. Fortunately, the only way this
// could fail, I think, is an out of memory situation.
VectorList <T> temp = new VectorList <T>(this);
Clear();
Capacity = rhs.Count;
AddRange(rhs);
rhs.Clear();
rhs.Capacity = temp.Count;
rhs.AddRange(temp);
}
