DaftWriteableObjectMemoryTree::InefficientRebuild() - Code Metrics - Inspection of "adjusting indentation" - SignpostMarv/daft-nested-object - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 3e275c...3f9da1 )

by SignpostMarv

created 2018-06-10 13:03 UTC

InefficientRebuild() B

↳ Parent: DaftWriteableObjectMemoryTree

Complexity

Conditions	3
Paths	2

Size

Total Lines	44
Code Lines	17

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	18
CRAP Score	3

Importance

Changes

Metric	Value
cc	3
eloc	17
nc	2
nop	6
dl	0
loc	44
ccs	18
cts	18
cp	1
crap	3
rs	8.8571
c	0
b	0
f	0

<?php
/**
* Base daft objects.
*
* @author SignpostMarv
*/
declare(strict_types=1);

namespace SignpostMarv\DaftObject;

use BadMethodCallException;
use InvalidArgumentException;
use RuntimeException;

abstract class DaftWriteableObjectMemoryTree extends DaftObjectMemoryTree implements DaftNestedWriteableObjectTree
{
    public function ModifyDaftNestedObjectTreeInsert(
        DaftNestedWriteableObject $newLeaf,
        DaftNestedWriteableObject $referenceLeaf,
        bool $before = false,
        bool $above = null
    ) : DaftNestedWriteableObject {
        if ($newLeaf->GetId() === $referenceLeaf->GetId()) {
            throw new InvalidArgumentException('Cannot modify leaf relative to itself!');
        }

        if (true === $above) {
            $this->ModifyDaftNestedObjectTreeInsertAbove($newLeaf, $referenceLeaf);
        } elseif (false === $above) {
            $this->ModifyDaftNestedObjectTreeInsertBelow($newLeaf, $referenceLeaf);
        } else {
            $this->ModifyDaftNestedObjectTreeInsertAdjacent($newLeaf, $referenceLeaf, $before);
        }

        $this->RebuildTreeInefficiently();

        $newLeaf = $this->RecallDaftObject($newLeaf->GetId());

        if ( ! ($newLeaf instanceof DaftNestedWriteableObject)) {
            throw new RuntimeException('Could not retrieve leaf from tree after rebuilding!');
        }

        return $newLeaf;
    }

    public function ModifyDaftNestedObjectTreeInsertLoose(
        $newLeaf,
        $referenceLeafId,
        bool $before = false,
        bool $above = null
    ) : DaftNestedWriteableObject {
        if ($newLeaf === $this->GetNestedObjectTreeRootId()) {
            throw new InvalidArgumentException('Cannot pass root id as new leaf');
        }

        $newLeaf = (
            ($newLeaf instanceof DaftNestedWriteableObject)
                ? $newLeaf
                : $this->RecallDaftObject($newLeaf)
        );
        $referenceLeaf = $this->RecallDaftObject($referenceLeafId);

        if ( ! ($newLeaf instanceof DaftNestedWriteableObject)) {
            throw new InvalidArgumentException(
                'Arguemnt 1 passed to ' .
                __METHOD__ .
                ' did not resolve to a leaf node!'
            );
        }

        $newLeaf = $this->StoreThenRetrieveFreshCopy($newLeaf);

        if (
            ($newLeaf instanceof DaftNestedWriteableObject) &&
            ($referenceLeaf instanceof DaftNestedWriteableObject)
        ) {
            return $this->ModifyDaftNestedObjectTreeInsert(
                $newLeaf,
                $referenceLeaf,
                $before,
                $above
            );
        } elseif ($referenceLeafId !== $this->GetNestedObjectTreeRootId()) {
            throw new InvalidArgumentException(
                'Arguemnt 2 passed to ' .
                __METHOD__ .
                ' did not resolve to a leaf node!'
            );
        }

        $tree = array_filter(
            $this->RecallDaftNestedObjectFullTree(0),
            function (DaftNestedWriteableObject $leaf) use ($newLeaf) : bool {
                return $leaf->GetId() !== $newLeaf->GetId();
            }
        );

        if (0 === count($tree)) {
            $newLeaf->SetIntNestedLeft(0);
            $newLeaf->SetIntNestedRight(1);
            $newLeaf->SetIntNestedLevel(0);
            $newLeaf->AlterDaftNestedObjectParentId($this->GetNestedObjectTreeRootId());

            return $this->StoreThenRetrieveFreshCopy($newLeaf);
        }

        /**
        * @var DaftNestedWriteableObject $referenceLeaf
        */
        $referenceLeaf = $before ? current($tree) : end($tree);

        return $this->ModifyDaftNestedObjectTreeInsert($newLeaf, $referenceLeaf, $before, $above);
    }

