mirror of
https://github.com/woodpecker-ci/woodpecker.git
synced 2024-11-20 00:41:02 +00:00
59 lines
1.5 KiB
Go
59 lines
1.5 KiB
Go
// Copyright 2023 Woodpecker Authors
|
|
//
|
|
// Licensed 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 utils
|
|
|
|
// MergeSlices return a new slice that combines all values of input slices
|
|
// TODO: once https://github.com/golang/go/pull/61817 got merged, we should switch to it
|
|
func MergeSlices[T any](slices ...[]T) []T {
|
|
sl := 0
|
|
for i := range slices {
|
|
sl += len(slices[i])
|
|
}
|
|
result := make([]T, sl)
|
|
cp := 0
|
|
for _, s := range slices {
|
|
if sLen := len(s); sLen != 0 {
|
|
copy(result[cp:], s)
|
|
cp += sLen
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// EqualSliceValues compare two slices if they have equal values independent of how they are sorted
|
|
func EqualSliceValues[E comparable](s1, s2 []E) bool {
|
|
if len(s1) != len(s2) {
|
|
return false
|
|
}
|
|
|
|
m1 := sliceToCountMap(s1)
|
|
m2 := sliceToCountMap(s2)
|
|
|
|
for k, v := range m1 {
|
|
if m2[k] != v {
|
|
return false
|
|
}
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func sliceToCountMap[E comparable](list []E) map[E]int {
|
|
m := make(map[E]int)
|
|
for i := range list {
|
|
m[list[i]]++
|
|
}
|
|
return m
|
|
}
|