code: func (r Rect) Intersect(s Rect) Rect {
  	t := R(
  		math.Max(r.Min.X, s.Min.X),
  		math.Max(r.Min.Y, s.Min.Y),
  		math.Min(r.Max.X, s.Max.X),
  		math.Min(r.Max.Y, s.Max.Y),
  	)
  	if t.Min.X >= t.Max.X || t.Min.Y >= t.Max.Y {
  		return Rect{}
  	}
  	return t
  }
docs: // Intersect returns the maximal Rect which is covered by both r and s. Rects r and s must be normalized.
  //
  // If r and s don't overlap, this function returns R(0, 0, 0, 0).