-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathcypherBuilder.go
108 lines (94 loc) · 3.43 KB
/
cypherBuilder.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
// MIT License
//
// Copyright (c) 2020 codingfinest
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
package gogm
import (
"reflect"
"strings"
)
type graphQueryBuilder interface {
getCreate() (string, string, map[string]interface{}, map[string]graph)
getMatch() (string, map[string]interface{}, map[string]graph)
getSet() (string, map[string]interface{})
getDelete() (string, map[string]interface{}, map[string]graph)
getLoadAll(IDs interface{}, lo *LoadOptions) (string, map[string]interface{})
getDeleteAll() (string, map[string]interface{})
getCountEntitiesOfType() (string, map[string]interface{})
getGraph() graph
isGraphDirty() bool
getRemovedGraphs() (map[int64]graph, map[int64]graph)
}
func newCypherBuilder(g graph, registry *registry, store store) (graphQueryBuilder, error) {
var (
qGraphBuilder graphQueryBuilder
stored graph
err error
)
if store != nil {
stored = store.get(g)
}
switch v := g.(type) {
case *node:
if qGraphBuilder, err = newNodeCypherBuilder(v, registry, stored); err != nil {
return nil, err
}
case *relationship:
qGraphBuilder = newRelationshipCypherBuilder(v, registry, stored)
}
return qGraphBuilder, nil
}
func getCreateSchemaStatement(metadata metadata) []string {
var indexes []string
var unique = map[string]bool{}
var statements []string
var objectMetadata *nodeMetadata
var ok bool
if typeOfNodeMetadata != reflect.TypeOf(metadata) {
return statements
}
if objectMetadata, ok = metadata.(*nodeMetadata); !ok {
return nil
}
for name, structField := range metadata.getPropertyStructFields() {
namespaceTag := getNamespacedTag(structField.Tag)
if (len(namespaceTag.get(uniqueTag)) > 0 || len(namespaceTag.get(customIDTag)) > 0) && !unique[name] {
unique[name] = true
}
}
for name, structField := range metadata.getPropertyStructFields() {
namespaceTag := getNamespacedTag(structField.Tag)
if len(namespaceTag.get(indexTag)) > 0 && !unique[name] {
indexes = append(indexes, name)
}
}
for name := range unique {
for _, label := range objectMetadata.thisStructLabel {
statements = append(statements, `CREATE CONSTRAINT ON (a:`+label+`) ASSERT a.`+name+` IS UNIQUE`)
}
}
compositeIndexes := strings.Join(indexes, indexDelim)
if compositeIndexes != emptyString {
for _, label := range objectMetadata.thisStructLabel {
statements = append(statements, `CREATE INDEX ON :`+label+`(`+compositeIndexes+`)`)
}
}
return statements
}