1
0
mirror of https://github.com/MontFerret/ferret.git synced 2024-12-16 11:37:36 +02:00
ferret/pkg/runtime/values/helpers.go
Tim Voronov eb523f01cc
Feature/#221 mouse events (#237)
* Initial work

* Added MoveMouseByXY and ScrollByXY

* Fixed liniting issues
2019-02-23 17:52:01 -05:00

385 lines
6.7 KiB
Go

package values
import (
"context"
"encoding/binary"
"encoding/json"
"hash/fnv"
"reflect"
"sort"
"strconv"
"time"
"github.com/MontFerret/ferret/pkg/runtime/core"
"github.com/MontFerret/ferret/pkg/runtime/values/types"
)
func GetIn(ctx context.Context, from core.Value, byPath []core.Value) (core.Value, error) {
if byPath == nil || len(byPath) == 0 {
return None, nil
}
var result = from
for i, segment := range byPath {
if result == None || result == nil {
break
}
segType := segment.Type()
switch segVal := result.(type) {
case *Object:
if segType != types.String {
return nil, core.TypeError(segType, types.String)
}
result, _ = segVal.Get(segment.(String))
break
case *Array:
if segType != types.Int {
return nil, core.TypeError(segType, types.Int)
}
result = segVal.Get(segment.(Int))
break
case core.Getter:
return segVal.GetIn(ctx, byPath[i:])
default:
return None, core.TypeError(
from.Type(),
types.Array,
types.Object,
core.NewType("Getter"),
)
}
}
return result, nil
}
func SetIn(ctx context.Context, to core.Value, byPath []core.Value, value core.Value) error {
if byPath == nil || len(byPath) == 0 {
return nil
}
var parent core.Value
var current = to
target := len(byPath) - 1
for idx, segment := range byPath {
parent = current
isTarget := target == idx
segmentType := segment.Type()
switch parVal := parent.(type) {
case *Object:
if segmentType != types.String {
return core.TypeError(segmentType, types.String)
}
if isTarget == false {
current, _ = parVal.Get(segment.(String))
} else {
parVal.Set(segment.(String), value)
}
break
case *Array:
if segmentType != types.Int {
return core.TypeError(segmentType, types.Int)
}
if isTarget == false {
current = parVal.Get(segment.(Int))
} else {
if err := parVal.Set(segment.(Int), value); err != nil {
return err
}
}
break
case core.Setter:
return parVal.SetIn(ctx, byPath[idx:], value)
default:
// redefine parent
isArray := segmentType.Equals(types.Int)
// it's not an index
if isArray == false {
obj := NewObject()
parent = obj
if segmentType != types.String {
return core.TypeError(segmentType, types.String)
}
if isTarget {
obj.Set(segment.(String), value)
}
} else {
arr := NewArray(10)
parent = arr
if isTarget {
if err := arr.Set(segment.(Int), value); err != nil {
return err
}
}
}
// set new parent
if err := SetIn(ctx, to, byPath[0:idx-1], parent); err != nil {
return err
}
if isTarget == false {
current = None
}
break
}
}
return nil
}
func Parse(input interface{}) core.Value {
switch value := input.(type) {
case bool:
return NewBoolean(value)
case string:
return NewString(value)
case int:
return NewInt(value)
case float64:
return NewFloat(value)
case float32:
return NewFloat(float64(value))
case time.Time:
return NewDateTime(value)
case []interface{}:
arr := NewArray(len(value))
for _, el := range value {
arr.Push(Parse(el))
}
return arr
case map[string]interface{}:
obj := NewObject()
for key, el := range value {
obj.Set(NewString(key), Parse(el))
}
return obj
case []byte:
return NewBinary(value)
case nil:
return None
default:
v := reflect.ValueOf(value)
t := reflect.TypeOf(value)
kind := t.Kind()
if kind == reflect.Slice || kind == reflect.Array {
size := v.Len()
arr := NewArray(size)
for i := 0; i < size; i++ {
curVal := v.Index(i)
arr.Push(Parse(curVal.Interface()))
}
return arr
}
if kind == reflect.Map {
keys := v.MapKeys()
obj := NewObject()
for _, k := range keys {
key := Parse(k.Interface())
curVal := v.MapIndex(k)
obj.Set(NewString(key.String()), Parse(curVal.Interface()))
}
return obj
}
if kind == reflect.Struct {
obj := NewObject()
size := t.NumField()
for i := 0; i < size; i++ {
field := t.Field(i)
fieldValue := v.Field(i)
obj.Set(NewString(field.Name), Parse(fieldValue.Interface()))
}
return obj
}
return None
}
}
func Unmarshal(value json.RawMessage) (core.Value, error) {
var o interface{}
err := json.Unmarshal(value, &o)
if err != nil {
return None, err
}
return Parse(o), nil
}
func ToBoolean(input core.Value) core.Value {
switch input.Type() {
case types.Boolean:
return input
case types.None:
return False
case types.String:
return NewBoolean(input.String() != "")
case types.Int:
return NewBoolean(input.(Int) != 0)
case types.Float:
return NewBoolean(input.(Float) != 0)
default:
return True
}
}
func ToFloat(input core.Value) (Float, error) {
switch val := input.(type) {
case Float:
return val, nil
case Int:
return Float(val), nil
case String:
i, err := strconv.ParseFloat(string(val), 64)
if err != nil {
return ZeroFloat, err
}
return Float(i), nil
default:
return ZeroFloat, core.TypeError(input.Type(), types.Int, types.Float, types.String)
}
}
func ToInt(input core.Value) (Int, error) {
switch val := input.(type) {
case Int:
return val, nil
case Float:
return Int(val), nil
case String:
i, err := strconv.ParseInt(string(val), 10, 64)
if err != nil {
return ZeroInt, err
}
return Int(i), nil
default:
return ZeroInt, core.TypeError(input.Type(), types.Int, types.Float, types.String)
}
}
func ToArray(ctx context.Context, input core.Value) (core.Value, error) {
switch value := input.(type) {
case Boolean,
Int,
Float,
String,
DateTime:
return NewArrayWith(value), nil
case *Array:
return value.Copy(), nil
case *Object:
arr := NewArray(int(value.Length()))
value.ForEach(func(value core.Value, key string) bool {
arr.Push(value)
return true
})
return arr, nil
case core.Iterable:
iterator, err := value.Iterate(ctx)
if err != nil {
return None, err
}
arr := NewArray(10)
for {
val, _, err := iterator.Next(ctx)
if err != nil {
return None, err
}
if val == None {
break
}
arr.Push(val)
}
return arr, nil
default:
return NewArray(0), nil
}
}
func MapHash(input map[string]core.Value) uint64 {
h := fnv.New64a()
keys := make([]string, 0, len(input))
for key := range input {
keys = append(keys, key)
}
// order does not really matter
// but it will give us a consistent hash sum
sort.Strings(keys)
endIndex := len(keys) - 1
h.Write([]byte("{"))
for idx, key := range keys {
h.Write([]byte(key))
h.Write([]byte(":"))
el := input[key]
bytes := make([]byte, 8)
binary.LittleEndian.PutUint64(bytes, el.Hash())
h.Write(bytes)
if idx != endIndex {
h.Write([]byte(","))
}
}
h.Write([]byte("}"))
return h.Sum64()
}