This repository has been archived by the owner on Jul 20, 2023. It is now read-only.
forked from arangodb/go-driver
-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_impl.go
138 lines (118 loc) · 3.4 KB
/
graph_impl.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
//
// DISCLAIMER
//
// Copyright 2023 ArangoDB GmbH, Cologne, Germany
//
// 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.
//
// Copyright holder is ArangoDB GmbH, Cologne, Germany
//
package driver
import (
"context"
"path"
)
// newGraph creates a new Graph implementation.
func newGraph(input graphDefinition, db *database) (Graph, error) {
if input.Name == "" {
return nil, WithStack(InvalidArgumentError{Message: "name is empty"})
}
if db == nil {
return nil, WithStack(InvalidArgumentError{Message: "db is nil"})
}
return &graph{
input: input,
db: db,
conn: db.conn,
}, nil
}
type graph struct {
input graphDefinition
db *database
conn Connection
}
func (g *graph) IsSmart() bool {
return g.input.IsSmart
}
func (g *graph) IsDisjoint() bool {
return g.input.IsDisjoint
}
func (g *graph) IsSatellite() bool {
return g.input.IsSatellite
}
// relPath creates the relative path to this graph (`_db/<db-name>/_api/gharial/<graph-name>`)
func (g *graph) relPath() string {
escapedName := pathEscape(g.Name())
return path.Join(g.db.relPath(), "_api", "gharial", escapedName)
}
// Name returns the name of the graph.
func (g *graph) Name() string {
return g.input.Name
}
// ID returns the id of the graph.
func (g *graph) ID() string {
return g.input.ID
}
// Key returns the key of the graph.
func (g *graph) Key() DocumentID {
return g.input.Key
}
// Rev returns the key of the graph.
func (g *graph) Rev() string {
return g.input.Rev
}
// EdgeDefinitions returns the edge definitions of the graph.
func (g *graph) EdgeDefinitions() []EdgeDefinition {
return g.input.EdgeDefinitions
}
// SmartGraphAttribute returns the attributes of a smart graph if there are any.
func (g *graph) SmartGraphAttribute() string {
return g.input.SmartGraphAttribute
}
// MinReplicationFactor returns the minimum replication factor for the graph.
func (g *graph) MinReplicationFactor() int {
return g.input.MinReplicationFactor
}
// NumberOfShards returns the number of shards for the graph.
func (g *graph) NumberOfShards() int {
return g.input.NumberOfShards
}
// OrphanCollections returns the orphan collections of the graph.
func (g *graph) OrphanCollections() []string {
return g.input.OrphanCollections
}
// ReplicationFactor returns the current replication factor.
func (g *graph) ReplicationFactor() int {
return int(g.input.ReplicationFactor)
}
// WriteConcern returns the write concern setting of the graph.
func (g *graph) WriteConcern() int {
return g.input.WriteConcern
}
// Remove removes the entire graph.
// If the graph does not exist, a NotFoundError is returned.
func (g *graph) Remove(ctx context.Context) error {
req, err := g.conn.NewRequest("DELETE", g.relPath())
if err != nil {
return WithStack(err)
}
applyContextSettings(ctx, req)
resp, err := g.conn.Do(ctx, req)
if err != nil {
return WithStack(err)
}
if err := resp.CheckStatus(201, 202); err != nil {
return WithStack(err)
}
return nil
}