-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathschema.go
489 lines (416 loc) · 11.3 KB
/
schema.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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
/*
* Copyright (C) 2018 Dolan and Contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package dgman
import (
"context"
"fmt"
"log"
"reflect"
"strings"
"github.com/dgraph-io/dgo/v210/protos/api"
"github.com/kr/logfmt"
"github.com/dgraph-io/dgo/v210"
)
const (
tagName = "dgraph"
predicateDgraphType = "dgraph.type"
predicateUid = "uid"
schemaUid = "uid"
schemaUidList = "[uid]"
)
type rawSchema struct {
Predicate string
Index string
Constraint string
Reverse bool
Count bool
List bool
Upsert bool
Lang bool
Type string
Noconflict bool
Unique bool
}
type Schema struct {
Predicate string
Type string
Index bool
Tokenizer []string
Reverse bool
Count bool
List bool
Upsert bool
Lang bool
Noconflict bool `json:"no_conflict"`
Unique bool
OmitEmpty bool
}
func (s Schema) String() string {
t := s.Type
if s.List {
t = fmt.Sprintf("[%s]", t)
}
schema := fmt.Sprintf("%s: %s ", s.Predicate, t)
if s.Index {
schema += fmt.Sprintf("@index(%s) ", strings.Join(s.Tokenizer, ","))
}
if s.Upsert || s.Unique {
schema += "@upsert "
}
if s.Count {
schema += "@count "
}
if s.Reverse {
schema += "@reverse "
}
if s.Lang {
schema += "@lang "
}
if s.Noconflict {
schema += "@noconflict "
}
return schema + "."
}
// TypeMap maps a dgraph type with its predicates
type TypeMap map[string]SchemaMap
func (t TypeMap) String() string {
var buffer strings.Builder
for nodeType, predicates := range t {
buffer.WriteString("type ")
buffer.WriteString(nodeType)
buffer.WriteString(" {\n")
for predicate := range predicates {
buffer.WriteString("\t")
buffer.WriteString(predicate)
buffer.WriteString("\n")
}
buffer.WriteString("}\n")
}
return buffer.String()
}
// SchemaMap maps the underlying schema defined for a predicate
type SchemaMap map[string]*Schema
func (s SchemaMap) String() string {
var buffer strings.Builder
for _, schema := range s {
buffer.WriteString(schema.String())
buffer.WriteString("\n")
}
return buffer.String()
}
type TypeSchema struct {
Types TypeMap
Schema SchemaMap
}
func (t *TypeSchema) String() string {
return strings.Join([]string{t.Schema.String(), t.Types.String()}, "\n")
}
// Marshal marshals passed models into type and schema definitions
func (t *TypeSchema) Marshal(parentType string, models ...interface{}) {
for _, model := range models {
current, err := reflectType(model)
if err != nil {
log.Println(err)
continue
}
if current.Kind() == reflect.Interface {
// don't parse raw interfaces or it will panic
continue
}
nodeType := GetNodeType(model)
if _, ok := t.Types[nodeType]; ok {
continue
}
if parentType == "" {
t.Types[nodeType] = make(SchemaMap)
} else {
// allow anonymous fields to be parsed into parent type
nodeType = parentType
}
numFields := current.NumField()
for i := 0; i < numFields; i++ {
field := current.Field(i)
fieldType := field.Type
if fieldType.Kind() == reflect.Ptr {
fieldType = fieldType.Elem()
}
if fieldType.Kind() == reflect.Struct && field.Anonymous {
fieldPtr := reflect.New(fieldType)
t.Marshal(nodeType, fieldPtr.Interface())
continue
}
s, err := parseDgraphTag(&field)
if err != nil {
log.Println("unmarshal dgraph tag: ", err)
continue
}
schema, exists := t.Schema[s.Predicate]
parse := s.Predicate != "" &&
s.Predicate != "uid" && // don't parse uid
s.Predicate != predicateDgraphType && // don't parse dgraph.type
!strings.Contains(s.Predicate, "|") && // don't parse facet
s.Predicate[0] != '~' && // don't parse reverse edge
!strings.Contains(s.Predicate, "@") // don't parse non-primary lang predicate
if !parse {
continue
}
// one-to-one and many-to-many edge
if s.Type == "uid" || s.Type == "[uid]" {
// traverse node
edgePtr := reflect.New(fieldType)
t.Marshal("", edgePtr.Interface())
}
// each type should uniquely specify a predicate, that's why use a map on predicate
t.Types[nodeType][s.Predicate] = s
if exists && schema.String() != s.String() {
log.Printf("conflicting schema %s, already defined as \"%s\", trying to define \"%s\"\n", s.Predicate, schema.String(), s.String())
} else {
t.Schema[s.Predicate] = s
}
}
}
}
// NewTypeSchema returns a new TypeSchema with allocated Schema and Types
func NewTypeSchema() *TypeSchema {
return &TypeSchema{
Schema: make(SchemaMap),
Types: make(TypeMap),
}
}
// TODO: handle go custom types, e.g: type Enum uint
func getSchemaType(fieldType reflect.Type) string {
if fieldType.Kind() == reflect.Ptr {
fieldType = fieldType.Elem()
}
// check if implements SchemaType
schemaTypeElem := reflect.New(fieldType).Interface()
if schemaTyper, ok := schemaTypeElem.(SchemaType); ok {
return schemaTyper.SchemaType()
}
switch fieldType.Kind() {
case reflect.Interface:
return "uid"
case reflect.Slice:
sliceType := fieldType.Elem()
return fmt.Sprintf("[%s]", getSchemaType(sliceType))
case reflect.Struct:
switch fieldType.PkgPath() {
case "time":
// golang std time
return "datetime"
default:
// one-to-one relation
return "uid"
}
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64,
reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
return "int"
case reflect.Float32, reflect.Float64:
return "float"
}
return fieldType.Name()
}
func getPredicate(field *reflect.StructField) (string, bool) {
// get field name from json tag
jsonTags := strings.Split(field.Tag.Get("json"), ",")
if len(jsonTags) == 2 {
return jsonTags[0], jsonTags[1] == "omitempty"
}
return jsonTags[0], false
}
func parseDgraphTag(field *reflect.StructField) (*Schema, error) {
predicate, omitEmpty := getPredicate(field)
schema := &Schema{
Predicate: predicate,
Type: getSchemaType(field.Type),
OmitEmpty: omitEmpty,
}
dgraphTag := field.Tag.Get(tagName)
if dgraphTag != "" {
dgraphProps, err := parseStructTag(dgraphTag)
if err != nil {
return nil, err
}
schema.Index = dgraphProps.Index != ""
schema.List = dgraphProps.List
schema.Upsert = dgraphProps.Upsert
schema.Count = dgraphProps.Count
schema.Reverse = dgraphProps.Reverse
schema.Unique = dgraphProps.Unique
schema.Noconflict = dgraphProps.Noconflict
schema.Lang = dgraphProps.Lang
if dgraphProps.Predicate != "" {
schema.Predicate = dgraphProps.Predicate
}
if dgraphProps.Type != "" {
schema.Type = dgraphProps.Type
}
if schema.Index {
schema.Tokenizer = strings.Split(dgraphProps.Index, ",")
}
}
return schema, nil
}
func getElemType(elemable reflect.Type) reflect.Type {
if elemable.Kind() == reflect.Slice || elemable.Kind() == reflect.Ptr {
return getElemType(elemable.Elem())
}
return elemable
}
func reflectType(model interface{}) (reflect.Type, error) {
current := reflect.TypeOf(model)
current = getElemType(current)
if current.Kind() != reflect.Struct && current.Kind() != reflect.Interface {
return nil, fmt.Errorf("model \"%s\" passed for schema is not a struct", current.Name())
}
return current, nil
}
func parseStructTag(tag string) (*rawSchema, error) {
var schema rawSchema
if err := logfmt.Unmarshal([]byte(tag), &schema); err != nil {
return nil, err
}
return &schema, nil
}
func fetchExistingSchema(c *dgo.Dgraph) ([]*Schema, error) {
schemaQuery := `
schema {
type
index
reverse
tokenizer
list
count
upsert
lang
noconflict
}
`
tx := c.NewReadOnlyTxn()
resp, err := tx.Query(context.Background(), schemaQuery)
if err != nil {
return nil, err
}
type schemaResponse struct {
Schema []*Schema `json:"schema"`
}
var schemas schemaResponse
if err = json.Unmarshal(resp.Json, &schemas); err != nil {
return nil, err
}
return schemas.Schema, nil
}
type typeQueryResponse struct {
Types []struct {
Fields []struct {
Name string `json:"name"`
} `json:"fields"`
Name string `json:"name"`
} `json:"types"`
}
func fetchExistingTypes(c *dgo.Dgraph, typeMap TypeMap) (TypeMap, error) {
// get keys of typeMap
keys := make([]string, 0, len(typeMap))
for key := range typeMap {
keys = append(keys, key)
}
typeQuery := "schema(type: [" + strings.Join(keys, ", ") + "]) {}"
tx := c.NewReadOnlyTxn()
resp, err := tx.Query(context.Background(), typeQuery)
if err != nil {
return nil, err
}
var typesResponse typeQueryResponse
if err = json.Unmarshal(resp.Json, &typesResponse); err != nil {
return nil, err
}
types := make(TypeMap)
for _, _type := range typesResponse.Types {
types[_type.Name] = make(SchemaMap)
for _, field := range _type.Fields {
types[_type.Name][field.Name] = &Schema{}
}
}
return types, nil
}
func cleanExistingSchema(c *dgo.Dgraph, schemaMap SchemaMap) error {
existingSchema, err := fetchExistingSchema(c)
if err != nil {
return err
}
for _, schema := range existingSchema {
if s, exists := schemaMap[schema.Predicate]; exists {
if s.String() != schema.String() {
log.Printf("existing schema %s, already defined as \"%s\", trying to install \"%s\"\n", schema.Predicate, schema.String(), s.String())
}
delete(schemaMap, schema.Predicate)
}
}
return nil
}
// CreateSchema generate indexes, schema, and types from struct models,
// returns the created schema map and types, does not update duplicate/conflict predicates.
func CreateSchema(c *dgo.Dgraph, models ...interface{}) (*TypeSchema, error) {
typeSchema := NewTypeSchema()
typeSchema.Marshal("", models...)
err := cleanExistingSchema(c, typeSchema.Schema)
if err != nil {
return nil, err
}
alterString := typeSchema.String()
if alterString != "" {
if err = c.Alter(context.Background(), &api.Operation{Schema: alterString}); err != nil {
return nil, err
}
}
return typeSchema, nil
}
// MutateSchema generate indexes and schema from struct models,
// attempt updates for type, schema, and indexes.
func MutateSchema(c *dgo.Dgraph, models ...interface{}) (*TypeSchema, error) {
typeSchema := NewTypeSchema()
typeSchema.Marshal("", models...)
alterString := typeSchema.String()
if alterString != "" {
if err := c.Alter(context.Background(), &api.Operation{Schema: alterString}); err != nil {
return nil, err
}
}
return typeSchema, nil
}
func getNodeType(dataType reflect.Type) string {
// get node type from struct name
nodeType := ""
dataType = getElemType(dataType)
nodeType = dataType.Name()
for i := dataType.NumField() - 1; i >= 0; i-- {
field := dataType.Field(i)
predicate, _ := getPredicate(&field)
if predicate == predicateDgraphType {
dgraphTag := field.Tag.Get(tagName)
if dgraphTag != "" {
nodeType = dgraphTag
}
break
}
}
return nodeType
}
// GetNodeType gets node type from the struct name, or "dgraph" tag
// in the "dgraph.type" predicate/json tag
func GetNodeType(data interface{}) string {
return getNodeType(reflect.TypeOf(data))
}