-
Notifications
You must be signed in to change notification settings - Fork 180
/
edge.go
107 lines (88 loc) · 2.32 KB
/
edge.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
/*
* Copyright (c) 2019-2022 Abstrium SAS <team (at) pydio.com>
* This file is part of Pydio Cells.
*
* Pydio Cells is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Pydio Cells is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with Pydio Cells. If not, see <http://www.gnu.org/licenses/>.
*
* The latest code can be found at <https://pydio.com>.
*/
package util
import (
"github.com/pydio/cells/v4/common/utils/std"
"golang.org/x/exp/maps"
pb "github.com/pydio/cells/v4/common/proto/registry"
"github.com/pydio/cells/v4/common/registry"
"github.com/pydio/cells/v4/common/utils/merger"
)
func ToProtoEdge(e registry.Edge) *pb.Edge {
if dd, ok := e.(*edge); ok {
return dd.E
}
return &pb.Edge{
Vertices: e.Vertices(),
}
}
func ToEdge(i *pb.Item, e *pb.Edge) registry.Edge {
return &edge{I: i, E: e}
}
type edge struct {
I *pb.Item
E *pb.Edge
}
func (d *edge) Equals(differ merger.Differ) bool {
if di, ok := differ.(*edge); ok {
return di.ID() == d.ID()
}
return false
}
func (d *edge) IsDeletable(m map[string]string) bool {
return true
}
func (d *edge) IsMergeable(differ merger.Differ) bool {
return d.ID() == differ.GetUniqueId()
}
func (d *edge) GetUniqueId() string {
return d.ID()
}
func (d *edge) Merge(differ merger.Differ, m map[string]string) (merger.Differ, error) {
return differ, nil
}
func (d *edge) Name() string {
return d.I.Name
}
func (d *edge) ID() string {
return d.I.Id
}
func (d *edge) Metadata() map[string]string {
if d.I.Metadata == nil {
return map[string]string{}
}
return maps.Clone(d.I.Metadata)
}
func (d *edge) As(i interface{}) bool {
if ii, ok := i.(*registry.Edge); ok {
*ii = d
return true
}
return false
}
func (d *edge) Vertices() []string {
return d.E.Vertices
}
func (d *edge) Clone() interface{} {
clone := &edge{}
clone.I = std.DeepClone(d.I)
clone.E = std.DeepClone(d.E)
return clone
}