/
builder.go
198 lines (181 loc) · 4.17 KB
/
builder.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
package jstmpl
import (
"sort"
"github.com/go-jstmpl/go-jstmpl/helpers"
"github.com/go-jstmpl/go-jstmpl/types"
"github.com/lestrrat/go-jshschema"
"github.com/lestrrat/go-jsschema"
)
type Builder struct {
Schema *schema.Schema
}
func NewBuilder() *Builder {
return &Builder{}
}
func (b *Builder) Build(hs *hschema.HyperSchema) (*types.Root, error) {
r, err := types.NewRoot(hs)
if err != nil {
return nil, err
}
ctx := &types.Context{
Validations: map[string]bool{},
}
var ds, os, as, ss, ns, is, bs, ps []types.Schema
for k, s := range hs.Definitions {
ctx.Key = k
rs, err := Resolve(s, hs.Schema, ctx)
if err != nil {
return nil, err
}
ds = append(ds, rs)
func(s interface{}) {
switch ts := s.(type) {
case *types.Object:
os = append(os, ts)
case *types.Array:
as = append(as, ts)
case *types.String:
ss = append(ss, ts)
case *types.Number:
ns = append(ns, ts)
case *types.Integer:
is = append(is, ts)
case *types.Boolean:
bs = append(bs, ts)
}
}(rs)
}
for k, s := range hs.Properties {
ctx.Key = k
rs, err := Resolve(s, hs.Schema, ctx)
if err != nil {
return nil, err
}
ps = append(ps, rs)
}
sort.Sort(types.SchemasByKey(ds))
sort.Sort(types.SchemasByKey(os))
sort.Sort(types.SchemasByKey(as))
sort.Sort(types.SchemasByKey(ss))
sort.Sort(types.SchemasByKey(ns))
sort.Sort(types.SchemasByKey(is))
sort.Sort(types.SchemasByKey(bs))
sort.Sort(types.SchemasByKey(ps))
r.Definitions = ds
r.Objects = make([]*types.Object, len(os))
for i, v := range os {
r.Objects[i] = v.(*types.Object)
}
r.Arrays = make([]*types.Array, len(as))
for i, v := range as {
r.Arrays[i] = v.(*types.Array)
}
r.Strings = make([]*types.String, len(ss))
for i, v := range ss {
r.Strings[i] = v.(*types.String)
}
r.Numbers = make([]*types.Number, len(ns))
for i, v := range ns {
r.Numbers[i] = v.(*types.Number)
}
r.Integers = make([]*types.Integer, len(is))
for i, v := range is {
r.Integers[i] = v.(*types.Integer)
}
r.Booleans = make([]*types.Boolean, len(bs))
for i, v := range bs {
r.Booleans[i] = v.(*types.Boolean)
}
r.Properties = ps
for i, l := range hs.Links {
var (
s, ts types.Schema
us []types.Schema
)
if l.Schema != nil {
ctx.Key = ""
s, err = Resolve(l.Schema, hs.Schema, ctx)
if err != nil {
return nil, err
}
}
if l.TargetSchema != nil {
ctx.Key = ""
ts, err = Resolve(l.TargetSchema, hs.Schema, ctx)
if err != nil {
return nil, err
}
}
tokens, err := helpers.BuildURLToken(l.Href)
if err != nil {
return nil, err
}
for _, token := range tokens {
if ref, ok := token.(helpers.Ref); ok {
s := schema.New()
s.Reference = string(ref)
rs, err := Resolve(s, hs.Schema, ctx)
if err != nil {
return nil, err
}
us = append(us, rs)
}
}
rl, err := types.NewLink(l, s, ts, r, us)
if err != nil {
return nil, err
}
r.Links[i] = rl
}
r.RequiredValidations = ctx.RequiredValidations()
return r, nil
}
func Resolve(s, t *schema.Schema, ctx *types.Context) (types.Schema, error) {
rs, err := s.Resolve(t)
ctx.Raw = s
if err != nil {
return nil, err
}
var ts types.Schema
if rs.Type.Contains(schema.ObjectType) {
obj := types.NewObject(ctx, rs)
for key, sp := range rs.Properties {
if sp != nil {
ctx.Key = key
dp, err := Resolve(sp, t, ctx)
if err != nil {
return nil, err
}
ps := append(obj.Properties, dp)
sort.Sort(types.SchemasByKey(ps))
obj.Properties = ps
}
}
ts = obj
} else if rs.Type.Contains(schema.ArrayType) {
arr := types.NewArray(ctx, rs)
for i, sp := range rs.Items.Schemas {
ctx.Key = ""
dp, err := Resolve(sp, t, ctx)
if err != nil {
return nil, err
}
arr.Items.Schemas[i] = dp
if i == 0 {
arr.Item = dp
}
}
ts = arr
} else if rs.Type.Contains(schema.StringType) {
ts = types.NewString(ctx, rs)
} else if rs.Type.Contains(schema.NumberType) {
ts = types.NewNumber(ctx, rs)
} else if rs.Type.Contains(schema.IntegerType) {
ts = types.NewInteger(ctx, rs)
} else if rs.Type.Contains(schema.BooleanType) {
ts = types.NewBoolean(ctx, rs)
} else {
ts = types.NewUndefined(ctx, rs)
}
return ts, nil
}