1
0
mirror of https://github.com/MontFerret/ferret.git synced 2025-03-19 21:28:32 +02:00
ferret/pkg/stdlib/arrays/minus.go
Tim Voronov 24d8eedd4c
Feature/doc markup (#543)
* Added release notes

* #509 fixedOCOD typo

* Updated values

* Updated comments

* Changed stdlib docs format

* Changed format of array in docs

* Use 'any' instead of 'value' in docs

* New format for optional params

* Updated docs for testing package

* Added namespace information
2020-08-07 21:49:29 -04:00

65 lines
1.4 KiB
Go

package arrays
import (
"context"
"github.com/MontFerret/ferret/pkg/runtime/core"
"github.com/MontFerret/ferret/pkg/runtime/values"
"github.com/MontFerret/ferret/pkg/runtime/values/types"
)
// MINUS return the difference of all arrays specified.
// The order of the result array is undefined and should not be relied on. Duplicates will be removed.
// @param {Any[], repeated} arrays - An arbitrary number of arrays as multiple arguments (at least 2).
// @return {Any[]} - An array of values that occur in the first array, but not in any of the subsequent arrays.
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 {
idx := idx
err := core.ValidateType(i, types.Array)
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
}