mirror of
https://github.com/hanzoai/forge.git
synced 2026-10-30 15:00:39 +00:00
zeekayandHanzo Dev
9a07b4d089
2978 files. The fork is 2026-07-15 (rebrand: gitea.dev -> github.com/hanzoai/git), so 2026 is the year, and "Copyright 2026 Hanzo AI, Inc." was already the form used by the handful of files that had ours. Shape is now: // Copyright 2026 Hanzo AI, Inc. All rights reserved. // Copyright 2015 The Gogs Authors. All rights reserved. // Copyright 2019 The Gitea Authors. All rights reserved. // SPDX-License-Identifier: MIT Ours on top, theirs retained verbatim. Retained because MIT requires it, and separately because they are true — those authors did write that code. Not renamed to "The Git Authors": Git is a different project under a different license, and putting its name here would attribute this code to people who have nothing to do with it. Adding our line is the fix; overwriting theirs would have been both a licence violation and a false statement. gofmt still reports import-order drift in some of these files. It predates this change (verified against a stash) and is left alone rather than burying a one-line-per-file legal change under 3000 files of unrelated reordering. Build clean. Co-authored-by: Hanzo Dev <[email protected]>
81 lines
2.0 KiB
Go
81 lines
2.0 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// Copyright 2022 The Gitea Authors. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package util
|
|
|
|
import (
|
|
"cmp"
|
|
"slices"
|
|
"strings"
|
|
)
|
|
|
|
// SliceContainsString sequential searches if string exists in slice.
|
|
func SliceContainsString(slice []string, target string, insensitive ...bool) bool {
|
|
if len(insensitive) != 0 && insensitive[0] {
|
|
return slices.ContainsFunc(slice, func(t string) bool { return strings.EqualFold(t, target) })
|
|
}
|
|
|
|
return slices.Contains(slice, target)
|
|
}
|
|
|
|
// SliceSortedEqual returns true if the two slices will be equal when they get sorted.
|
|
// It doesn't require that the slices have been sorted, and it doesn't sort them either.
|
|
func SliceSortedEqual[T comparable](s1, s2 []T) bool {
|
|
if len(s1) != len(s2) {
|
|
return false
|
|
}
|
|
|
|
counts := make(map[T]int, len(s1))
|
|
for _, v := range s1 {
|
|
counts[v]++
|
|
}
|
|
for _, v := range s2 {
|
|
counts[v]--
|
|
}
|
|
|
|
for _, v := range counts {
|
|
if v != 0 {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// SliceRemoveAll removes all the target elements from the slice.
|
|
func SliceRemoveAll[T comparable](slice []T, target T) []T {
|
|
return slices.DeleteFunc(slice, func(t T) bool { return t == target })
|
|
}
|
|
|
|
// Sorted returns the sorted slice
|
|
// Note: The parameter is sorted inline.
|
|
func Sorted[S ~[]E, E cmp.Ordered](values S) S {
|
|
slices.Sort(values)
|
|
return values
|
|
}
|
|
|
|
// TODO: Replace with "maps.Values" once available, current it only in golang.org/x/exp/maps but not in standard library
|
|
func ValuesOfMap[K comparable, V any](m map[K]V) []V {
|
|
values := make([]V, 0, len(m))
|
|
for _, v := range m {
|
|
values = append(values, v)
|
|
}
|
|
return values
|
|
}
|
|
|
|
// TODO: Replace with "maps.Keys" once available, current it only in golang.org/x/exp/maps but not in standard library
|
|
func KeysOfMap[K comparable, V any](m map[K]V) []K {
|
|
keys := make([]K, 0, len(m))
|
|
for k := range m {
|
|
keys = append(keys, k)
|
|
}
|
|
return keys
|
|
}
|
|
|
|
func SliceNilAsEmpty[T any](a []T) []T {
|
|
if a == nil {
|
|
return []T{}
|
|
}
|
|
return a
|
|
}
|