public bool Contains(RectI small)
{
return(R >= small.R && L <= small.L && T <= small.T && B >= small.B);
}
public bool Continues(RectI other)
{
return((R == other.R && L == other.L && (B == other.T || T == other.B)) ||
(B == other.B && T == other.T && (L == other.R || R == other.L)));
}
public bool IntersectsWith(RectI other)
{
return(!(R < other.L || other.R < L || B < other.T || other.B < T));
}