-
Notifications
You must be signed in to change notification settings - Fork 4
/
lambda.go
228 lines (202 loc) · 4.69 KB
/
lambda.go
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
package ast
import (
"fmt"
"github.com/dipdup-net/go-lib/tools/base"
"github.com/dipdup-net/go-lib/tools/consts"
"github.com/dipdup-net/go-lib/tools/forge"
"github.com/dipdup-net/go-lib/tools/formatter"
"github.com/dipdup-net/go-lib/tools/translator"
)
// Lambda -
type Lambda struct {
Default
InputType Node
ReturnType Node
}
// NewLambda -
func NewLambda(depth int) *Lambda {
return &Lambda{
Default: NewDefault(consts.LAMBDA, -1, depth),
}
}
// MarshalJSON -
func (l *Lambda) MarshalJSON() ([]byte, error) {
return marshalJSON(consts.LAMBDA, l.Annots, l.InputType, l.ReturnType)
}
// ParseType -
func (l *Lambda) ParseType(node *base.Node, id *int) error {
if err := l.Default.ParseType(node, id); err != nil {
return err
}
typ, err := typeNode(node.Args[0], l.Depth, id)
if err != nil {
return err
}
l.InputType = typ
retTyp, err := typeNode(node.Args[1], l.Depth, id)
if err != nil {
return err
}
l.ReturnType = retTyp
return nil
}
// ParseValue -
func (l *Lambda) ParseValue(node *base.Node) error {
tree := node.Args
if node.BytesValue != nil {
t, err := forge.UnpackString(*node.BytesValue)
if err != nil {
return err
}
tree = t
}
str, err := json.MarshalToString(tree)
if err != nil {
return err
}
l.Value = str
return nil
}
// ToBaseNode -
func (l *Lambda) ToBaseNode(optimized bool) (*base.Node, error) {
var lambda base.Node
if err := json.UnmarshalFromString(l.Value.(string), &lambda); err != nil {
return nil, err
}
return &lambda, nil
}
// ToMiguel -
func (l *Lambda) ToMiguel() (*MiguelNode, error) {
var formatted string
if s, ok := l.Value.(string); ok {
val, err := formatter.MichelineStringToMichelson(s, false, formatter.DefLineSize)
if err != nil {
return nil, err
}
formatted = val
}
name := l.GetTypeName()
return &MiguelNode{
Value: formatted,
Type: l.Prim,
Prim: l.Prim,
Name: &name,
}, nil
}
// FromJSONSchema -
func (l *Lambda) FromJSONSchema(data map[string]interface{}) error {
for key := range data {
if l.GetTypeName() == key {
t, err := translator.NewConverter()
if err != nil {
return err
}
jsonLambda, err := t.FromString(data[key].(string))
if err != nil {
return err
}
l.Value = jsonLambda
l.ValueKind = valueKindString
}
}
return nil
}
// ToJSONSchema -
func (l *Lambda) ToJSONSchema() (*JSONSchema, error) {
return getStringJSONSchema(l.Default), nil
}
// ToParameters -
func (l *Lambda) ToParameters() ([]byte, error) {
return []byte(l.Value.(string)), nil
}
// Docs -
func (l *Lambda) Docs(inferredName string) ([]Typedef, string, error) {
name := getNameDocString(l, inferredName)
typedef := Typedef{
Name: name,
Type: fmt.Sprintf("lambda(%s, %s)", l.InputType.GetPrim(), l.ReturnType.GetPrim()),
Args: make([]TypedefArg, 0),
}
if isSimpleDocType(l.InputType.GetPrim()) && isSimpleDocType(l.ReturnType.GetPrim()) {
return []Typedef{typedef}, typedef.Type, nil
}
iStr, err := json.MarshalToString(l.InputType)
if err != nil {
return nil, "", err
}
parameter, err := formatter.MichelineToMichelsonInline(iStr)
if err != nil {
return nil, "", err
}
typedef.Args = append(typedef.Args, TypedefArg{Key: "input", Value: parameter})
rStr, err := json.MarshalToString(l.ReturnType)
if err != nil {
return nil, "", err
}
returnValue, err := formatter.MichelineToMichelsonInline(rStr)
if err != nil {
return nil, "", err
}
typedef.Args = append(typedef.Args, TypedefArg{Key: "return", Value: returnValue})
typedef.Type = consts.LAMBDA
return []Typedef{typedef}, makeVarDocString(name), nil
}
// Distinguish -
func (l *Lambda) Distinguish(x Distinguishable) (*MiguelNode, error) {
second, ok := x.(*Lambda)
if !ok {
return nil, nil
}
curr, err := l.ToMiguel()
if err != nil {
return nil, err
}
prev, err := second.ToMiguel()
if err != nil {
return nil, err
}
if prev.Value != curr.Value {
curr.From = prev.Value
switch {
case curr.Value == "":
curr.DiffType = MiguelKindDelete
case prev.Value == "":
curr.DiffType = MiguelKindCreate
default:
curr.DiffType = MiguelKindUpdate
}
}
return curr, nil
}
// EqualType -
func (l *Lambda) EqualType(node Node) bool {
if !l.Default.EqualType(node) {
return false
}
second, ok := node.(*Lambda)
if !ok {
return false
}
if !l.InputType.EqualType(second.InputType) {
return false
}
return l.ReturnType.EqualType(second.ReturnType)
}
// GetJSONModel -
func (l *Lambda) GetJSONModel(model JSONModel) {
if model == nil {
return
}
s, err := formatter.MichelineToMichelsonInline(l.Value.(string))
if err != nil {
return
}
model[l.GetName()] = s
}
// FindByName -
func (l *Lambda) FindByName(name string, isEntrypoint bool) Node {
if l.GetName() == name {
return l
}
return nil
}