Done with: ack '2018+' -l | xargs sed -i -e 's/2018+/2019+/g' Checked manually with: git add -p Hello to future James from 2020, and Happy Hacking!
42 lines
1.5 KiB
Go
42 lines
1.5 KiB
Go
// Mgmt
|
|
// Copyright (C) 2013-2019+ James Shubin and the project contributors
|
|
// Written by James Shubin <james@shubin.ca> and the project contributors
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package engine
|
|
|
|
import (
|
|
"sort"
|
|
)
|
|
|
|
// ResourceSlice is a linear list of resources. It can be sorted.
|
|
type ResourceSlice []Res
|
|
|
|
func (rs ResourceSlice) Len() int { return len(rs) }
|
|
func (rs ResourceSlice) Swap(i, j int) { rs[i], rs[j] = rs[j], rs[i] }
|
|
func (rs ResourceSlice) Less(i, j int) bool { return rs[i].String() < rs[j].String() }
|
|
|
|
// Sort the list of resources and return a copy without modifying the input.
|
|
func Sort(rs []Res) []Res {
|
|
resources := []Res{}
|
|
for _, r := range rs { // copy
|
|
resources = append(resources, r)
|
|
}
|
|
sort.Sort(ResourceSlice(resources))
|
|
return resources
|
|
// sort.Sort(ResourceSlice(rs)) // this is wrong, it would modify input!
|
|
//return rs
|
|
}
|