-
Notifications
You must be signed in to change notification settings - Fork 19
/
Copy pathnested_set.go
448 lines (390 loc) · 12.7 KB
/
nested_set.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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
package nestedset
import (
"context"
"database/sql"
"fmt"
"reflect"
"strconv"
"strings"
"sync"
"gorm.io/gorm"
"gorm.io/gorm/clause"
"gorm.io/gorm/schema"
)
// MoveDirection means where the node is going to be located
type MoveDirection int
// MoveDirections ...
const (
// MoveDirectionLeft : MoveTo(db, a, n, MoveDirectionLeft) => a|n|...
MoveDirectionLeft MoveDirection = -1
// MoveDirectionRight : MoveTo(db, a, n, MoveDirectionRight) => ...|n|a|
MoveDirectionRight MoveDirection = 1
// MoveDirectionInner : MoveTo(db, a, n, MoveDirectionInner) => [n [...|a]]
MoveDirectionInner MoveDirection = 0
)
type nestedItem struct {
ID int64
ParentID sql.NullInt64
Depth int
Lft int
Rgt int
ChildrenCount int
TableName string `gorm:"-"`
DbNames map[string]string `gorm:"-"`
IsChanged bool `gorm:"-"`
}
func (item *nestedItem) IsPositionSame(original *nestedItem) bool {
return item.ID != original.ID ||
item.ParentID != original.ParentID ||
item.Depth != original.Depth ||
item.Lft != original.Lft ||
item.Rgt != original.Rgt ||
item.ChildrenCount != original.ChildrenCount
}
// parseNode parse a gorm struct into an internal nested item struct
// bring in all required data attribute like scope, left, righ etc.
func parseNode(db *gorm.DB, source interface{}) (tx *gorm.DB, item nestedItem, err error) {
scm, err := schema.Parse(source, &sync.Map{}, schema.NamingStrategy{})
if err != nil {
err = fmt.Errorf("Invalid source, must be a valid Gorm Model instance, %v", source)
return
}
tx = db.Table(scm.Table)
item = nestedItem{TableName: scm.Table, DbNames: map[string]string{}}
sourceValue := reflect.Indirect(reflect.ValueOf(source))
sourceType := sourceValue.Type()
for i := 0; i < sourceType.NumField(); i++ {
t := sourceType.Field(i)
v := sourceValue.Field(i)
schemaField := scm.LookUpField(t.Name)
if schemaField == nil {
continue;
}
dbName := schemaField.DBName
switch t.Tag.Get("nestedset") {
case "id":
item.ID = v.Int()
item.DbNames["id"] = dbName
break
case "parent_id":
item.ParentID = v.Interface().(sql.NullInt64)
item.DbNames["parent_id"] = dbName
break
case "depth":
item.Depth = int(v.Int())
item.DbNames["depth"] = dbName
break
case "rgt":
item.Rgt = int(v.Int())
item.DbNames["rgt"] = dbName
break
case "lft":
item.Lft = int(v.Int())
item.DbNames["lft"] = dbName
break
case "children_count":
item.ChildrenCount = int(v.Int())
item.DbNames["children_count"] = dbName
break
case "scope":
rawVal, _ := schemaField.ValueOf(context.TODO(), sourceValue)
tx = tx.Where(dbName+" = ?", rawVal)
break
}
}
return
}
// Create a new node within its parent by Gorm original Create() method
// ```nestedset.Create(db, &Category{...}, nil)``` will create a new category in root level
// ```nestedset.Create(db, &Category{...}, &parent)``` will create a new category under parent node as its last child
func Create(db *gorm.DB, source, parent interface{}) error {
tx, target, err := parseNode(db, source)
if err != nil {
return err
}
// for totally blank table / scope default init root would be [1 - 2]
setToDepth, setToLft, setToRgt := 0, 1, 2
dbNames := target.DbNames
return tx.Transaction(func(tx *gorm.DB) (err error) {
err = tx.Clauses(clause.Locking{Strength: "UPDATE"}).Pluck("id", &[]int64{}).Error
if err != nil {
return
}
// create node in root level when parent is nil
if parent == nil || (reflect.ValueOf(parent).Kind() == reflect.Ptr && reflect.ValueOf(parent).IsNil()) {
lastNode := make(map[string]interface{})
rst := tx.Select(dbNames["rgt"]).Order(formatSQL(":rgt DESC", target)).Take(&lastNode)
if rst.Error == nil {
lastNodeRgt, _ := strconv.Atoi(fmt.Sprintf("%d", lastNode[dbNames["rgt"]]))
setToLft = lastNodeRgt + 1
setToRgt = setToLft + 1
}
} else {
_, targetParent, err := parseNode(db, parent)
if err != nil {
return err
}
setToLft = targetParent.Rgt
setToRgt = targetParent.Rgt + 1
setToDepth = targetParent.Depth + 1
// UPDATE tree SET rgt = rgt + 2 WHERE rgt >= new_lft;
err = tx.Where(formatSQL(":rgt >= ?", target), setToLft).
UpdateColumn(dbNames["rgt"], gorm.Expr(formatSQL(":rgt + 2", target))).Error
if err != nil {
return err
}
// UPDATE tree SET lft = lft + 2 WHERE lft > new_lft;
err = tx.Where(formatSQL(":lft > ?", target), setToLft).
UpdateColumn(dbNames["lft"], gorm.Expr(formatSQL(":lft + 2", target))).Error
if err != nil {
return err
}
// UPDATE tree SET children_count = children_count + 1 WHERE id = parent.id;
err = tx.Model(parent).Update(
dbNames["children_count"], gorm.Expr(formatSQL(":children_count + 1", target))).Error
if err != nil {
return err
}
}
// Set Lft, Rgt, Depth dynamically
v := reflect.Indirect(reflect.ValueOf(source))
t := v.Type()
for i := 0; i < t.NumField(); i++ {
f := t.Field(i)
switch f.Tag.Get("nestedset") {
case "lft":
f := v.FieldByName(f.Name)
f.SetInt(int64(setToLft))
break
case "rgt":
f := v.FieldByName(f.Name)
f.SetInt(int64(setToRgt))
break
case "depth":
f := v.FieldByName(f.Name)
f.SetInt(int64(setToDepth))
break
}
}
return tx.Create(source).Error
})
}
// Delete a node from scoped list and its all descendent
// ```nestedset.Delete(db, &Category{...})```
func Delete(db *gorm.DB, source interface{}) error {
tx, target, err := parseNode(db, source)
if err != nil {
return err
}
// Batch Delete Method in GORM requires an instance of current source type without ID
// to avoid GORM style Delete interface, we hacked here by set source ID to 0
dbNames := target.DbNames
v := reflect.Indirect(reflect.ValueOf(source))
t := v.Type()
for i := 0; i < t.NumField(); i++ {
f := t.Field(i)
if f.Tag.Get("nestedset") == "id" {
f := v.FieldByName(f.Name)
f.SetInt(0)
break
}
}
return tx.Transaction(func(tx *gorm.DB) (err error) {
err = tx.Clauses(clause.Locking{Strength: "UPDATE"}).Pluck("id", &[]int64{}).Error
if err != nil {
return
}
err = tx.Where(formatSQL(":lft >= ? AND :rgt <= ?", target), target.Lft, target.Rgt).
Delete(source).Error
if err != nil {
return err
}
// UPDATE tree SET rgt = rgt - width WHERE rgt > target_rgt;
// UPDATE tree SET lft = lft - width WHERE lft > target_rgt;
width := target.Rgt - target.Lft + 1
for _, d := range []string{"rgt", "lft"} {
err = tx.Where(formatSQL(":"+d+" > ?", target), target.Rgt).
Update(dbNames[d], gorm.Expr(formatSQL(":"+d+" - ?", target), width)).
Error
if err != nil {
return err
}
}
return syncChildrenCount(tx, target, target.ParentID, sql.NullInt64{})
})
}
// MoveTo move node to a position which is related a target node
// ```nestedset.MoveTo(db, &node, &to, nestedset.MoveDirectionInner)``` will move [&node] to [&to] node's child_list as its first child
func MoveTo(db *gorm.DB, node, to interface{}, direction MoveDirection) error {
tx, targetNode, err := parseNode(db, node)
if err != nil {
return err
}
_, toNode, err := parseNode(db, to)
if err != nil {
return err
}
err = moveIsValid(targetNode, toNode)
if err != nil {
return err
}
var right, depthChange int
var newParentID sql.NullInt64
if direction == MoveDirectionLeft || direction == MoveDirectionRight {
newParentID = toNode.ParentID
depthChange = toNode.Depth - targetNode.Depth
if direction == MoveDirectionLeft {
right = toNode.Lft - 1
} else {
right = toNode.Rgt
}
} else {
newParentID = sql.NullInt64{Int64: toNode.ID, Valid: true}
depthChange = toNode.Depth + 1 - targetNode.Depth
right = toNode.Lft
}
return moveToRightOfPosition(tx, targetNode, right, depthChange, newParentID)
}
// Rebuild rebuild nodes as any nestedset which in the scope
// ```nestedset.Rebuild(db, &node, true)``` will rebuild [&node] as nestedset
func Rebuild(db *gorm.DB, source interface{}, doUpdate bool) (affectedCount int, err error) {
tx, target, err := parseNode(db, source)
if err != nil {
return
}
err = tx.Transaction(func(tx *gorm.DB) (err error) {
allItems := []*nestedItem{}
err = tx.Clauses(clause.Locking{Strength: "UPDATE"}).
Where(formatSQL("", target)).
Order(formatSQL(":parent_id ASC NULLS FIRST, :lft ASC", target)).
Find(&allItems).
Error
if err != nil {
return
}
initTree(allItems).rebuild()
for _, item := range allItems {
if item.IsChanged {
affectedCount += 1
if doUpdate {
err = tx.Table(target.TableName).
Where(formatSQL(":id=?", target), item.ID).
Updates(map[string]interface{}{
target.DbNames["lft"]: item.Lft,
target.DbNames["rgt"]: item.Rgt,
target.DbNames["depth"]: item.Depth,
target.DbNames["children_count"]: item.ChildrenCount,
}).Error
if err != nil {
return
}
}
}
}
return nil
})
return
}
func moveIsValid(node, to nestedItem) error {
validLft, validRgt := node.Lft, node.Rgt
if (to.Lft >= validLft && to.Lft <= validRgt) || (to.Rgt >= validLft && to.Rgt <= validRgt) {
return fmt.Errorf("in valid move target: %v => %v", node, to)
}
return nil
}
func moveToRightOfPosition(tx *gorm.DB, targetNode nestedItem, position, depthChange int, newParentID sql.NullInt64) error {
return tx.Transaction(func(tx *gorm.DB) (err error) {
err = tx.Clauses(clause.Locking{Strength: "UPDATE"}).Pluck("id", &[]int64{}).Error
if err != nil {
return
}
oldParentID := targetNode.ParentID
targetRight := targetNode.Rgt
targetLeft := targetNode.Lft
targetWidth := targetRight - targetLeft + 1
targetIds := []int64{}
err = tx.Where(formatSQL(":lft >= ? AND :rgt <= ?", targetNode), targetLeft, targetRight).Pluck("id", &targetIds).Error
if err != nil {
return
}
var moveStep, affectedStep, affectedGte, affectedLte int
moveStep = position - targetLeft + 1
if moveStep < 0 {
affectedGte = position + 1
affectedLte = targetLeft - 1
affectedStep = targetWidth
} else if moveStep > 0 {
affectedGte = targetRight + 1
affectedLte = position
affectedStep = targetWidth * -1
// move backwards should minus target covered length/width
moveStep = moveStep - targetWidth
} else {
return nil
}
err = moveAffected(tx, targetNode, affectedGte, affectedLte, affectedStep)
if err != nil {
return
}
err = moveTarget(tx, targetNode, targetNode.ID, targetIds, moveStep, depthChange, newParentID)
if err != nil {
return
}
return syncChildrenCount(tx, targetNode, oldParentID, newParentID)
})
}
func syncChildrenCount(tx *gorm.DB, targetNode nestedItem, oldParentID, newParentID sql.NullInt64) (err error) {
var oldParentCount, newParentCount int64
if oldParentID.Valid {
err = tx.Where(formatSQL(":parent_id = ?", targetNode), oldParentID).Count(&oldParentCount).Error
if err != nil {
return
}
err = tx.Where(formatSQL(":id = ?", targetNode), oldParentID).Update(targetNode.DbNames["children_count"], oldParentCount).Error
if err != nil {
return
}
}
if newParentID.Valid {
err = tx.Where(formatSQL(":parent_id = ?", targetNode), newParentID).Count(&newParentCount).Error
if err != nil {
return
}
err = tx.Where(formatSQL(":id = ?", targetNode), newParentID).Update(targetNode.DbNames["children_count"], newParentCount).Error
if err != nil {
return
}
}
return nil
}
func moveTarget(tx *gorm.DB, targetNode nestedItem, targetID int64, targetIds []int64, step, depthChange int, newParentID sql.NullInt64) (err error) {
dbNames := targetNode.DbNames
if len(targetIds) > 0 {
err = tx.Where(formatSQL(":id IN (?)", targetNode), targetIds).
Updates(map[string]interface{}{
dbNames["lft"]: gorm.Expr(formatSQL(":lft + ?", targetNode), step),
dbNames["rgt"]: gorm.Expr(formatSQL(":rgt + ?", targetNode), step),
dbNames["depth"]: gorm.Expr(formatSQL(":depth + ?", targetNode), depthChange),
}).Error
if err != nil {
return
}
}
return tx.Where(formatSQL(":id = ?", targetNode), targetID).Update(dbNames["parent_id"], newParentID).Error
}
func moveAffected(tx *gorm.DB, targetNode nestedItem, gte, lte, step int) (err error) {
dbNames := targetNode.DbNames
return tx.Where(formatSQL("(:lft BETWEEN ? AND ?) OR (:rgt BETWEEN ? AND ?)", targetNode), gte, lte, gte, lte).
Updates(map[string]interface{}{
dbNames["lft"]: gorm.Expr(formatSQL("(CASE WHEN :lft >= ? THEN :lft + ? ELSE :lft END)", targetNode), gte, step),
dbNames["rgt"]: gorm.Expr(formatSQL("(CASE WHEN :rgt <= ? THEN :rgt + ? ELSE :rgt END)", targetNode), lte, step),
}).Error
}
func formatSQL(placeHolderSQL string, node nestedItem) (out string) {
out = placeHolderSQL
out = strings.ReplaceAll(out, ":table_name", node.TableName)
for k, v := range node.DbNames {
out = strings.Replace(out, ":"+k, v, -1)
}
return
}