-
Notifications
You must be signed in to change notification settings - Fork 0
/
NestedSetTrait.php
864 lines (771 loc) · 25.8 KB
/
NestedSetTrait.php
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
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
<?php
/*
* Phalcon Ext
* Copyrgt (c) 2016 David Hübner
* This source file is subject to the New BSD License
* Licence is bundled with this package in the file docs/LICENSE.txt
* Author: David Hübner <david.hubner@gmail.com>
*/
namespace PhalconExt\Mvc\Model\Traits;
use PhalconExt\Mvc\Model\NestedSetInterface;
/**
* Adds nested set (multi root tree) support to target model
*
* <code>
* class ModelWithNestedSet extends \Phalcon\Mvc\Model implements PhalconExt\Mvc\Model\NestedSetInterface
* {
* use \PhalconExt\Mvc\Model\Traits\NestedSetTrait;
* }
* </code>
*
* @author David Hübner <david.hubner at google.com>
* @version Release: @package_version@
* @since Release 1.0
*/
trait NestedSetTrait
{
public $parentId;
public $sequence = 0;
protected $root;
protected $lft;
protected $rgt;
protected $level;
/**
* Checks if model is nested set
*
* @author David Hübner <david.hubner at google.com>
* @param string $behavior
* @return bool
*/
public static function isNestedSet()
{
return true;
}
/**
* Gets root node
*
* @author David Hübner <david.hubner at google.com>
* @return mixed
*/
public function getRoot()
{
return $this->root;
}
/**
* Gets left value
*
* @author David Hübner <david.hubner at google.com>
* @return int
*/
public function getLeft()
{
return $this->lft;
}
/**
* Gets right value
*
* @author David Hübner <david.hubner at google.com>
* @return int
*/
public function getRight()
{
return $this->rgt;
}
/**
* Gets level
*
* @author David Hübner <david.hubner at google.com>
* @return int
*/
public function getLevel()
{
return $this->level;
}
/**
* Checks if node is root
*
* @author David Hübner <david.hubner at google.com>
* @return bool
*/
public function isRoot()
{
return ($this->lft == 1 ? true : false);
}
/**
* Checks if node is leaf
*
* @author David Hübner <david.hubner at google.com>
* @return bool
*/
public function isleaf()
{
return ($this->rgt - $this->lft == 1 ? true : false);
}
/**
* Checks if node is descendant of subject
*
* @author David Hübner <david.hubner at google.com>
* @param \PhalconExt\Mvc\Model\NestedSetInterface $subject - subject node
* @return bool
*/
public function isDescendantOf(NestedSetInterface $subject)
{
if ($this->root != $subject->getRoot()) {
return false;
}
if ($this->lft > $subject->getLeft() && $this->rgt < $subject->getRight()) {
return true;
}
return false;
}
/**
* Checks if node is ancestor of subject
*
* @author David Hübner <david.hubner at google.com>
* @param \PhalconExt\Mvc\Model\NestedSetInterface $subject - subject node
* @return bool
*/
public function isAncestorOf(NestedSetInterface $subject)
{
if ($this->root != $subject->getRoot()) {
return false;
}
if ($this->lft < $subject->getLeft() && $this->rgt > $subject->getRight()) {
return true;
}
return false;
}
/**
* Finds all root nodes
*
* @static
* @author David Hübner <david.hubner at google.com>
* @param string $extraCond - query extra conditions, default null
* @param array $extraBind - query extra bindings, default array()
* @param string $columns - selected columns
* @return \Phalcon\Mvc\Model\ResultsetInterface
*/
public static function findRoots($extraCond = null, array $extraBind = array(), $columns = null)
{
$params = array();
$params['conditions'] = 'lft = 1' . ($extraCond ? ' AND (' . $extraCond . ')' : '');
$params['order'] = 'sequence';
if ($extraBind) {
$params['bind'] = $extraBind;
}
if ($columns) {
$params['columns'] = $columns;
}
return self::find($params);
}
/**
* Finds all descendants
*
* @author David Hübner <david.hubner at google.com>
* @param string $extraCond - query extra conditions, default null
* @param array $extraBind - query extra bindings, default array()
* @param string $columns - selected columns, default null
* @param int $depth - how many levels to return, default null
* @return \Phalcon\Mvc\Model\ResultsetInterface
*/
public function findDescendants($extraCond = null, array $extraBind = array(), $columns = null, $depth = null)
{
$cond = 'lft > :lft: AND rgt < :rgt: AND root = :root:';
$bind = array(
'lft' => $this->lft,
'rgt' => $this->rgt,
'root' => $this->root
);
if ($depth) {
$cond .= ' AND level <= :level:';
$bind['level'] = $this->level + $depth;
}
$params = array();
$params['conditions'] = $cond . ($extraCond ? ' AND (' . $extraCond . ')' : '');
$params['bind'] = array_merge($bind, $extraBind);
$params['order'] = 'lft';
if ($columns) {
$params['columns'] = $columns;
}
return self::find($params);
}
/**
* Finds all children
*
* @author David Hübner <david.hubner at google.com>
* @param string $extraCond - query extra conditions, default null
* @param array $extraBind - query extra bindings, default array()
* @param string $columns - selected columns, default null
* @return \Phalcon\Mvc\Model\ResultsetInterface
*/
public function findChildren($extraCond = null, array $extraBind = array(), $columns = null)
{
return $this->findDescendants($extraCond, $extraBind, $columns, 1);
}
/**
* Finds all ancestors
*
* @author David Hübner <david.hubner at google.com>
* @param string $extraCond - query extra conditions, default null
* @param array $extraBind - query extra bindings, default array()
* @param string $columns - selected columns, default null
* @param int $depth - how many levels to return, default null
* @return \Phalcon\Mvc\Model\ResultsetInterface
*/
public function findAncestors($extraCond = null, array $extraBind = array(), $columns = null, $depth = null)
{
$cond = 'root = :root: AND lft < :lft: AND rgt > :rgt:';
$bind = array(
'root' => $this->root,
'lft' => $this->lft,
'rgt' => $this->rgt
);
if ($depth) {
$cond .= ' AND level >= :level:';
$bind['level'] = $this->level - $depth;
}
$params = array();
$params['conditions'] = $cond . ($extraCond ? ' AND (' . $extraCond . ')' : '');
$params['bind'] = array_merge($bind, $extraBind);
$params['order'] = 'lft';
if ($columns) {
$params['columns'] = $columns;
}
return self::find($params);
}
/**
* Finds parent node
*
* @author David Hübner <david.hubner at google.com>
* @param string $columns - selected columns, default null
* @return \PhalconExt\Mvc\Model\NestedSetInterface | false
*/
public function findParent($columns = null)
{
if ($this->isRoot()) {
return null;
}
$params = array();
$params['conditions'] = 'id = :parentId:';
$params['bind'] = array(
'parentId' => $this->parentId
);
if ($columns) {
$params['columns'] = $columns;
}
return self::findFirst($params);
}
/**
* Finds previous sibling or previous root
*
* @author David Hübner <david.hubner at google.com>
* @param string $columns - selected columns, default null
* @return \PhalconExt\Mvc\Model\NestedSetInterface | false
*/
public function findPrev($columns = null)
{
$params = array();
if ($this->isRoot()) {
$params['conditions'] = 'lft = 1 AND sequence = :sequence:';
$params['bind'] = array(
'sequence' => $this->sequence - 1
);
} else {
$params['conditions'] = 'root = :root: AND rgt = :rgt:';
$params['bind'] = array(
'root' => $this->root,
'rgt' => $this->lft - 1
);
}
if ($columns) {
$params['columns'] = $columns;
}
return self::findFirst($params);
}
/**
* Finds next sibling or next root
*
* @author David Hübner <david.hubner at google.com>
* @param string $columns - selected columns, default null
* @return \PhalconExt\Mvc\Model\NestedSetInterface | false
*/
public function findNext($columns = null)
{
$params = array();
if ($this->isRoot()) {
$params['conditions'] = 'lft = 1 AND sequence = :sequence:';
$params['bind'] = array(
'sequence' => $this->sequence + 1
);
} else {
$params['conditions'] = 'root = :root: AND lft = :lft:';
$params['bind'] = array(
'root' => $this->root,
'lft' => $this->rgt + 1
);
}
if ($columns) {
$params['columns'] = $columns;
}
return self::findFirst($params);
}
/**
* Creates new node (overrides default create method)
*
* @author David Hübner <david.hubner at google.com>
* @param array $data - default null
* @param array $whiteList - default null
* @return boolean
*/
public function create($data = null, $whiteList = null)
{
$db = $this->getDI()->get('db');
// new node new root
if (empty($this->parentId)) {
$db->begin();
$this->lft = 1;
$this->rgt = 2;
$this->level = 1;
$this->sequence = $this->getMaxSequence();
if (parent::create($data, $whiteList)) {
$this->root = $this->id;
if (parent::update()) {
$db->commit();
return true;
}
}
$db->rollback();
return false;
}
$db->begin();
// new node is child, we will insert node last
$parent = $this->findTargetById($this->parentId);
if (empty($parent)) {
$db->rollback();
return false;
}
// locking target tree
$query = sprintf('SELECT root, lft, rgt, level FROM %s WHERE root=\'%s\' FOR UPDATE', $this->getSource(), $parent->root);
$this->getWriteConnection()->fetchAll($query);
if (!$this->shiftNodes($parent->root, $parent->rgt, 2)) {
$db->rollback();
return false;
}
$this->root = $parent->root;
$this->lft = $parent->rgt;
$this->rgt = $parent->rgt + 1;
$this->level = $parent->level + 1;
$this->sequence = 0;
if (parent::create($data, $whiteList)) {
$db->commit();
return true;
}
$db->rollback();
return false;
}
/**
* Updates existing node (overrides default update method)
*
* @author David Hübner <david.hubner at google.com>
* @param array $data - default null
* @param array $whiteList - default null
* @param \PhalconExt\Mvc\Model\NestedSetInterface $target - target node, default null
* @param string $mode - before|after|first|last, default last
* @return boolean
*/
public function update($data = null, $whiteList = null, $target = null, $mode = 'last')
{
if ($target) {
if ($mode == 'before' || $mode == 'after') {
$this->parentId = $target->parentId;
} elseif ($mode == 'first' || $mode == 'last') {
$this->parentId = $target->id;
}
}
$db = $this->getDI()->get('db');
$db->begin();
$table = $this->getSource();
$conn = $this->getWriteConnection();
// locking source tree
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE root=\'%s\' FOR UPDATE', $table, $this->root);
$conn->fetchAll($query);
// parent change
if ($this->hasChanged('parentId')) {
// moving as root
if (empty($this->parentId)) {
// locking target tree
if ($target && $this->root != $target->root) {
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE root=\'%s\' FOR UPDATE', $table, $target->root);
$conn->fetchAll($query);
}
// locking roots
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE lft=1 FOR UPDATE', $table);
$conn->fetchAll($query);
// moving to root
if (!$this->moveAsRoot($target, $mode)) {
$db->rollback();
return false;
}
}
// moving as node
else {
// finding target
if (empty($target)) {
$target = $this->findTargetById($this->parentId);
}
if (empty($target)) {
$db->rollback();
return false;
}
// locking target tree
if ($target && $this->root != $target->root) {
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE root=\'%s\' FOR UPDATE', $table, $target->root);
$conn->fetchAll($query);
}
// locking roots
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE lft=1 FOR UPDATE', $table);
$conn->fetchAll($query);
// moving
if ($this->sequence && !$this->moveRoots(0)) {
$db->rollback();
return false;
}
if (!$this->moveNode($target, $mode)) {
$db->rollback();
return false;
}
}
}
// moving
elseif ($target) {
// locking target tree
if ($target && $this->root != $target->root) {
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE root=\'%s\' FOR UPDATE', $table, $target->root);
$conn->fetchAll($query);
}
// moving root
if ($this->lft == 1) {
// locking roots
$query = sprintf('SELECT root, lft, rgt, level, sequence FROM %s WHERE lft=1 FOR UPDATE', $table);
$conn->fetchAll($query);
// moving
if ($mode == 'after' && $this->sequence > $target->sequence + 1) {
if (!$this->moveRoots($target->sequence + 1)) {
$db->rollback();
return false;
}
} elseif ($mode == 'after' && $this->sequence < $target->sequence) {
if (!$this->moveRoots($target->sequence)) {
$db->rollback();
return false;
}
} elseif ($mode == 'before' && $this->sequence > $target->sequence) {
if (!$this->moveRoots($target->sequence)) {
$db->rollback();
return false;
}
}
}
// moving node
else {
if (!$this->moveNode($target, $mode)) {
$db->rollback();
return false;
}
}
}
if (parent::update($data, $whiteList)) {
$db->commit();
return true;
}
$db->rollback();
return false;
}
/**
* Deletes existing node with all subtree (overrides default delete method)
*
* @author David Hübner <david.hubner at google.com>
* @param bool $skipNested - skip tree delete
* @return boolean
*/
public function delete($skipNested = false)
{
$db = $this->getDI()->get('db');
$db->begin();
// deleting all descendants
if (empty($skipNested) && ($this->lft + 1) < $this->rgt) {
$descendants = $this->findDescendants();
foreach ($descendants as $descendant) {
if (!$descendant->deleteNode()) {
$db->rollback();
return false;
}
}
}
// shifting roots
if (empty($this->parentId)) {
if (!$this->shiftRoots($this->sequence, -1)) {
$db->rollback();
return false;
}
}
// shifting nodes
else {
if (!$this->shiftNodes($this->root, $this->rgt, ($this->rgt - $this->lft + 1) * -1)) {
$db->rollback();
return false;
}
}
// deleting node
if (!$this->deleteNode()) {
$db->rollback();
return false;
}
$db->commit();
return true;
}
/**
* Deletes actual node
*
* @author David Hübner <david.hubner at google.com>
* @return boolean
*/
public function deleteNode()
{
return parent::delete();
}
// moves node as root
protected function moveAsRoot($target, $mode)
{
$size = $this->rgt - $this->lft + 1;
$posDiff = 1 - $this->lft;
$lvlDiff = 1 - $this->level;
$table = $this->getSource();
$conn = $this->getWriteConnection();
// moving nodes
$query = sprintf(
'UPDATE %s SET root=\'%s\', lft=lft+%d, rgt=rgt+%d, level=level+%d WHERE root=\'%s\' AND lft>=%d AND rgt<=%d', $table, $this->id, $posDiff, $posDiff, $lvlDiff, $this->root, $this->lft, $this->rgt
);
if (!$conn->execute($query)) {
return false;
}
// updating source tree
if (!$this->shiftNodes($this->root, $this->rgt, ($size * -1))) {
return false;
}
// shifting roots
if ($target) {
if ($mode == 'before') {
$pos = (int) $target->sequence;
} elseif ($mode == 'after') {
$pos = $target->sequence + 1;
}
}
if (empty($pos)) {
$pos = $this->getMaxSequence();
} else {
if (!$this->shiftRoots($pos, 1)) {
return false;
}
}
// everything ok
$this->root = $this->id;
$this->lft += $posDiff;
$this->rgt += $posDiff;
$this->level += $lvlDiff;
$this->sequence = $pos;
return true;
}
// moves node to tree
protected function moveNode($target, $mode)
{
$parentDiff = 0;
if ($mode == 'before') {
$pos = (int) $target->lft;
} elseif ($mode == 'after') {
$pos = $target->rgt + 1;
} elseif ($mode == 'first') {
$pos = $target->lft + 1;
$parentDiff = 1;
} else {
$pos = (int) $target->rgt;
$parentDiff = 1;
}
if ($this->root == $target->root) {
return $this->moveNodeSameTree($target, $pos, $parentDiff);
} else {
return $this->moveNodeAnotherTree($target, $pos, $parentDiff);
}
}
// moves node in the same tree
protected function moveNodeSameTree($target, $pos, $parentDiff)
{
$con = $this->getWriteConnection();
$table = $this->getSource();
$size = $this->rgt - $this->lft + 1;
// temporary moving nodes to root
$query = sprintf(
'UPDATE %s SET root=null WHERE root=\'%s\' AND lft>=%d AND rgt<=%d', $table, $this->root, $this->lft, $this->rgt
);
if (!$con->execute($query)) {
return false;
}
// moving from lft to rgt
if ($this->rgt < $pos) {
$query = sprintf(
'UPDATE %s SET lft=lft-%d WHERE root=\'%s\' AND lft>%d AND lft<%d', $table, $size, $this->root, $this->rgt, $pos
);
if (!$con->execute($query)) {
return false;
}
$query = sprintf(
'UPDATE %s SET rgt=rgt-%d WHERE root=\'%s\' AND rgt>%d AND rgt<%d', $table, $size, $this->root, $this->rgt, $pos
);
if (!$con->execute($query)) {
return false;
}
$posDiff = $pos - $this->rgt - 1;
}
// moving from rgt to lft
elseif ($this->lft > $pos) {
// moving
$query = sprintf(
'UPDATE %s SET lft=lft+%d WHERE root=\'%s\' AND lft>=%d AND lft<%d', $table, $size, $this->root, $pos, $this->lft
);
if (!$con->execute($query)) {
return false;
}
$query = sprintf(
'UPDATE %s SET rgt=rgt+%d WHERE root=\'%s\' AND rgt>=%d AND rgt<%d', $table, $size, $this->root, $pos, $this->lft
);
if (!$con->execute($query)) {
return false;
}
$posDiff = $pos - $this->lft;
}
$lvlDiff = $target->level - $this->level + $parentDiff;
// moving nodes from root
$query = sprintf(
'UPDATE %s SET root=\'%s\', lft=lft+%d, rgt=rgt+%d, level=level+%d WHERE root IS NULL AND lft>=%d AND rgt<=%d', $table, $target->root, $posDiff, $posDiff, $lvlDiff, $this->lft, $this->rgt
);
if (!$con->execute($query)) {
return false;
}
// everything ok
$this->lft += $posDiff;
$this->rgt += $posDiff;
$this->level += $lvlDiff;
return true;
}
// moves node to another tree
protected function moveNodeAnotherTree($target, $pos, $parentDiff)
{
$size = $this->rgt - $this->lft + 1;
$posDiff = $pos - $this->lft;
$lvlDiff = $target->level - $this->level + $parentDiff;
// preparing target tree
if (!$this->shiftNodes($target->root, $pos, $size)) {
return false;
}
$table = $this->getSource();
$conn = $this->getWriteConnection();
// moving nodes
$query = sprintf(
'UPDATE %s SET root=\'%s\', lft=lft+%d, rgt=rgt+%d, level=level+%d WHERE root=\'%s\' AND lft>=%d AND rgt<=%d', $table, $target->root, $posDiff, $posDiff, $lvlDiff, $this->root, $this->lft, $this->rgt
);
if (!$conn->execute($query)) {
return false;
}
// updating source tree
if ($this->lft > 1) {
if (!$this->shiftNodes($this->root, $this->rgt, ($size * -1))) {
return false;
}
}
// everything ok
$this->root = $target->root;
$this->lft += $posDiff;
$this->rgt += $posDiff;
$this->level += $lvlDiff;
return true;
}
// finds target node by his id
protected function findTargetById($id)
{
return self::findFirst(array(
'columns' => 'id,root,lft,rgt,level',
'conditions' => 'id = :id:',
'bind' => array('id' => $id),
'for_update' => true
));
}
// Move root nodes
protected function moveRoots($newSequence)
{
$table = $this->getSource();
$conn = $this->getWriteConnection();
// moving root as descendant
if ($newSequence == 0) {
$query = sprintf(
'UPDATE %s SET sequence=sequence-1 WHERE lft=1 AND sequence>%d', $table, $this->sequence
);
}
// moving root after another root
elseif ($newSequence > $this->sequence) {
$query = sprintf(
'UPDATE %s SET sequence=sequence-1 WHERE lft=1 AND sequence>%d AND sequence<=%d', $table, $this->sequence, $newSequence
);
}
// moving root before another root
elseif ($newSequence < $this->sequence) {
$query = sprintf(
'UPDATE %s SET sequence=sequence+1 WHERE lft=1 AND sequence>=%d AND sequence<%d', $table, $newSequence, $this->sequence
);
}
if ($conn->execute($query)) {
$this->sequence = $newSequence;
return true;
}
return false;
}
// get actual maximum sequence
protected function getMaxSequence()
{
$cnt = self::maximum(array(
'column' => 'sequence',
'conditions' => 'lft = 1',
'for_update' => true
));
return ($cnt + 1);
}
// shift nodes
protected function shiftNodes($root, $start, $delta)
{
$table = $this->getSource();
$conn = $this->getWriteConnection();
// shifting
$query = sprintf(
'UPDATE %s SET lft=lft+%d WHERE root=\'%s\' AND lft>=%d', $table, $delta, $root, $start
);
if ($conn->execute($query)) {
$query = sprintf(
'UPDATE %s SET rgt=rgt+%d WHERE root=\'%s\' AND rgt>=%d', $table, $delta, $root, $start
);
if ($conn->execute($query)) {
return true;
}
}
return false;
}
// shift roots
protected function shiftRoots($start, $delta)
{
$table = $this->getSource();
$conn = $this->getWriteConnection();
// shifting
$query = sprintf(
'UPDATE %s SET sequence=sequence+%d WHERE lft=1 AND sequence>=%d', $table, $delta, $start
);
return $conn->execute($query);
}
}