code: func (g *genericScheduler) getLowerPriorityNominatedPods(pod *v1.Pod, nodeName string) []*v1.Pod {
  	pods := g.schedulingQueue.NominatedPodsForNode(nodeName)
  
  	if len(pods) == 0 {
  		return nil
  	}
  
  	var lowerPriorityPods []*v1.Pod
  	podPriority := util.GetPodPriority(pod)
  	for _, p := range pods {
  		if util.GetPodPriority(p) < podPriority {
  			lowerPriorityPods = append(lowerPriorityPods, p)
  		}
  	}
  	return lowerPriorityPods
  }
docs: // getLowerPriorityNominatedPods returns pods whose priority is smaller than the
  // priority of the given "pod" and are nominated to run on the given node.
  // Note: We could possibly check if the nominated lower priority pods still fit
  // and return those that no longer fit, but that would require lots of
  // manipulation of NodeInfo and PredicateMeta per nominated pod. It may not be
  // worth the complexity, especially because we generally expect to have a very
  // small number of nominated pods per node.