    public function ModifyDaftNestedObjectTreeRemoveWithObject(
        DaftNestedWriteableObject $root,
        ? DaftNestedWriteableObject $replacementRoot
    ) : int {
        if (
            $this->CountDaftNestedObjectTreeWithObject($root, false, null) > 0 &&
            is_null($replacementRoot)
        ) {
            throw new BadMethodCallException('Cannot leave orphan objects in a tree');
        }

        $root = $this->StoreThenRetrieveFreshCopy($root);

        if ( ! is_null($replacementRoot)) {
            $replacementRoot = $this->StoreThenRetrieveFreshCopy($replacementRoot);

            /**
            * @var DaftNestedWriteableObject $alter
            */
            foreach ($this->RecallDaftNestedObjectTreeWithObject($root, false, 0) as $alter) {
                $alter->AlterDaftNestedObjectParentId($root->ObtainDaftNestedObjectParentId());
                $alter = $this->StoreThenRetrieveFreshCopy($alter);
                if ($alter->GetId() === $replacementRoot->GetId()) {
                    $replacementRoot = $alter;
                }
            }
        }

        $this->RemoveDaftObject($root);

        $this->RebuildTreeInefficiently();

        return $this->CountDaftNestedObjectFullTree();
    }

    /**
    * {@inheritdoc}
    */
    public function ModifyDaftNestedObjectTreeRemoveWithId($root, $replacementRoot) : int
    {
        $rootObject = $this->RecallDaftObject($root);

        if ( ! ($rootObject instanceof DaftNestedWriteableObject)) {
            return $this->CountDaftNestedObjectFullTree();
        }

        if (
            ! is_null($replacementRoot) &&
            $replacementRoot !== $this->GetNestedObjectTreeRootId()
        ) {
            $replacementRootObject = $this->RecallDaftObject($replacementRoot);

            if ( ! ($replacementRootObject instanceof DaftNestedWriteableObject)) {
                throw new InvalidArgumentException(
                    'Could not locate replacement root, cannot leave orphan objects!'
                );
            }

            return $this->ModifyDaftNestedObjectTreeRemoveWithObject(
                $rootObject,
                $replacementRootObject
            );
        }

        if (
            $this->CountDaftNestedObjectTreeWithObject($rootObject, false, null) > 0 &&
            is_null($replacementRoot)
        ) {
            throw new BadMethodCallException('Cannot leave orphan objects in a tree');
        }

        /**
        * @var DaftNestedWriteableObject $alter
        */
        foreach ($this->RecallDaftNestedObjectTreeWithObject($rootObject, false, null) as $alter) {
            $alter = $this->StoreThenRetrieveFreshCopy($alter);
            $alter->AlterDaftNestedObjectParentId($replacementRoot);
            $this->RememberDaftObject($alter);
        }

        $this->RemoveDaftObject($rootObject);

        $this->RebuildTreeInefficiently();

        return $this->CountDaftNestedObjectFullTree();
    }

