mirror of
https://github.com/MontFerret/ferret.git
synced 2024-12-16 11:37:36 +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
202 lines
3.1 KiB
Go
202 lines
3.1 KiB
Go
package values
|
|
|
|
import (
|
|
"encoding/binary"
|
|
"encoding/json"
|
|
"github.com/MontFerret/ferret/pkg/runtime/core"
|
|
"github.com/pkg/errors"
|
|
"hash/fnv"
|
|
)
|
|
|
|
type (
|
|
ArrayPredicate = func(value core.Value, idx int) bool
|
|
Array struct {
|
|
value []core.Value
|
|
}
|
|
)
|
|
|
|
func NewArray(size int) *Array {
|
|
return &Array{value: make([]core.Value, 0, size)}
|
|
}
|
|
|
|
func NewArrayWith(values ...core.Value) *Array {
|
|
return &Array{value: values}
|
|
}
|
|
|
|
func (t *Array) MarshalJSON() ([]byte, error) {
|
|
return json.Marshal(t.value)
|
|
}
|
|
|
|
func (t *Array) Type() core.Type {
|
|
return core.ArrayType
|
|
}
|
|
|
|
func (t *Array) String() string {
|
|
marshaled, err := t.MarshalJSON()
|
|
|
|
if err != nil {
|
|
return "[]"
|
|
}
|
|
|
|
return string(marshaled)
|
|
}
|
|
|
|
func (t *Array) Compare(other core.Value) int {
|
|
switch other.Type() {
|
|
case core.ArrayType:
|
|
arr := other.(*Array)
|
|
|
|
if t.Length() == 0 && arr.Length() == 0 {
|
|
return 0
|
|
}
|
|
|
|
var res = 1
|
|
|
|
for _, val := range t.value {
|
|
arr.ForEach(func(otherVal core.Value, idx int) bool {
|
|
res = val.Compare(otherVal)
|
|
|
|
return res != -1
|
|
})
|
|
}
|
|
|
|
return res
|
|
case core.ObjectType:
|
|
return -1
|
|
default:
|
|
return 1
|
|
}
|
|
}
|
|
|
|
func (t *Array) Unwrap() interface{} {
|
|
arr := make([]interface{}, t.Length())
|
|
|
|
for idx, val := range t.value {
|
|
arr[idx] = val.Unwrap()
|
|
}
|
|
|
|
return arr
|
|
}
|
|
|
|
func (t *Array) Hash() uint64 {
|
|
h := fnv.New64a()
|
|
|
|
h.Write([]byte(t.Type().String()))
|
|
h.Write([]byte(":"))
|
|
h.Write([]byte("["))
|
|
|
|
endIndex := len(t.value) - 1
|
|
|
|
for i, el := range t.value {
|
|
bytes := make([]byte, 8)
|
|
binary.LittleEndian.PutUint64(bytes, el.Hash())
|
|
|
|
h.Write(bytes)
|
|
|
|
if i != endIndex {
|
|
h.Write([]byte(","))
|
|
}
|
|
}
|
|
|
|
h.Write([]byte("]"))
|
|
|
|
return h.Sum64()
|
|
}
|
|
|
|
func (t *Array) Clone() core.Value {
|
|
c := NewArray(len(t.value))
|
|
|
|
for _, el := range t.value {
|
|
c.Push(el)
|
|
}
|
|
|
|
return c
|
|
}
|
|
|
|
func (t *Array) Length() Int {
|
|
return Int(len(t.value))
|
|
}
|
|
|
|
func (t *Array) ForEach(predicate ArrayPredicate) {
|
|
for idx, val := range t.value {
|
|
if predicate(val, idx) == false {
|
|
break
|
|
}
|
|
}
|
|
}
|
|
|
|
func (t *Array) Get(idx Int) core.Value {
|
|
l := len(t.value) - 1
|
|
|
|
if l < 0 {
|
|
return None
|
|
}
|
|
|
|
if int(idx) > l {
|
|
return None
|
|
}
|
|
|
|
return t.value[idx]
|
|
}
|
|
|
|
func (t *Array) Set(idx Int, value core.Value) error {
|
|
last := len(t.value) - 1
|
|
|
|
if last >= int(idx) {
|
|
t.value[idx] = value
|
|
|
|
return nil
|
|
}
|
|
|
|
return errors.Wrap(core.ErrInvalidOperation, "out of bounds")
|
|
}
|
|
|
|
func (t *Array) Push(item core.Value) {
|
|
t.value = append(t.value, item)
|
|
}
|
|
|
|
func (t *Array) Slice(from, to Int) *Array {
|
|
length := t.Length()
|
|
|
|
if from >= length {
|
|
return NewArray(0)
|
|
}
|
|
|
|
if to > length {
|
|
to = length
|
|
}
|
|
|
|
result := new(Array)
|
|
result.value = t.value[from:to]
|
|
|
|
return result
|
|
}
|
|
|
|
func (t *Array) IndexOf(item core.Value) Int {
|
|
res := Int(-1)
|
|
|
|
for idx, el := range t.value {
|
|
if el.Compare(item) == 0 {
|
|
res = Int(idx)
|
|
break
|
|
}
|
|
}
|
|
|
|
return res
|
|
}
|
|
|
|
func (t *Array) Insert(idx Int, value core.Value) {
|
|
t.value = append(t.value[:idx], append([]core.Value{value}, t.value[idx:]...)...)
|
|
}
|
|
|
|
func (t *Array) RemoveAt(idx Int) {
|
|
i := int(idx)
|
|
max := len(t.value) - 1
|
|
|
|
if i > max {
|
|
return
|
|
}
|
|
|
|
t.value = append(t.value[:i], t.value[i+1:]...)
|
|
}
|