code: func (tree *tree) Query(interval Interval) Intervals {
  	if tree.root == nil {
  		return nil
  	}
  
  	var (
  		Intervals = intervalsPool.Get().(Intervals)
  		ivLow     = interval.LowAtDimension(1)
  		ivHigh    = interval.HighAtDimension(1)
  	)
  
  	tree.root.query(ivLow, ivHigh, interval, tree.maxDimension, func(node *node) {
  		Intervals = append(Intervals, node.interval)
  	})
  
  	return Intervals
  }
docs: // Query will return a list of intervals that intersect the provided
  // interval.  The provided interval's ID method is ignored so the
  // provided ID is irrelevant.