mirror of
https://github.com/MontFerret/ferret.git
synced 2024-12-16 11:37:36 +02:00
61 lines
1.3 KiB
Go
61 lines
1.3 KiB
Go
|
package arrays_test
|
||
|
|
||
|
import (
|
||
|
"context"
|
||
|
"github.com/MontFerret/ferret/pkg/runtime/values"
|
||
|
"github.com/MontFerret/ferret/pkg/stdlib/arrays"
|
||
|
. "github.com/smartystreets/goconvey/convey"
|
||
|
"testing"
|
||
|
)
|
||
|
|
||
|
func TestSortedUnique(t *testing.T) {
|
||
|
Convey("Should sort numbers", t, func() {
|
||
|
arr := values.NewArrayWith(
|
||
|
values.NewInt(3),
|
||
|
values.NewInt(4),
|
||
|
values.NewInt(5),
|
||
|
values.NewInt(1),
|
||
|
values.NewInt(6),
|
||
|
values.NewInt(2),
|
||
|
values.NewInt(6),
|
||
|
values.NewInt(5),
|
||
|
values.NewInt(1),
|
||
|
values.NewInt(4),
|
||
|
)
|
||
|
|
||
|
out, err := arrays.SortedUnique(context.Background(), arr)
|
||
|
|
||
|
So(err, ShouldBeNil)
|
||
|
So(out.String(), ShouldEqual, "[1,2,3,4,5,6]")
|
||
|
})
|
||
|
|
||
|
Convey("Should sort strings", t, func() {
|
||
|
arr := values.NewArrayWith(
|
||
|
values.NewString("e"),
|
||
|
values.NewString("b"),
|
||
|
values.NewString("a"),
|
||
|
values.NewString("c"),
|
||
|
values.NewString("a"),
|
||
|
values.NewString("d"),
|
||
|
values.NewString("f"),
|
||
|
values.NewString("d"),
|
||
|
values.NewString("e"),
|
||
|
values.NewString("f"),
|
||
|
)
|
||
|
|
||
|
out, err := arrays.SortedUnique(context.Background(), arr)
|
||
|
|
||
|
So(err, ShouldBeNil)
|
||
|
So(out.String(), ShouldEqual, `["a","b","c","d","e","f"]`)
|
||
|
})
|
||
|
|
||
|
Convey("Should return empty array", t, func() {
|
||
|
arr := values.NewArrayWith()
|
||
|
|
||
|
out, err := arrays.SortedUnique(context.Background(), arr)
|
||
|
|
||
|
So(err, ShouldBeNil)
|
||
|
So(out.String(), ShouldEqual, `[]`)
|
||
|
})
|
||
|
}
|