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]>
73 lines
1.7 KiB
Go
73 lines
1.7 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// Copyright 2022 The Gitea Authors. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package container
|
|
|
|
import "maps"
|
|
|
|
type Set[T comparable] map[T]struct{}
|
|
|
|
// SetOf creates a set and adds the specified elements to it.
|
|
func SetOf[T comparable](values ...T) Set[T] {
|
|
s := make(Set[T], len(values))
|
|
s.AddMultiple(values...)
|
|
return s
|
|
}
|
|
|
|
// Add adds the specified element to a set.
|
|
// Returns true if the element is added; false if the element is already present.
|
|
func (s Set[T]) Add(value T) bool {
|
|
if _, has := s[value]; !has {
|
|
s[value] = struct{}{}
|
|
return true
|
|
}
|
|
return false
|
|
}
|
|
|
|
// AddMultiple adds the specified elements to a set.
|
|
func (s Set[T]) AddMultiple(values ...T) {
|
|
for _, value := range values {
|
|
s.Add(value)
|
|
}
|
|
}
|
|
|
|
// Contains determines whether a set contains all these elements.
|
|
// Returns true if the set contains all these elements; otherwise, false.
|
|
func (s Set[T]) Contains(values ...T) bool {
|
|
ret := true
|
|
for _, value := range values {
|
|
_, has := s[value]
|
|
ret = ret && has
|
|
}
|
|
return ret
|
|
}
|
|
|
|
// Remove removes the specified element.
|
|
// Returns true if the element is successfully found and removed; otherwise, false.
|
|
func (s Set[T]) Remove(value T) bool {
|
|
if _, has := s[value]; has {
|
|
delete(s, value)
|
|
return true
|
|
}
|
|
return false
|
|
}
|
|
|
|
// Values gets a list of all elements in the set.
|
|
func (s Set[T]) Values() []T {
|
|
keys := make([]T, 0, len(s))
|
|
for k := range s {
|
|
keys = append(keys, k)
|
|
}
|
|
return keys
|
|
}
|
|
|
|
// Union constructs a new set that is the union of the provided sets
|
|
func (s Set[T]) Union(sets ...Set[T]) Set[T] {
|
|
newSet := maps.Clone(s)
|
|
for i := range sets {
|
|
maps.Copy(newSet, sets[i])
|
|
}
|
|
return newSet
|
|
}
|