code: func (tree *tree) Search(rect rtree.Rectangle) rtree.Rectangles {
  	ga := newGetAction(rect)
  	tree.checkAndRun(ga)
  	ga.completer.Wait()
  	return ga.result
  }
docs: // Search will return a list of rectangles that intersect the provided
  // rectangle.