/
node.go
147 lines (115 loc) · 2.79 KB
/
node.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
package adaptors
import (
"github.com/jinzhu/gorm"
"github.com/e154/smart-home/db"
m "github.com/e154/smart-home/models"
"github.com/e154/smart-home/common"
)
type Node struct {
table *db.Nodes
db *gorm.DB
}
func GetNodeAdaptor(d *gorm.DB) *Node {
return &Node{
table: &db.Nodes{Db: d},
db: d,
}
}
func (n *Node) Add(node *m.Node) (id int64, err error) {
var dbNode *db.Node
dbNode, err = n.toDb(node)
if id, err = n.table.Add(dbNode); err != nil {
return
}
return
}
func (n *Node) GetAllEnabled() (list []*m.Node, err error) {
var dbList []*db.Node
if dbList, err = n.table.GetAllEnabled(); err != nil {
return
}
list = make([]*m.Node, 0)
for _, dbNode := range dbList {
node := n.fromDb(dbNode)
list = append(list, node)
}
return
}
func (n *Node) GetById(nodeId int64) (node *m.Node, err error) {
var dbNode *db.Node
if dbNode, err = n.table.GetById(nodeId); err != nil {
return
}
node = n.fromDb(dbNode)
return
}
func (n *Node) Update(node *m.Node) (err error) {
var dbNode *db.Node
dbNode, err = n.toDb(node)
err = n.table.Update(dbNode)
return
}
func (n *Node) Delete(nodeId int64) (err error) {
err = n.table.Delete(nodeId)
return
}
func (n *Node) List(limit, offset int64, orderBy, sort string) (list []*m.Node, total int64, err error) {
var dbList []*db.Node
if dbList, total, err = n.table.List(limit, offset, orderBy, sort); err != nil {
return
}
list = make([]*m.Node, 0)
for _, dbNode := range dbList {
node := n.fromDb(dbNode)
list = append(list, node)
}
return
}
func (n *Node) Search(query string, limit, offset int) (list []*m.Node, total int64, err error) {
var dbList []*db.Node
if dbList, total, err = n.table.Search(query, limit, offset); err != nil {
return
}
list = make([]*m.Node, 0)
for _, dbNode := range dbList {
node := n.fromDb(dbNode)
list = append(list, node)
}
return
}
func (a *Node) GetByLogin(login string) (ver *m.Node, err error) {
var dbVer *db.Node
if dbVer, err = a.table.GetByLogin(login); err != nil {
return
}
ver = a.fromDb(dbVer)
return
}
func (n *Node) fromDb(dbNode *db.Node) (node *m.Node) {
node = &m.Node{
Id: dbNode.Id,
Name: dbNode.Name,
Status: dbNode.Status,
Description: dbNode.Description,
Login: dbNode.Login,
EncryptedPassword: dbNode.EncryptedPassword,
CreatedAt: dbNode.CreatedAt,
UpdatedAt: dbNode.UpdatedAt,
}
return
}
func (n *Node) toDb(node *m.Node) (dbNode *db.Node, err error) {
dbNode = &db.Node{
Id: node.Id,
Name: node.Name,
Status: node.Status,
Description: node.Description,
Login: node.Login,
}
if node.Password != "" {
if dbNode.EncryptedPassword, err = common.HashPassword(node.Password); err != nil {
return
}
}
return
}