@@ -188,7 +188,7 @@ public function ancestorsAndSelf($id, array $columns = [ '*' ])
188
188
*
189
189
* @return $this
190
190
*/
191
- public function whereNodeBetween ($ values , $ boolean = 'and ' , $ not = false , ? Query $ query = null )
191
+ public function whereNodeBetween ($ values , $ boolean = 'and ' , $ not = false , $ query = null )
192
192
{
193
193
($ query ?? $ this ->query )->whereBetween ($ this ->model ->getTable () . '. ' . $ this ->model ->getLftName (), $ values , $ boolean , $ not );
194
194
@@ -861,7 +861,7 @@ public function isBroken()
861
861
*
862
862
* @return int The number of changed nodes
863
863
*/
864
- public function fixTree (? Model $ root = null )
864
+ public function fixTree ($ root = null )
865
865
{
866
866
$ columns = [
867
867
$ this ->model ->getKeyName (),
@@ -899,7 +899,7 @@ public function fixSubtree($root)
899
899
*
900
900
* @return int
901
901
*/
902
- protected function fixNodes (array &$ dictionary , ? Model $ parent = null )
902
+ protected function fixNodes (array &$ dictionary , $ parent = null )
903
903
{
904
904
$ parentId = $ parent ? $ parent ->getKey () : null ;
905
905
$ cut = $ parent ? $ parent ->getLft () + 1 : 1 ;
@@ -941,7 +941,7 @@ protected function fixNodes(array &$dictionary, ?Model $parent = null)
941
941
* @internal param int $fixed
942
942
*/
943
943
protected static function reorderNodes (
944
- array &$ dictionary , array &$ updated , null | int | string $ parentId = null , $ cut = 1
944
+ array &$ dictionary , array &$ updated , $ parentId = null , $ cut = 1
945
945
) {
946
946
if ( ! isset ($ dictionary [$ parentId ])) {
947
947
return $ cut ;
@@ -973,11 +973,11 @@ protected static function reorderNodes(
973
973
* @param array $data
974
974
* @param bool $delete Whether to delete nodes that exists but not in the data
975
975
* array
976
- * @param ?Model|NodeTrait $root
976
+ * @param null $root
977
977
*
978
978
* @return int
979
979
*/
980
- public function rebuildTree (array $ data , $ delete = false , ? Model $ root = null )
980
+ public function rebuildTree (array $ data , $ delete = false , $ root = null )
981
981
{
982
982
if ($ this ->model ->usesSoftDelete ()) {
983
983
$ this ->withTrashed ();
@@ -1084,7 +1084,7 @@ protected function buildRebuildDictionary(array &$dictionary,
1084
1084
*
1085
1085
* @return $this
1086
1086
*/
1087
- public function applyNestedSetScope (? string $ table = null )
1087
+ public function applyNestedSetScope ($ table = null )
1088
1088
{
1089
1089
return $ this ->model ->applyNestedSetScope ($ this , $ table );
1090
1090
}
0 commit comments