go.temporal.io/server/common/predicates/and.go
121 LOC · 59 covered · 62 uncovered · 27 ranges · 61 concepts · 18 introducers · 29 tests
File neighbourhood
The centred file is linked to every concept that introduces one of its ranges, every test that runs code from the file, and the gray connector concepts standing between those tests and the file's own introducer concepts. Undirected links join concepts to every file where they introduce source and concepts to the tests they introduce; arrows show specialization between the displayed concepts and bridge only concepts omitted from this view. Concept colors match the source ranges below; connector concepts have no source color and are shown in gray.
Focused file, its introducer and connector concepts, their introduced files, and tests that run code from the file
In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the related-file, concept, and source links on this page.
Graph controls are ready.
Interactive rendering requires JavaScript and WebGL. Use the related-file, concept, and source links on this page while the interactive map is unavailable.
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],
if len(predicates) < 2 {
panic(fmt.Sprintf("And requires at least 2 predicates, got %v", len(predicates)))
}
for _, p := range predicates {
switch p := p.(type) {
flattened = appendPredicates(flattened, p.Predicates...)
continue
return p
flattened = appendPredicates(flattened, p)
}
}
return Universal[T]()
return flattened[0]
return &AndImpl[T]{
Predicates: flattened,
}
}
}
for _, p := range a.Predicates {
if !p.Test(t) {
return false
}
}
}
func (a *AndImpl[T]) Equals(
predicate Predicate[T],
andPredicate, ok := predicate.(*AndImpl[T])
if !ok {
}
}
size := EmptyPredicateProtoSize
for _, p := range a.Predicates {
size += p.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],
result := current
AppendLoop:
for _, newPredicate := range new {
for _, currentPredicate := range current {
}
}
}
}
// predicatesEqual assumes there's no duplication in the given slices of predicates
func predicatesEqual[T any](
this []Predicate[T],
that []Predicate[T],
if len(this) != len(that) {
return false
}
for _, thisPredicate := range this {
for _, thatPredicate := range that {
if thisPredicate.Equals(thatPredicate) {
}
}
}
}