mirror of
https://github.com/duke-git/lancet.git
synced 2025-09-27 03:45:58 +08:00
805e2543d0
Add new function, NAND, designed to create a composed predicate representing the logical NAND operation applied to a list of predicates. The NAND operation is a logical operation that returns true only if all perdicate result in false otherwise false
92 lines
3.1 KiB
Go
92 lines
3.1 KiB
Go
package function
|
|
|
|
// And returns a composed predicate that represents the logical AND of a list of predicates.
|
|
// It evaluates to true only if all predicates evaluate to true for the given value.
|
|
func And[T any](predicates ...func(T) bool) func(T) bool {
|
|
if len(predicates) < 2 {
|
|
panic("programming error: predicates count must be at least 2")
|
|
}
|
|
return func(value T) bool {
|
|
for _, predicate := range predicates {
|
|
if !predicate(value) {
|
|
return false // Short-circuit on the first false predicate
|
|
}
|
|
}
|
|
return true // True if all predicates are true
|
|
}
|
|
}
|
|
|
|
// And returns a composed predicate that represents the logical NAND of a list of predicates.
|
|
// It evaluates to true only if all predicates evaluate to false for the given value.
|
|
func Nand[T any](predicates ...func(T) bool) func(T) bool {
|
|
if len(predicates) < 2 {
|
|
panic("programming error: predicates count must be at least 2")
|
|
}
|
|
return func(value T) bool {
|
|
for _, predicate := range predicates {
|
|
if predicate(value) {
|
|
return false // Short-circuit on the first true predicate
|
|
}
|
|
}
|
|
return true // True if all predicates are false
|
|
}
|
|
}
|
|
|
|
// Negate returns a predicate that represents the logical negation of this predicate.
|
|
func Negate[T any](predicate func(T) bool) func(T) bool {
|
|
return func(value T) bool {
|
|
return !predicate(value)
|
|
}
|
|
}
|
|
|
|
// Or returns a composed predicate that represents the logical OR of a list of predicates.
|
|
// It evaluates to true if at least one of the predicates evaluates to true for the given value.
|
|
func Or[T any](predicates ...func(T) bool) func(T) bool {
|
|
if len(predicates) < 2 {
|
|
panic("programming error: predicates count must be at least 2")
|
|
}
|
|
return func(value T) bool {
|
|
for _, predicate := range predicates {
|
|
if predicate(value) {
|
|
return true // Short-circuit on the first true predicate
|
|
}
|
|
}
|
|
return false // False if all predicates are false
|
|
}
|
|
}
|
|
|
|
// Nor returns a composed predicate that represents the logical NOR of a list of predicates.
|
|
// It evaluates to true only if all predicates evaluate to false for the given value.
|
|
func Nor[T any](predicates ...func(T) bool) func(T) bool {
|
|
if len(predicates) < 2 {
|
|
panic("programming error: predicates count must be at least 2")
|
|
}
|
|
return func(value T) bool {
|
|
for _, predicate := range predicates {
|
|
if predicate(value) {
|
|
return false // If any predicate evaluates to true, the NOR result is false
|
|
}
|
|
}
|
|
return true // Only returns true if all predicates evaluate to false
|
|
}
|
|
}
|
|
|
|
// Xnor returns a composed predicate that represents the logical XNOR of a list of predicates.
|
|
// It evaluates to true only if all predicates evaluate to true or false for the given value.
|
|
func Xnor[T any](predicates ...func(T) bool) func(T) bool {
|
|
if len(predicates) < 2 {
|
|
panic("programming error: predicates count must be at least 2")
|
|
}
|
|
return func(value T) bool {
|
|
trueCount := 0
|
|
for _, predicate := range predicates {
|
|
if predicate(value) {
|
|
trueCount++
|
|
}
|
|
}
|
|
// XNOR is true if either all predicates are true or all are false
|
|
// This is the same as saying trueCount is 0 (all false) or trueCount is len(predicates) (all true)
|
|
return trueCount == 0 || trueCount == len(predicates)
|
|
}
|
|
}
|