@@ -176,10 +176,10 @@ |
||
| 176 | 176 | for ($i = 0, $size = sizeof($data); $i < $size; $i++) |
| 177 | 177 | { |
| 178 | 178 | $row = $data[$i]; |
| 179 | - $this_depth = $parental_depth[$row[$this->column_parent_id]] + 1; |
|
| 180 | - $repeat = (int) abs($prev_depth - $this_depth); |
|
| 179 | + $this_depth = $parental_depth[$row[$this->column_parent_id]] + 1; |
|
| 180 | + $repeat = (int) abs($prev_depth - $this_depth); |
|
| 181 | 181 | |
| 182 | - $tpl_data = array( |
|
| 182 | + $tpl_data = array( |
|
| 183 | 183 | 'PREV_DEPTH' => $prev_depth, |
| 184 | 184 | 'THIS_DEPTH' => $this_depth, |
| 185 | 185 | 'NUM_KIDS' => $this->count_descendants($row), |
@@ -162,7 +162,7 @@ |
||
| 162 | 162 | } |
| 163 | 163 | |
| 164 | 164 | [$is_current_item, $is_parent] = $this->get_current_item($row); |
| 165 | - $this_depth = $this->get_parental_depth($row) + 1; |
|
| 165 | + $this_depth = $this->get_parental_depth($row) + 1; |
|
| 166 | 166 | $leaf = $this->get_leaf_node($row, $is_current_item, $is_parent); |
| 167 | 167 | |
| 168 | 168 | $this->parental_depth[$row[$this->pk]] = $this_depth; |