1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
package luar
import (
"reflect"
"github.com/yuin/gopher-lua"
)
func arrayIndex(L *lua.LState) int {
ref, mt := check(L, 1)
ref = reflect.Indirect(ref)
key := L.CheckAny(2)
switch converted := key.(type) {
case lua.LNumber:
index := int(converted)
if index < 1 || index > ref.Len() {
L.ArgError(2, "index out of range")
}
val := ref.Index(index - 1)
if (val.Kind() == reflect.Struct || val.Kind() == reflect.Array) && val.CanAddr() {
val = val.Addr()
}
L.Push(New(L, val.Interface()))
case lua.LString:
if fn := mt.method(string(converted)); fn != nil {
L.Push(fn)
return 1
}
return 0
default:
L.ArgError(2, "must be a number or string")
}
return 1
}
func arrayPtrIndex(L *lua.LState) int {
ref, mt := check(L, 1)
ref = ref.Elem()
key := L.CheckAny(2)
switch converted := key.(type) {
case lua.LNumber:
index := int(converted)
if index < 1 || index > ref.Len() {
L.ArgError(2, "index out of range")
}
val := ref.Index(index - 1)
if (val.Kind() == reflect.Struct || val.Kind() == reflect.Array) && val.CanAddr() {
val = val.Addr()
}
L.Push(New(L, val.Interface()))
case lua.LString:
if fn := mt.method(string(converted)); fn != nil {
L.Push(fn)
return 1
}
mt = MT(L, ref.Interface())
if fn := mt.method(string(converted)); fn != nil {
L.Push(fn)
return 1
}
return 0
default:
L.ArgError(2, "must be a number or string")
}
return 1
}
func arrayPtrNewIndex(L *lua.LState) int {
ref, _ := check(L, 1)
ref = ref.Elem()
index := L.CheckInt(2)
value := L.CheckAny(3)
if index < 1 || index > ref.Len() {
L.ArgError(2, "index out of range")
}
hint := ref.Type().Elem()
val, err := lValueToReflect(L, value, hint, nil)
if err != nil {
L.ArgError(3, err.Error())
}
ref.Index(index - 1).Set(val)
return 0
}
func arrayLen(L *lua.LState) int {
ref, _ := check(L, 1)
ref = reflect.Indirect(ref)
L.Push(lua.LNumber(ref.Len()))
return 1
}
func arrayCall(L *lua.LState) int {
ref, _ := check(L, 1)
ref = reflect.Indirect(ref)
i := 0
fn := func(L *lua.LState) int {
if i >= ref.Len() {
return 0
}
item := ref.Index(i).Interface()
L.Push(lua.LNumber(i + 1))
L.Push(New(L, item))
i++
return 2
}
L.Push(L.NewFunction(fn))
return 1
}
func arrayEq(L *lua.LState) int {
ref1, _ := check(L, 1)
ref2, _ := check(L, 2)
L.Push(lua.LBool(ref1.Interface() == ref2.Interface()))
return 1
}
|
