public function rebuild( $force = false )
	{
		$alreadyValid = forward_static_call( [get_class( $this->model ), 'isValidNestedSet'] );

		// Do not rebuild a valid Nested Set tree structure
		if ( !$force && $alreadyValid )
			return true;

		// Rebuild lefts and rights for each root node and its children (recursively).
		// We go by setting left (and keep track of the current left bound), then
		// search for each children and recursively set the left index (while
		// incrementing that index). When going back up the recursive chain we start
		// setting the right indexes and saving the nodes...
		$self = $this;

		$this->model->getConnection()->transaction( function () use ( $self )
		{
			foreach ( $self->roots() as $root )
				$self->rebuildBounds( $root, 0 );
		} );

		return false;
	}
public function rebuild( $force = false )
	{
		$alreadyValid = forward_static_call( [get_class( $this->model ), 'isValidNestedSet'] );

		// Do not rebuild a valid Nested Set tree structure
		if ( !$force && $alreadyValid )
			return true;

		// Rebuild lefts and rights for each root node and its children (recursively).
		// We go by setting left (and keep track of the current left bound), then
		// search for each children and recursively set the left index (while
		// incrementing that index). When going back up the recursive chain we start
		// setting the right indexes and saving the nodes...
		$self = $this;

		$this->model->getConnection()->transaction( function () use ( $self )
		{
			foreach ( $self->roots() as $root )
				$self->rebuildBounds( $root, 0 );
		} );

		return false;
	}
public function rebuild ( $ force = false ) { $ alreadyValid = forward_static_call ( [ get_class ( $ this -> model ) , 'isValidNestedSet' ] ) ; // Do not rebuild a valid Nested Set tree structure if ( ! $ force && $ alreadyValid ) return true ; // Rebuild lefts and rights for each root node and its children (recursively). // We go by setting left (and keep track of the current left bound), then // search for each children and recursively set the left index (while // incrementing that index). When going back up the recursive chain we start // setting the right indexes and saving the nodes... $ self = $ this ; $ this -> model -> getConnection ( ) -> transaction ( function ( ) use ( $ self ) { foreach ( $ self -> roots ( ) as $ root ) $ self -> rebuildBounds ( $ root , 0 ) ; } ) ; return false ; }
Perform the re-calculation of the left and right indexes of the whole
nested set tree structure.

@param  bool $force
@return bool
Perform the re - calculation of the left and right indexes of the whole nested set tree structure .