120 lines
3.0 KiB
Go
120 lines
3.0 KiB
Go
// Copyright (c) 2024 Celestino Amoroso (celestino.amoroso@gmail.com).
|
|
// All rights reserved.
|
|
|
|
// operator-sum.go
|
|
package expr
|
|
|
|
import (
|
|
"fmt"
|
|
"slices"
|
|
)
|
|
|
|
//-------- plus term
|
|
|
|
func newPlusTerm(tk *Token) (inst *term) {
|
|
return &term{
|
|
tk: *tk,
|
|
children: make([]*term, 0, 2),
|
|
position: posInfix,
|
|
priority: priSum,
|
|
evalFunc: evalPlus,
|
|
}
|
|
}
|
|
|
|
func evalPlus(ctx ExprContext, self *term) (v any, err error) {
|
|
var leftValue, rightValue any
|
|
|
|
if leftValue, rightValue, err = self.evalInfix(ctx); err != nil {
|
|
return
|
|
}
|
|
|
|
if (isString(leftValue) && isNumberString(rightValue)) || (isString(rightValue) && isNumberString(leftValue)) {
|
|
v = fmt.Sprintf("%v%v", leftValue, rightValue)
|
|
} else if isNumber(leftValue) && isNumber(rightValue) {
|
|
if isFloat(leftValue) || isFloat(rightValue) {
|
|
v = numAsFloat(leftValue) + numAsFloat(rightValue)
|
|
} else {
|
|
leftInt, _ := leftValue.(int64)
|
|
rightInt, _ := rightValue.(int64)
|
|
v = leftInt + rightInt
|
|
}
|
|
} else if isList(leftValue) || isList(rightValue) {
|
|
var leftList, rightList *ListType
|
|
var ok bool
|
|
if leftList, ok = leftValue.(*ListType); !ok {
|
|
leftList = &ListType{leftValue}
|
|
}
|
|
if rightList, ok = rightValue.(*ListType); !ok {
|
|
rightList = &ListType{rightValue}
|
|
}
|
|
sumList := make(ListType, 0, len(*leftList)+len(*rightList))
|
|
for _, item := range *leftList {
|
|
sumList = append(sumList, item)
|
|
}
|
|
for _, item := range *rightList {
|
|
sumList = append(sumList, item)
|
|
}
|
|
v = &sumList
|
|
} else if isFraction(leftValue) || isFraction(rightValue) {
|
|
if isFloat(leftValue) || isFloat(rightValue) {
|
|
v = numAsFloat(leftValue) + numAsFloat(rightValue)
|
|
} else {
|
|
v, err = sumAnyFract(leftValue, rightValue)
|
|
}
|
|
} else {
|
|
err = self.errIncompatibleTypes(leftValue, rightValue)
|
|
}
|
|
return
|
|
}
|
|
|
|
//-------- minus term
|
|
|
|
func newMinusTerm(tk *Token) (inst *term) {
|
|
return &term{
|
|
tk: *tk,
|
|
children: make([]*term, 0, 2),
|
|
position: posInfix,
|
|
priority: priSum,
|
|
evalFunc: evalMinus,
|
|
}
|
|
}
|
|
|
|
func evalMinus(ctx ExprContext, self *term) (v any, err error) {
|
|
var leftValue, rightValue any
|
|
|
|
if leftValue, rightValue, err = self.evalInfix(ctx); err != nil {
|
|
return
|
|
}
|
|
|
|
if isNumber(leftValue) && isNumber(rightValue) {
|
|
if isFloat(leftValue) || isFloat(rightValue) {
|
|
v = numAsFloat(leftValue) - numAsFloat(rightValue)
|
|
} else {
|
|
leftInt, _ := leftValue.(int64)
|
|
rightInt, _ := rightValue.(int64)
|
|
v = leftInt - rightInt
|
|
}
|
|
} else if isList(leftValue) && isList(rightValue) {
|
|
leftList, _ := leftValue.(*ListType)
|
|
rightList, _ := rightValue.(*ListType)
|
|
diffList := make(ListType, 0, len(*leftList)-len(*rightList))
|
|
for _, item := range *leftList {
|
|
if slices.Index(*rightList, item) < 0 {
|
|
diffList = append(diffList, item)
|
|
}
|
|
}
|
|
v = &diffList
|
|
} else if isFraction(leftValue) || isFraction(rightValue) {
|
|
v, err = subAnyFract(leftValue, rightValue)
|
|
} else {
|
|
err = self.errIncompatibleTypes(leftValue, rightValue)
|
|
}
|
|
return
|
|
}
|
|
|
|
// init
|
|
func init() {
|
|
registerTermConstructor(SymPlus, newPlusTerm)
|
|
registerTermConstructor(SymMinus, newMinusTerm)
|
|
}
|