    protected function ModifyDaftNestedObjectTreeInsertAbove(
        DaftNestedWriteableObject $newLeaf,
        DaftNestedWriteableObject $referenceLeaf
    ) : void {
        $newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->ObtainDaftNestedObjectParentId());
        $referenceLeaf->AlterDaftNestedObjectParentId($newLeaf->GetId());

        $this->StoreThenRetrieveFreshCopy($newLeaf);
        $this->StoreThenRetrieveFreshCopy($referenceLeaf);
    }

    protected function ModifyDaftNestedObjectTreeInsertBelow(
        DaftNestedWriteableObject $newLeaf,
        DaftNestedWriteableObject $referenceLeaf
    ) : void {
        $newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->GetId());
        $this->StoreThenRetrieveFreshCopy($newLeaf);
    }

    protected function ModifyDaftNestedObjectTreeInsertAdjacent(
        DaftNestedWriteableObject $newLeaf,
        DaftNestedWriteableObject $referenceLeaf,
        bool $before
    ) : void {
        /**
        * @var array<int, DaftNestedWriteableObject> $siblings
        */
        $siblings = array_values(array_filter(
            $this->RecallDaftNestedObjectTreeWithId(
                $referenceLeaf->ObtainDaftNestedObjectParentId(),
                false,
                0
            ),
            function (DaftNestedWriteableObject $leaf) use ($newLeaf) : bool {
                return $leaf->GetId() !== $newLeaf->GetId();
            }
        ));

        $siblingIds = [];
        $siblingSort = [];
        $j = count($siblings);

        /**
        * @var DaftNestedWriteableObject $leaf
        */
        foreach ($siblings as $leaf) {
            /**
            * @var scalar|scalar[] $siblingId
            */
            $siblingId = $leaf->GetId();
            $siblingIds[] = $siblingId;
            $siblingSort[] = $leaf->GetIntNestedSortOrder();
        }

        $pos = array_search($referenceLeaf->GetId(), $siblingIds, true);

        if (false === $pos) {
            throw new RuntimeException('Reference leaf not found in siblings tree!');
        }

        for ($i = 0; $i < $j; ++$i) {
            $siblings[$i]->SetIntNestedSortOrder(
                $siblingSort[$i] +
                (($before ? ($i < $pos) : ($i <= $pos)) ? -1 : 1)
            );
            $this->StoreThenRetrieveFreshCopy($siblings[$i]);
        }

        $newLeaf->SetIntNestedSortOrder($siblingSort[$pos]);
        $newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->ObtainDaftNestedObjectParentId());

        $this->StoreThenRetrieveFreshCopy($newLeaf);
    }

    protected function RememberDaftObjectData(DefinesOwnIdPropertiesInterface $object) : void
    {
        static::ThrowIfNotType($object, DaftNestedWriteableObject::class, 1, __METHOD__);

        parent::RememberDaftObjectData($object);
    }

    /**
    * @param DaftObject|string $object
    */
    protected static function ThrowIfNotType(
        $object,
        string $type,
        int $argument,
        string $function
    ) : void {
        if ( ! is_a($object, DaftNestedWriteableObject::class, is_string($object))) {
            throw new DaftObjectRepositoryTypeByClassMethodAndTypeException(
                $argument,
                static::class,
                $function,
                DaftNestedWriteableObject::class,
                is_string($object) ? $object : get_class($object)
            );
        }

        parent::ThrowIfNotType($object, $type, $argument, $function);
    }

    protected function RebuildTreeInefficiently() : void
    {
        $parentIdXref = [
            (array) $this->GetNestedObjectTreeRootId(),
        ];

        /**
        * @var array<int, array<int, DaftNestedWriteableObject>> $xRefChildren
        */
        $xRefChildren = [
            [],
        ];

        /**
        * @var array<int, scalar|scalar[]> $idXref
        */
        $idXref = [];

        $tree = $this->RecallDaftNestedObjectFullTree();

        usort($tree, function (DaftNestedWriteableObject $a, DaftNestedWriteableObject $b) : int {
            return $this->CompareObjects($a, $b);
        });

        /**
        * @var DaftNestedWriteableObject $leaf
        */
        foreach ($tree as $i => $leaf) {
            $leafParentId = $leaf->ObtainDaftNestedObjectParentId();
            $pos = array_search($leafParentId, $parentIdXref, true);

            if (false === $pos) {
                $parentIdXref[] = $leafParentId;

                /**
                * @var int $pos
                */
                $pos = array_search($leafParentId, $parentIdXref, true);

                $xRefChildren[$pos] = [];
            }

            if ( ! in_array($leaf, $xRefChildren[$pos], true)) {
                $xRefChildren[$pos][] = $leaf;
            }

            if ( ! in_array($leaf->GetId(), $idXref, true)) {
                /**
                * @var scalar|scalar[] $leafId
                */
                $leafId = $leaf->GetId();
                $idXref[] = $leafId;
            }

            $leaf->SetIntNestedLeft(0);
            $leaf->SetIntNestedRight(0);
            $leaf->SetIntNestedLevel(0);

            $tree[$i] = $this->StoreThenRetrieveFreshCopy($leaf);
        }

        $n = 0;

        /**
        * @var DaftNestedWriteableObject $rootLeaf
        */
        foreach ($xRefChildren[0] as $rootLeaf) {
            $n = $this->InefficientRebuild(
                $rootLeaf,
                0,
                $n,
                $parentIdXref,
                $idXref,
                $xRefChildren
            );
        }
    }

    protected function InefficientRebuild(
        DaftNestedWriteableObject $leaf,
        int $level,
        int $n,
        array $parentIds,
        array $ids,
        array $children
    ) : int {
        /**
        * @var scalar|scalar[] $id
        */
        $id = $leaf->GetId();

        $leaf->SetIntNestedLevel($level);
        $leaf->SetIntNestedLeft($n);

        ++$n;

        /**
        * @var int|false $parentPos
        */
        $parentPos = array_search((array) $id, $parentIds, true);

        if (false !== $parentPos) {
            /**
            * @var DaftNestedWriteableObject $childLeaf
            */
            foreach ($children[$parentPos] as $childLeaf) {
                $n = $this->InefficientRebuild(
                    $childLeaf,
                    $level + 1,
                    $n,
                    $parentIds,
                    $ids,
                    $children
                );
            }
        }

        $leaf->SetIntNestedRight($n);

        $this->StoreThenRetrieveFreshCopy($leaf);

        return $n + 1;
    }

    protected function StoreThenRetrieveFreshCopy(
        DaftNestedWriteableObject $leaf
    ) : DaftNestedWriteableObject {
        $this->RememberDaftObject($leaf);
        $this->ForgetDaftObject($leaf);
        $this->ForgetDaftObjectById($leaf->GetId());

        $fresh = $this->RecallDaftObject($leaf->GetId());

        if ( ! ($fresh instanceof DaftNestedWriteableObject)) {
            throw new RuntimeException('Was not able to obtain a fresh copy of the object!');
        }

        return $fresh;
    }
}


