mirror of
https://github.com/mudler/luet.git
synced 2025-06-23 14:07:35 +00:00
4adc0dc9b9
Instead of using gox on one side and an action to release, we can merge them together with goreleaser which will build for extra targets (arm, mips if needed in the future) and it also takes care of creating checksums, a source archive, and a changelog and creating a release with all the artifacts. All binaries should respect the old naming convention, so any scripts out there should still work. Signed-off-by: Itxaka <igarcia@suse.com>
40 lines
711 B
Go
40 lines
711 B
Go
// Copyright 2013 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
//go:build !go1.2
|
|
// +build !go1.2
|
|
|
|
package language
|
|
|
|
import "sort"
|
|
|
|
func sortStable(s sort.Interface) {
|
|
ss := stableSort{
|
|
s: s,
|
|
pos: make([]int, s.Len()),
|
|
}
|
|
for i := range ss.pos {
|
|
ss.pos[i] = i
|
|
}
|
|
sort.Sort(&ss)
|
|
}
|
|
|
|
type stableSort struct {
|
|
s sort.Interface
|
|
pos []int
|
|
}
|
|
|
|
func (s *stableSort) Len() int {
|
|
return len(s.pos)
|
|
}
|
|
|
|
func (s *stableSort) Less(i, j int) bool {
|
|
return s.s.Less(i, j) || !s.s.Less(j, i) && s.pos[i] < s.pos[j]
|
|
}
|
|
|
|
func (s *stableSort) Swap(i, j int) {
|
|
s.s.Swap(i, j)
|
|
s.pos[i], s.pos[j] = s.pos[j], s.pos[i]
|
|
}
|