mirror of
https://github.com/MontFerret/ferret.git
synced 2024-12-14 11:23:02 +02:00
ec2d6a659b
* #9 Added 'APPEND' function * #9 Added 'FIRST' function * #9 Added 'FLATTEN' function * #9 Added 'INTERSECTION' function * #9 Added 'LAST' function * #9 Added 'MINUS' function * #9 Added 'NTH' function * #9 Added 'OUTERSECTION' function * #9 Added 'POP' function * #9 Added 'POSITION' function * #9 Added 'PUSH' function * Fixed nil pointer exception in value parser * #9 Added 'REMOVE_NTH' function * #9 Added 'REMOVE_VALUE' function * #9 Added 'REMOVE_VALUES' function * #9 Added 'REVERSE' function * #9 Added 'SHIFT' function * #9 Added 'SLICE' function * Removed meme * #9 Added 'SORTED' function * #9 Added SORTED_UNIQUE function * #9 Added 'UNION' function * #9 Added 'UNION_DISTINCT' function * #9 Added 'UNIQUE' function * #9 Added 'UNSHIFT' function * #9 Made more strict optional arg validation * #9 Fixed linting errors
64 lines
1.4 KiB
Go
64 lines
1.4 KiB
Go
package arrays
|
|
|
|
import (
|
|
"context"
|
|
"github.com/MontFerret/ferret/pkg/runtime/core"
|
|
"github.com/MontFerret/ferret/pkg/runtime/values"
|
|
)
|
|
|
|
/*
|
|
* Return the difference of all arrays specified.
|
|
* @param arrays (Array, repeated) - An arbitrary number of arrays as multiple arguments (at least 2).
|
|
* @returns array (Array) - An array of values that occur in the first array, but not in any of the subsequent arrays.
|
|
* The order of the result array is undefined and should not be relied on. Duplicates will be removed.
|
|
*/
|
|
func Minus(_ context.Context, args ...core.Value) (core.Value, error) {
|
|
err := core.ValidateArgs(args, 2, core.MaxArgs)
|
|
|
|
if err != nil {
|
|
return values.None, err
|
|
}
|
|
|
|
intersections := make(map[uint64]core.Value)
|
|
capacity := values.NewInt(0)
|
|
|
|
for idx, i := range args {
|
|
err := core.ValidateType(i, core.ArrayType)
|
|
|
|
if err != nil {
|
|
return values.None, err
|
|
}
|
|
|
|
arr := i.(*values.Array)
|
|
|
|
arr.ForEach(func(value core.Value, _ int) bool {
|
|
h := value.Hash()
|
|
|
|
// first array, fill out the map
|
|
if idx == 0 {
|
|
capacity = arr.Length()
|
|
intersections[h] = value
|
|
|
|
return true
|
|
}
|
|
|
|
_, exists := intersections[h]
|
|
|
|
// if it exists in the first array, remove it
|
|
if exists {
|
|
delete(intersections, h)
|
|
}
|
|
|
|
return true
|
|
})
|
|
}
|
|
|
|
result := values.NewArray(int(capacity))
|
|
|
|
for _, item := range intersections {
|
|
result.Push(item)
|
|
}
|
|
|
|
return result, nil
|
|
}
|