| Conditions | 5 |
| Paths | 3 |
| Total Lines | 27 |
| Code Lines | 14 |
| Lines | 0 |
| Ratio | 0 % |
| Tests | 15 |
| CRAP Score | 5.0061 |
| Changes | 0 | ||
| 1 | <?php |
||
| 36 | private function RememberDaftObjectWriteableTyped(DaftNestedWriteableObject $object) : void |
||
| 37 | { |
||
| 38 | $left = $object->GetIntNestedLeft(); |
||
| 39 | $right = $object->GetIntNestedRight(); |
||
| 40 | 2 | $level = $object->GetIntNestedLevel(); |
|
| 41 | 2 | ||
| 42 | 2 | if (0 === $left && 0 === $right && 0 === $level) { |
|
| 43 | 2 | $fullTreeCount = $this->CountDaftNestedObjectFullTree(); |
|
| 44 | 2 | ||
| 45 | 2 | if ($fullTreeCount > AbstractArrayBackedDaftNestedObject::COUNT_EXPECT_NON_EMPTY) { |
|
| 46 | 2 | $tree = $this->RecallDaftNestedObjectFullTree(); |
|
| 47 | |||
| 48 | /** |
||
| 49 | * @var DaftNestedWriteableObject |
||
| 50 | */ |
||
| 51 | 112 | $end = end($tree); |
|
| 52 | |||
| 53 | 112 | $left = $end->GetIntNestedRight() + 1; |
|
| 54 | 112 | } else { |
|
| 55 | 112 | $left = $fullTreeCount + $fullTreeCount; |
|
| 56 | } |
||
| 57 | 112 | ||
| 58 | 110 | $object->SetIntNestedLeft($left); |
|
| 59 | $object->SetIntNestedRight($left + 1); |
||
| 60 | 110 | } |
|
| 61 | 84 | ||
| 62 | parent::RememberDaftObject($object); |
||
| 63 | } |
||
| 65 |