Unverified Commit 5b658bb6 authored by k8s-ci-robot's avatar k8s-ci-robot Committed by GitHub

Merge pull request #69136 from zhangmingld/deletecommentgetPodsMatchingAffinity

func getPodsMatchingAffinity no longer exists,dont need it in comment
parents c526f097 061e0dbb
...@@ -492,7 +492,7 @@ func getTPMapMatchingIncomingAffinityAntiAffinity(pod *v1.Pod, nodeInfoMap map[s ...@@ -492,7 +492,7 @@ func getTPMapMatchingIncomingAffinityAntiAffinity(pod *v1.Pod, nodeInfoMap map[s
} }
// targetPodMatchesAffinityOfPod returns true if "targetPod" matches ALL affinity terms of // targetPodMatchesAffinityOfPod returns true if "targetPod" matches ALL affinity terms of
// "pod". Similar to getPodsMatchingAffinity, this function does not check topology. // "pod". This function does not check topology.
// So, whether the targetPod actually matches or not needs further checks for a specific // So, whether the targetPod actually matches or not needs further checks for a specific
// node. // node.
func targetPodMatchesAffinityOfPod(pod, targetPod *v1.Pod) bool { func targetPodMatchesAffinityOfPod(pod, targetPod *v1.Pod) bool {
...@@ -509,7 +509,7 @@ func targetPodMatchesAffinityOfPod(pod, targetPod *v1.Pod) bool { ...@@ -509,7 +509,7 @@ func targetPodMatchesAffinityOfPod(pod, targetPod *v1.Pod) bool {
} }
// targetPodMatchesAntiAffinityOfPod returns true if "targetPod" matches ANY anti-affinity // targetPodMatchesAntiAffinityOfPod returns true if "targetPod" matches ANY anti-affinity
// term of "pod". Similar to getPodsMatchingAffinity, this function does not check topology. // term of "pod". This function does not check topology.
// So, whether the targetPod actually matches or not needs further checks for a specific // So, whether the targetPod actually matches or not needs further checks for a specific
// node. // node.
func targetPodMatchesAntiAffinityOfPod(pod, targetPod *v1.Pod) bool { func targetPodMatchesAntiAffinityOfPod(pod, targetPod *v1.Pod) bool {
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment