-
Notifications
You must be signed in to change notification settings - Fork 171
/
etl.go
100 lines (84 loc) · 2.24 KB
/
etl.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
/*
* 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 configregistry
import (
"github.com/pydio/cells/v4/common/etl"
"github.com/pydio/cells/v4/common/registry"
"github.com/pydio/cells/v4/common/utils/merger"
)
func init() {
etl.RegisterConverter(&converter{})
}
type converter struct{}
func (c *converter) Convert(i interface{}) ([]merger.Differ, bool) {
var res []merger.Differ
items, ok := i.([]registry.Item)
if !ok {
return nil, false
}
for _, i := range items {
res = append(res, i.(merger.Differ))
}
return res, true
}
type Diff struct {
// List of acl to be updated
update []registry.Item
// List of acl to be deleted
delete []registry.Item
// List of acl to be created
create []registry.Item
}
func (a *Diff) Add(vs ...interface{}) {
for _, v := range vs {
a.create = append(a.create, v.(registry.Item))
}
}
func (a *Diff) Update(vs ...interface{}) {
for _, v := range vs {
a.update = append(a.update, v.(registry.Item))
}
}
func (a *Diff) Delete(vs ...interface{}) {
for _, v := range vs {
a.delete = append(a.delete, v.(registry.Item))
}
}
func (a *Diff) ToAdd() []interface{} {
var res []interface{}
for _, v := range a.create {
res = append(res, v)
}
return res
}
func (a *Diff) ToUpdate() []interface{} {
var res []interface{}
for _, v := range a.update {
res = append(res, v)
}
return res
}
func (a *Diff) ToDelete() []interface{} {
var res []interface{}
for _, v := range a.delete {
res = append(res, v)
}
return res
}