1
|
|
|
<?php |
2
|
|
|
/** |
3
|
|
|
* @link https://github.com/paulzi/yii2-auto-tree |
4
|
|
|
* @copyright Copyright (c) 2015 PaulZi <[email protected]> |
5
|
|
|
* @license MIT (https://github.com/paulzi/yii2-auto-tree/blob/master/LICENSE) |
6
|
|
|
*/ |
7
|
|
|
|
8
|
|
|
namespace paulzi\autotree\tests; |
9
|
|
|
|
10
|
|
|
use paulzi\autotree\tests\models\NodeAlNs; |
11
|
|
|
use Yii; |
12
|
|
|
|
13
|
|
|
/** |
14
|
|
|
* @author PaulZi <[email protected]> |
15
|
|
|
* @group AlNs |
16
|
|
|
*/ |
17
|
|
View Code Duplication |
class AlNsTest extends AutoTreeTraitTestCase |
|
|
|
|
18
|
|
|
{ |
19
|
|
|
public function getModelClass() |
20
|
|
|
{ |
21
|
|
|
return NodeAlNs::className(); |
|
|
|
|
22
|
|
|
} |
23
|
|
|
|
24
|
|
|
public function testMakeRootInsert() |
25
|
|
|
{ |
26
|
|
|
$node = new NodeAlNs(['slug' => 'r']); |
27
|
|
|
$this->assertTrue($node->makeRoot()->save()); |
28
|
|
|
|
29
|
|
|
$node->refresh(); |
30
|
|
|
$this->assertEquals(null, $node->parent_id); |
31
|
|
|
$this->assertEquals(1, $node->lft); |
32
|
|
|
$this->assertEquals(2, $node->rgt); |
33
|
|
|
$this->assertEquals(0, $node->depth); |
34
|
|
|
} |
35
|
|
|
|
36
|
|
|
public function testMakeRootUpdate() |
37
|
|
|
{ |
38
|
|
|
$node = NodeAlNs::findOne(9); |
|
|
|
|
39
|
|
|
$this->assertTrue($node->makeRoot()->save()); |
40
|
|
|
|
41
|
|
|
$node->refresh(); |
42
|
|
|
$this->assertEquals(null, $node->parent_id); |
43
|
|
|
$this->assertEquals(1, $node->lft); |
44
|
|
|
$this->assertEquals(8, $node->rgt); |
45
|
|
|
$this->assertEquals(0, $node->depth); |
46
|
|
|
} |
47
|
|
|
|
48
|
|
|
public function testPrependTo() |
49
|
|
|
{ |
50
|
|
|
$node = new NodeAlNs(['slug' => 'new']); |
51
|
|
|
$this->assertTrue($node->prependTo(NodeAlNs::findOne(1))->save()); |
|
|
|
|
52
|
|
|
|
53
|
|
|
$node->refresh(); |
54
|
|
|
$this->assertEquals(1, $node->parent_id); |
55
|
|
|
$this->assertEquals(2, $node->lft); |
56
|
|
|
$this->assertEquals(3, $node->rgt); |
57
|
|
|
$this->assertEquals(1, $node->depth); |
58
|
|
|
} |
59
|
|
|
|
60
|
|
|
public function testPrependToAnotherTree() |
61
|
|
|
{ |
62
|
|
|
$node = NodeAlNs::findOne(30); |
|
|
|
|
63
|
|
|
$this->assertTrue($node->prependTo(NodeAlNs::findOne(4))->save()); |
|
|
|
|
64
|
|
|
|
65
|
|
|
$node->refresh(); |
66
|
|
|
$this->assertEquals(4, $node->parent_id); |
67
|
|
|
$this->assertEquals(31, $node->lft); |
68
|
|
|
$this->assertEquals(40, $node->rgt); |
69
|
|
|
$this->assertEquals(2, $node->depth); |
70
|
|
|
} |
71
|
|
|
|
72
|
|
|
public function testAppendTo() |
73
|
|
|
{ |
74
|
|
|
$node = NodeAlNs::findOne(10); |
|
|
|
|
75
|
|
|
$this->assertTrue($node->appendTo(NodeAlNs::findOne(18))->save()); |
|
|
|
|
76
|
|
|
|
77
|
|
|
$node->refresh(); |
78
|
|
|
$this->assertEquals(18, $node->parent_id); |
79
|
|
|
$this->assertEquals(23, $node->lft); |
80
|
|
|
$this->assertEquals(30, $node->rgt); |
81
|
|
|
$this->assertEquals(4, $node->depth); |
82
|
|
|
} |
83
|
|
|
|
84
|
|
|
public function testInsertBefore() |
85
|
|
|
{ |
86
|
|
|
$node = new NodeAlNs(['slug' => 'new']); |
87
|
|
|
$this->assertTrue($node->insertBefore(NodeAlNs::findOne(22))->save()); |
|
|
|
|
88
|
|
|
|
89
|
|
|
$node->refresh(); |
90
|
|
|
$this->assertEquals(9, $node->parent_id); |
91
|
|
|
$this->assertEquals(38, $node->lft); |
92
|
|
|
$this->assertEquals(39, $node->rgt); |
93
|
|
|
$this->assertEquals(3, $node->depth); |
94
|
|
|
} |
95
|
|
|
|
96
|
|
|
public function testInsertAfter() |
97
|
|
|
{ |
98
|
|
|
$node = NodeAlNs::findOne(32); |
|
|
|
|
99
|
|
|
$this->assertTrue($node->insertAfter(NodeAlNs::findOne(30))->save()); |
|
|
|
|
100
|
|
|
|
101
|
|
|
$node->refresh(); |
102
|
|
|
$this->assertEquals(26, $node->parent_id); |
103
|
|
|
$this->assertEquals(26, $node->lft); |
104
|
|
|
$this->assertEquals(27, $node->rgt); |
105
|
|
|
$this->assertEquals(1, $node->depth); |
106
|
|
|
} |
107
|
|
|
|
108
|
|
|
public function testInsertAfterAnotherTree() |
109
|
|
|
{ |
110
|
|
|
$node = NodeAlNs::findOne(26); |
|
|
|
|
111
|
|
|
$this->assertTrue($node->insertAfter(NodeAlNs::findOne(21))->save()); |
|
|
|
|
112
|
|
|
|
113
|
|
|
$node->refresh(); |
114
|
|
|
$this->assertEquals(9, $node->parent_id); |
115
|
|
|
$this->assertEquals(38, $node->lft); |
116
|
|
|
$this->assertEquals(65, $node->rgt); |
117
|
|
|
$this->assertEquals(3, $node->depth); |
118
|
|
|
} |
119
|
|
|
|
120
|
|
|
public function testDelete() |
121
|
|
|
{ |
122
|
|
|
$this->assertEquals(1, NodeAlNs::findOne(30)->delete()); |
|
|
|
|
123
|
|
|
$this->assertEquals(null, NodeAlNs::findOne(30)); |
|
|
|
|
124
|
|
|
} |
125
|
|
|
|
126
|
|
|
public function testDeleteWithChildren() |
127
|
|
|
{ |
128
|
|
|
$this->assertEquals(10, NodeAlNs::findOne(4)->deleteWithChildren()); |
|
|
|
|
129
|
|
|
$this->assertEquals(null, NodeAlNs::findOne(24)); |
|
|
|
|
130
|
|
|
$this->assertEquals(15, NodeAlNs::findOne(1)->deleteWithChildren()); |
|
|
|
|
131
|
|
|
} |
132
|
|
|
} |
Duplicated code is one of the most pungent code smells. If you need to duplicate the same code in three or more different places, we strongly encourage you to look into extracting the code into a single class or operation.
You can also find more detailed suggestions in the “Code” section of your repository.