go/ferret
1
0
Fork 0
mirror of https://github.com/MontFerret/ferret.git synced 2025-07-03 00:46:51 +02:00
Code Issues Releases Activity

Feature/#9 array functions (#57)

Browse Source 
* #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
This commit is contained in:
Tim Voronov
2018-10-05 21:27:34 -04:00
committed by GitHub
parent 9e947ea9c4
commit ec2d6a659b
53 changed files with 3053 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

88
pkg/stdlib/arrays/outersection_test.go Normal file
View File

@ -0,0 +1,88 @@
package arrays_test
import (
"context"
"github.com/MontFerret/ferret/pkg/runtime/core"
"github.com/MontFerret/ferret/pkg/runtime/values"
"github.com/MontFerret/ferret/pkg/stdlib/arrays"
. "github.com/smartystreets/goconvey/convey"
"testing"
)
func TestOutersection(t *testing.T) {
Convey("Should find intersections between 2 arrays", t, func() {
arr1 := values.NewArrayWith(
values.NewInt(1),
values.NewInt(2),
values.NewInt(3),
)
arr2 := values.NewArrayWith(
values.NewInt(2),
values.NewInt(3),
values.NewInt(4),
)
out, err := arrays.Outersection(context.Background(), arr1, arr2)
check := map[int]bool{
1: true,
4: true,
}
So(err, ShouldBeNil)
arr := out.(*values.Array)
So(arr.Length(), ShouldEqual, 2)
arr.ForEach(func(value core.Value, idx int) bool {
_, exists := check[int(value.(values.Int))]
So(exists, ShouldBeTrue)
return true
})
})
Convey("Should find intersections between more than 2 arrays", t, func() {
arr1 := values.NewArrayWith(
values.NewInt(1),
values.NewInt(2),
values.NewInt(3),
)
arr2 := values.NewArrayWith(
values.NewInt(2),
values.NewInt(3),
values.NewInt(4),
)
arr3 := values.NewArrayWith(
values.NewInt(3),
values.NewInt(4),
values.NewInt(5),
)
out, err := arrays.Outersection(context.Background(), arr1, arr2, arr3)
check := map[int]bool{
1: true,
5: true,
}
So(err, ShouldBeNil)
arr := out.(*values.Array)
So(arr.Length(), ShouldEqual, 2)
arr.ForEach(func(value core.Value, idx int) bool {
_, exists := check[int(value.(values.Int))]
So(exists, ShouldBeTrue)
return true
})
})
}