mirror of
https://codeberg.org/forgejo/forgejo.git
synced 2025-07-21 18:49:40 +02:00
0ecb25fdcb
- A mistake that is often made is to not put a empty fixture for tables that gets populated in a test and should be cleaned up between runs. The CI does not detect such issues as these never arise on the first run of the test suite and are only noticed when developers run a test for a second time, unless you are aware of this behavior (which very few do as this is not documented and pure folk knowledge) can end up in chasing a bug that does not exist for hours. forgejo/forgejo#7041, forgejo/forgejo#7419, meissa/forgejo#21, forgejo/forgejo#5771 - Because we now own the fixture loader (forgejo/forgejo#7715), its rather simple to ensure that all tables that did not receive fixtures should be cleaned between runs and removes the need to place empty fixture files. Reviewed-on: https://codeberg.org/forgejo/forgejo/pulls/8353 Reviewed-by: Earl Warren <earl-warren@noreply.codeberg.org> Reviewed-by: Otto <otto@codeberg.org> Co-authored-by: Gusted <postmaster@gusted.xyz> Co-committed-by: Gusted <postmaster@gusted.xyz>
81 lines
1.8 KiB
Go
81 lines
1.8 KiB
Go
// Copyright 2022 The Gitea Authors. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package container
|
|
|
|
import (
|
|
"iter"
|
|
"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)
|
|
}
|
|
}
|
|
|
|
func (s Set[T]) IsSubset(subset []T) bool {
|
|
for _, v := range subset {
|
|
if !s.Contains(v) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Contains determines whether a set contains the specified element.
|
|
// Returns true if the set contains the specified element; otherwise, false.
|
|
func (s Set[T]) Contains(value T) bool {
|
|
_, has := s[value]
|
|
return has
|
|
}
|
|
|
|
// 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
|
|
}
|
|
|
|
// Seq returns a iterator over the elements in the set.
|
|
// It returns a single-use iterator.
|
|
func (s Set[T]) Seq() iter.Seq[T] {
|
|
return maps.Keys(s)
|
|
}
|
|
|
|
// Clone returns a identical shallow copy of this set.
|
|
func (s Set[T]) Clone() Set[T] {
|
|
return maps.Clone(s)
|
|
}
|