46 lines
1.2 KiB
Go
46 lines
1.2 KiB
Go
// Licensed to Elasticsearch B.V. under one or more contributor
|
|
// license agreements. See the NOTICE file distributed with
|
|
// this work for additional information regarding copyright
|
|
// ownership. Elasticsearch B.V. licenses this file to you under
|
|
// the Apache License, Version 2.0 (the "License"); you may
|
|
// not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
package scheduler
|
|
|
|
import "sort"
|
|
|
|
type timeOrd []*job
|
|
|
|
func sortEntries(es []*job) {
|
|
sort.Sort(timeOrd(es))
|
|
}
|
|
|
|
func (b timeOrd) Len() int {
|
|
return len(b)
|
|
}
|
|
|
|
func (b timeOrd) Swap(i, j int) {
|
|
b[i], b[j] = b[j], b[i]
|
|
}
|
|
|
|
// Less reports `earliest` time i should sort before j.
|
|
// zero time is not `earliest` time.
|
|
func (b timeOrd) Less(i, j int) bool {
|
|
if b[i].next.IsZero() {
|
|
return false
|
|
}
|
|
if b[j].next.IsZero() {
|
|
return true
|
|
}
|
|
return b[i].next.Before(b[j].next)
|
|
}
|