1		<?php
2		/**
3		* Base daft objects.
4		*
5		* @author SignpostMarv
6		*/
7		declare(strict_types=1);
8
9		namespace SignpostMarv\DaftObject;
10
11		use BadMethodCallException;
12		use InvalidArgumentException;
13		use RuntimeException;
14
15		abstract class DaftWriteableObjectMemoryTree extends DaftObjectMemoryTree implements DaftNestedWriteableObjectTree
16		{
17	10	public function ModifyDaftNestedObjectTreeInsert(
18		DaftNestedWriteableObject $newLeaf,
19		DaftNestedWriteableObject $referenceLeaf,
20		bool $before = false,
21		bool $above = null
22		) : DaftNestedWriteableObject {
23	10	if ($newLeaf->GetId() === $referenceLeaf->GetId()) {
24		throw new InvalidArgumentException('Cannot modify leaf relative to itself!');
25		}
26
27	10	if (true === $above) {
28	6	$this->ModifyDaftNestedObjectTreeInsertAbove($newLeaf, $referenceLeaf);
29	10	} elseif (false === $above) {
30	2	$this->ModifyDaftNestedObjectTreeInsertBelow($newLeaf, $referenceLeaf);
31		} else {
32	10	$this->ModifyDaftNestedObjectTreeInsertAdjacent($newLeaf, $referenceLeaf, $before);
33		}
34
35	10	$this->RebuildTreeInefficiently();
36
37	10	$newLeaf = $this->RecallDaftObject($newLeaf->GetId());
38
39	10	if ( ! ($newLeaf instanceof DaftNestedWriteableObject)) {
40		throw new RuntimeException('Could not retrieve leaf from tree after rebuilding!');
41		}
42
43	10	return $newLeaf;
44		}
45
46	10	public function ModifyDaftNestedObjectTreeInsertLoose(
47		$newLeaf,
48		$referenceLeafId,
49		bool $before = false,
50		bool $above = null
51		) : DaftNestedWriteableObject {
52	10	if ($newLeaf === $this->GetNestedObjectTreeRootId()) {
53		throw new InvalidArgumentException('Cannot pass root id as new leaf');
54		}
55
56		$newLeaf = (
57	10	($newLeaf instanceof DaftNestedWriteableObject)
58	10	? $newLeaf
59	10	: $this->RecallDaftObject($newLeaf)
60		);
61	10	$referenceLeaf = $this->RecallDaftObject($referenceLeafId);
62
63	10	if ( ! ($newLeaf instanceof DaftNestedWriteableObject)) {
64		throw new InvalidArgumentException(
65		'Arguemnt 1 passed to ' .
66		__METHOD__ .
67		' did not resolve to a leaf node!'
68		);
69		}
70
71	10	$newLeaf = $this->StoreThenRetrieveFreshCopy($newLeaf);
72
73		if (
74	10	($newLeaf instanceof DaftNestedWriteableObject) &&
75	10	($referenceLeaf instanceof DaftNestedWriteableObject)
76		) {
77	4	return $this->ModifyDaftNestedObjectTreeInsert(
78	4	$newLeaf,
79	4	$referenceLeaf,
80	4	$before,
81	4	$above
82		);
83	10	} elseif ($referenceLeafId !== $this->GetNestedObjectTreeRootId()) {
84		throw new InvalidArgumentException(
85		'Arguemnt 2 passed to ' .
86		__METHOD__ .
87		' did not resolve to a leaf node!'
88		);
89		}
90
91	10	$tree = array_filter(
92	10	$this->RecallDaftNestedObjectFullTree(0),
93		function (DaftNestedWriteableObject $leaf) use ($newLeaf) : bool {
94	10	return $leaf->GetId() !== $newLeaf->GetId();
95	10	}
96		);
97
98	10	if (0 === count($tree)) {
99	10	$newLeaf->SetIntNestedLeft(0);
100	10	$newLeaf->SetIntNestedRight(1);
101	10	$newLeaf->SetIntNestedLevel(0);
102	10	$newLeaf->AlterDaftNestedObjectParentId($this->GetNestedObjectTreeRootId());
103
104	10	return $this->StoreThenRetrieveFreshCopy($newLeaf);
105		}
106
107		/**
108		* @var DaftNestedWriteableObject $referenceLeaf
109		*/
110	10	$referenceLeaf = $before ? current($tree) : end($tree);
111
112	10	return $this->ModifyDaftNestedObjectTreeInsert($newLeaf, $referenceLeaf, $before, $above);
113		}
114
115	2	public function ModifyDaftNestedObjectTreeRemoveWithObject(
116		DaftNestedWriteableObject $root,
117		? DaftNestedWriteableObject $replacementRoot
118		) : int {
119		if (
120	2	$this->CountDaftNestedObjectTreeWithObject($root, false, null) > 0 &&
121	2	is_null($replacementRoot)
122		) {
123		throw new BadMethodCallException('Cannot leave orphan objects in a tree');
124		}
125
126	2	$root = $this->StoreThenRetrieveFreshCopy($root);
127
128	2	if ( ! is_null($replacementRoot)) {
129		$replacementRoot = $this->StoreThenRetrieveFreshCopy($replacementRoot);
130
131		/**
132		* @var DaftNestedWriteableObject $alter
133		*/
134		foreach ($this->RecallDaftNestedObjectTreeWithObject($root, false, 0) as $alter) {
135		$alter->AlterDaftNestedObjectParentId($root->ObtainDaftNestedObjectParentId());
136		$alter = $this->StoreThenRetrieveFreshCopy($alter);
137		if ($alter->GetId() === $replacementRoot->GetId()) {
138		$replacementRoot = $alter;
139		}
140		}
141		}
142
143	2	$this->RemoveDaftObject($root);
144
145	2	$this->RebuildTreeInefficiently();
146
147	2	return $this->CountDaftNestedObjectFullTree();
148		}
149
150		/**
151		* {@inheritdoc}
152		*/
153	2	public function ModifyDaftNestedObjectTreeRemoveWithId($root, $replacementRoot) : int
154		{
155	2	$rootObject = $this->RecallDaftObject($root);
156
157	2	if ( ! ($rootObject instanceof DaftNestedWriteableObject)) {
158	2	return $this->CountDaftNestedObjectFullTree();
159		}
160
161		if (
162	2	! is_null($replacementRoot) &&
163	2	$replacementRoot !== $this->GetNestedObjectTreeRootId()
164		) {
165		$replacementRootObject = $this->RecallDaftObject($replacementRoot);
166
167		if ( ! ($replacementRootObject instanceof DaftNestedWriteableObject)) {
168		throw new InvalidArgumentException(
169		'Could not locate replacement root, cannot leave orphan objects!'
170		);
171		}
172
173		return $this->ModifyDaftNestedObjectTreeRemoveWithObject(
174		$rootObject,
175		$replacementRootObject
176		);
177		}
178
179		if (
180	2	$this->CountDaftNestedObjectTreeWithObject($rootObject, false, null) > 0 &&
181	2	is_null($replacementRoot)
182		) {
183		throw new BadMethodCallException('Cannot leave orphan objects in a tree');
184		}
185
186		/**
187		* @var DaftNestedWriteableObject $alter
188		*/
189	2	foreach ($this->RecallDaftNestedObjectTreeWithObject($rootObject, false, null) as $alter) {
190		$alter = $this->StoreThenRetrieveFreshCopy($alter);
191		$alter->AlterDaftNestedObjectParentId($replacementRoot);
192		$this->RememberDaftObject($alter);
193		}
194
195	2	$this->RemoveDaftObject($rootObject);
196
197	2	$this->RebuildTreeInefficiently();
198
199	2	return $this->CountDaftNestedObjectFullTree();
200		}
201
202	6	protected function ModifyDaftNestedObjectTreeInsertAbove(
203		DaftNestedWriteableObject $newLeaf,
204		DaftNestedWriteableObject $referenceLeaf
205		) : void {
206	6	$newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->ObtainDaftNestedObjectParentId());
207	6	$referenceLeaf->AlterDaftNestedObjectParentId($newLeaf->GetId());
208
209	6	$this->StoreThenRetrieveFreshCopy($newLeaf);
210	6	$this->StoreThenRetrieveFreshCopy($referenceLeaf);
211	6	}
212
213	2	protected function ModifyDaftNestedObjectTreeInsertBelow(
214		DaftNestedWriteableObject $newLeaf,
215		DaftNestedWriteableObject $referenceLeaf
216		) : void {
217	2	$newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->GetId());
218	2	$this->StoreThenRetrieveFreshCopy($newLeaf);
219	2	}
220
221	10	protected function ModifyDaftNestedObjectTreeInsertAdjacent(
222		DaftNestedWriteableObject $newLeaf,
223		DaftNestedWriteableObject $referenceLeaf,
224		bool $before
225		) : void {
226		/**
227		* @var array<int, DaftNestedWriteableObject> $siblings
228		*/
229	10	$siblings = array_values(array_filter(
230	10	$this->RecallDaftNestedObjectTreeWithId(
231	10	$referenceLeaf->ObtainDaftNestedObjectParentId(),
232	10	false,
233		0
234		),
235		function (DaftNestedWriteableObject $leaf) use ($newLeaf) : bool {
236	10	return $leaf->GetId() !== $newLeaf->GetId();
237	10	}
238		));
239
240	10	$siblingIds = [];
241	10	$siblingSort = [];
242	10	$j = count($siblings);
243
244		/**
245		* @var DaftNestedWriteableObject $leaf
246		*/
247	10	foreach ($siblings as $leaf) {
248		/**
249		* @var scalar\|scalar[] $siblingId
250		*/
251	10	$siblingId = $leaf->GetId();
252	10	$siblingIds[] = $siblingId;
253	10	$siblingSort[] = $leaf->GetIntNestedSortOrder();
254		}
255
256	10	$pos = array_search($referenceLeaf->GetId(), $siblingIds, true);
257
258	10	if (false === $pos) {
259		throw new RuntimeException('Reference leaf not found in siblings tree!');
260		}
261
262	10	for ($i = 0; $i < $j; ++$i) {
263	10	$siblings[$i]->SetIntNestedSortOrder(
264	10	$siblingSort[$i] +
265	10	(($before ? ($i < $pos) : ($i <= $pos)) ? -1 : 1)
266		);
267	10	$this->StoreThenRetrieveFreshCopy($siblings[$i]);
268		}
269
270	10	$newLeaf->SetIntNestedSortOrder($siblingSort[$pos]);
271	10	$newLeaf->AlterDaftNestedObjectParentId($referenceLeaf->ObtainDaftNestedObjectParentId());
272
273	10	$this->StoreThenRetrieveFreshCopy($newLeaf);
274	10	}
275
276	12	protected function RememberDaftObjectData(DefinesOwnIdPropertiesInterface $object) : void
277		{
278	12	static::ThrowIfNotType($object, DaftNestedWriteableObject::class, 1, __METHOD__);
279
280	12	parent::RememberDaftObjectData($object);
281	12	}
282
283		/**
284		* @param DaftObject\|string $object
285		*/
286	14	protected static function ThrowIfNotType(
287		$object,
288		string $type,
289		int $argument,
290		string $function
291		) : void {
292	14	if ( ! is_a($object, DaftNestedWriteableObject::class, is_string($object))) {
293	2	throw new DaftObjectRepositoryTypeByClassMethodAndTypeException(
294	2	$argument,
295	2	static::class,
296	2	$function,
297	2	DaftNestedWriteableObject::class,
298	2	is_string($object) ? $object : get_class($object)
299		);
300		}
301
302	12	parent::ThrowIfNotType($object, $type, $argument, $function);
303	12	}
304
305	10	protected function RebuildTreeInefficiently() : void
306		{
307		$parentIdXref = [
308	10	(array) $this->GetNestedObjectTreeRootId(),
309		];
310
311		/**
312		* @var array<int, array<int, DaftNestedWriteableObject>> $xRefChildren
313		*/
314		$xRefChildren = [
315	10	[],
316		];
317
318		/**
319		* @var array<int, scalar\|scalar[]> $idXref
320		*/
321	10	$idXref = [];
322
323	10	$tree = $this->RecallDaftNestedObjectFullTree();
324
325		usort($tree, function (DaftNestedWriteableObject $a, DaftNestedWriteableObject $b) : int {
326	10	return $this->CompareObjects($a, $b);
327	10	});
328
329		/**
330		* @var DaftNestedWriteableObject $leaf
331		*/
332	10	foreach ($tree as $i => $leaf) {
333	10	$leafParentId = $leaf->ObtainDaftNestedObjectParentId();
334	10	$pos = array_search($leafParentId, $parentIdXref, true);
335
336	10	if (false === $pos) {
337	8	$parentIdXref[] = $leafParentId;
338
339		/**
340		* @var int $pos
341		*/
342	8	$pos = array_search($leafParentId, $parentIdXref, true);
343
344	8	$xRefChildren[$pos] = [];
345		}
346
347	10	if ( ! in_array($leaf, $xRefChildren[$pos], true)) {
348	10	$xRefChildren[$pos][] = $leaf;
349		}
350
351	10	if ( ! in_array($leaf->GetId(), $idXref, true)) {
352		/**
353		* @var scalar\|scalar[] $leafId
354		*/
355	10	$leafId = $leaf->GetId();
356	10	$idXref[] = $leafId;
357		}
358
359	10	$leaf->SetIntNestedLeft(0);
360	10	$leaf->SetIntNestedRight(0);
361	10	$leaf->SetIntNestedLevel(0);
362
363	10	$tree[$i] = $this->StoreThenRetrieveFreshCopy($leaf);
364		}
365
366	10	$n = 0;
367
368		/**
369		* @var DaftNestedWriteableObject $rootLeaf
370		*/
371	10	foreach ($xRefChildren[0] as $rootLeaf) {
372	10	$n = $this->InefficientRebuild(
373	10	$rootLeaf,
374	10	0,
375	10	$n,
376	10	$parentIdXref,
377	10	$idXref,
378	10	$xRefChildren
379		);
380		}
381	10	}
382
383	10	protected function InefficientRebuild(
384		DaftNestedWriteableObject $leaf,
385		int $level,
386		int $n,
387		array $parentIds,
388		array $ids,
389		array $children
390		) : int {
391		/**
392		* @var scalar\|scalar[] $id
393		*/
394	10	$id = $leaf->GetId();
395
396	10	$leaf->SetIntNestedLevel($level);
397	10	$leaf->SetIntNestedLeft($n);
398
399	10	++$n;
400
401		/**
402		* @var int\|false $parentPos
403		*/
404	10	$parentPos = array_search((array) $id, $parentIds, true);
405
406	10	if (false !== $parentPos) {
407		/**
408		* @var DaftNestedWriteableObject $childLeaf
409		*/
410	8	foreach ($children[$parentPos] as $childLeaf) {
411	8	$n = $this->InefficientRebuild(
412	8	$childLeaf,
413	8	$level + 1,
414	8	$n,
415	8	$parentIds,
416	8	$ids,
417	8	$children
418		);
419		}
420		}
421
422	10	$leaf->SetIntNestedRight($n);
423
424	10	$this->StoreThenRetrieveFreshCopy($leaf);
425
426	10	return $n + 1;
427		}
428
429	10	protected function StoreThenRetrieveFreshCopy(
430		DaftNestedWriteableObject $leaf
431		) : DaftNestedWriteableObject {
432	10	$this->RememberDaftObject($leaf);
433	10	$this->ForgetDaftObject($leaf);
434	10	$this->ForgetDaftObjectById($leaf->GetId());
435
436	10	$fresh = $this->RecallDaftObject($leaf->GetId());
437
438	10	if ( ! ($fresh instanceof DaftNestedWriteableObject)) {
439		throw new RuntimeException('Was not able to obtain a fresh copy of the object!');
440		}
441
442	10	return $fresh;
443		}
444		}
445

SignpostMarv / daft-nested-object

Push — master ( 3e275c...3f9da1 )

InefficientRebuild() B

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like