@@ -183,16 +183,18 @@ func getPodDeletionCost(pod v1.Pod) int32 {
183183func podSortingStrategy () (func ([]v1.Pod ), error ) {
184184 sortingStrategy , present := os .LookupEnv (envPodSortingStrategy )
185185 if ! present {
186- return func (pods []v1.Pod ) {}, nil
186+ defaultSort := func (pods []v1.Pod ) {}
187+ return defaultSort , nil
187188 }
188189
189190 switch sortingStrategy {
190191 case "random" :
191- return func (pods []v1.Pod ) {
192+ randomSort := func (pods []v1.Pod ) {
192193 rand .Shuffle (len (pods ), func (i , j int ) { pods [i ], pods [j ] = pods [j ], pods [i ] })
193- }, nil
194+ }
195+ return randomSort , nil
194196 case "oldest-first" :
195- return func (pods []v1.Pod ) {
197+ oldestFirstSort := func (pods []v1.Pod ) {
196198 sort .Slice (pods , func (i , j int ) bool {
197199 if pods [i ].Status .StartTime == nil {
198200 return false
@@ -202,9 +204,10 @@ func podSortingStrategy() (func([]v1.Pod), error) {
202204 }
203205 return pods [i ].Status .StartTime .Unix () < pods [j ].Status .StartTime .Unix ()
204206 })
205- }, nil
207+ }
208+ return oldestFirstSort , nil
206209 case "youngest-first" :
207- return func (pods []v1.Pod ) {
210+ youngestFirstSort := func (pods []v1.Pod ) {
208211 sort .Slice (pods , func (i , j int ) bool {
209212 if pods [i ].Status .StartTime == nil {
210213 return false
@@ -214,13 +217,15 @@ func podSortingStrategy() (func([]v1.Pod), error) {
214217 }
215218 return pods [j ].Status .StartTime .Unix () < pods [i ].Status .StartTime .Unix ()
216219 })
217- }, nil
220+ }
221+ return youngestFirstSort , nil
218222 case "pod-deletion-cost" :
219- return func (pods []v1.Pod ) {
223+ podDeletionCostSort := func (pods []v1.Pod ) {
220224 sort .Slice (pods , func (i , j int ) bool {
221225 return getPodDeletionCost (pods [i ]) < getPodDeletionCost (pods [j ])
222226 })
223- }, nil
227+ }
228+ return podDeletionCostSort , nil
224229 default :
225230 return nil , errors .New ("unknown pod sorting strategy" )
226231 }
0 commit comments