code: func Intersection(a []corev1.ResourceName, b []corev1.ResourceName) []corev1.ResourceName {
  	result := make([]corev1.ResourceName, 0, len(a))
  	for _, item := range a {
  		if Contains(result, item) {
  			continue
  		}
  		if !Contains(b, item) {
  			continue
  		}
  		result = append(result, item)
  	}
  	sort.Slice(result, func(i, j int) bool { return result[i] < result[j] })
  	return result
  }
docs: // Intersection returns the intersection of both list of resources, deduped and sorted