mirror of
https://github.com/hanzoai/tasks.git
synced 2026-10-04 02:04:03 +00:00
Alex ShtinandGitHub
8e8f1b0f7c
## What changed?
<!-- Describe what has changed in this PR -->
Remove license header from every file. Because it is really hard to
follow in this PR here is the summary:
1. License header is removed from all `.go` and `.proto` files
:fireworks::fireworks:🎆.
2. `LICENSE` file in the root directory has only Temporal and Uber
copyrights.
3. 5 other `LICENSE` files added to the packages which have copyrights
different from Temporal and Uber: Datadog, Xargin, "Mat Ryer, Tyler
Bunnell and contributors".
4. `license_file` flag is removed from all code generation tools.
5. `copyright_file` flag is removed from `go:generate mockgen`
directive.
6. All copyright related targets are removed from `Makefile`.
7. Updated Temporal copyright year to 2025 everywhere.
## Why?
<!-- Tell your future self why have you made these changes -->
I double checked with legal department that it is not needed to have
license header in every file. One file per repo is enough. I put all
copyrights to the root `LICENSE` file and removed header from all other
files. Also updated tools and `Makefile`.
122 lines
2.3 KiB
Go
122 lines
2.3 KiB
Go
package predicates
|
|
|
|
import (
|
|
"fmt"
|
|
)
|
|
|
|
type (
|
|
AndImpl[T any] struct {
|
|
// TODO: see if we can somehow order arbitrary predicats and store a sorted list
|
|
Predicates []Predicate[T]
|
|
}
|
|
)
|
|
|
|
func And[T any](
|
|
predicates ...Predicate[T],
|
|
) Predicate[T] {
|
|
if len(predicates) < 2 {
|
|
panic(fmt.Sprintf("And requires at least 2 predicates, got %v", len(predicates)))
|
|
}
|
|
|
|
flattened := make([]Predicate[T], 0, len(predicates))
|
|
for _, p := range predicates {
|
|
switch p := p.(type) {
|
|
case *AndImpl[T]:
|
|
flattened = appendPredicates(flattened, p.Predicates...)
|
|
case *UniversalImpl[T]:
|
|
continue
|
|
case *EmptyImpl[T]:
|
|
return p
|
|
default:
|
|
flattened = appendPredicates(flattened, p)
|
|
}
|
|
}
|
|
|
|
switch len(flattened) {
|
|
case 0:
|
|
return Universal[T]()
|
|
case 1:
|
|
return flattened[0]
|
|
default:
|
|
return &AndImpl[T]{
|
|
Predicates: flattened,
|
|
}
|
|
}
|
|
}
|
|
|
|
func (a *AndImpl[T]) Test(t T) bool {
|
|
for _, p := range a.Predicates {
|
|
if !p.Test(t) {
|
|
return false
|
|
}
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (a *AndImpl[T]) Equals(
|
|
predicate Predicate[T],
|
|
) bool {
|
|
andPredicate, ok := predicate.(*AndImpl[T])
|
|
if !ok {
|
|
return false
|
|
}
|
|
|
|
return predicatesEqual(a.Predicates, andPredicate.Predicates)
|
|
}
|
|
|
|
func (a *AndImpl[T]) Size() int {
|
|
size := EmptyPredicateProtoSize
|
|
for _, p := range a.Predicates {
|
|
size += p.Size()
|
|
}
|
|
|
|
return size
|
|
}
|
|
|
|
// appendPredicates adds new predicates to the slice of existing predicates
|
|
// dropping any duplicated predicates where duplication is determined by Predicate.Equals.
|
|
// appendPredicates assumes that there's no duplication in new predicates.
|
|
func appendPredicates[T any](
|
|
current []Predicate[T],
|
|
new ...Predicate[T],
|
|
) []Predicate[T] {
|
|
result := current
|
|
|
|
AppendLoop:
|
|
for _, newPredicate := range new {
|
|
for _, currentPredicate := range current {
|
|
if currentPredicate.Equals(newPredicate) {
|
|
continue AppendLoop
|
|
}
|
|
}
|
|
|
|
result = append(result, newPredicate)
|
|
}
|
|
|
|
return result
|
|
}
|
|
|
|
// predicatesEqual assumes there's no duplication in the given slices of predicates
|
|
func predicatesEqual[T any](
|
|
this []Predicate[T],
|
|
that []Predicate[T],
|
|
) bool {
|
|
if len(this) != len(that) {
|
|
return false
|
|
}
|
|
|
|
MatchLoop:
|
|
for _, thisPredicate := range this {
|
|
for _, thatPredicate := range that {
|
|
if thisPredicate.Equals(thatPredicate) {
|
|
continue MatchLoop
|
|
}
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
return true
|
|
}
|