390 sortorder = 0
391 elements = tree_array
396 newtree = array()
397 first_sortorder = 0
400 first_sortorder = 1
403 newtree[1] = cat_1_element
404 newtree[1][children] = renumber(1, cat_1_element[children])
 |  383 sortorder = 1
 |  396 newtree = array()
 |  397 firstsortorder = 1
 |  
 |  400 firstsortorder = 2
 |  403 newtree[2] = cat_2_element
 |  404 newtree[2][children] = renumber(2, cat_2_element[children])
 |  |   383 sortorder = 2
 |  |   396 newtree = array()
 |  |   397 firstsortorder = 2
 |  |    
 |  |   400 firstsortorder = 3
 |  |   407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = null
 |  |   408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = 4
 |  |   409 newtree[3] = item_3_element
 |  |   
 |  |   400 firstsortorder = 4
 |  |   407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = 3
 |  |   408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = null
 |  |   409 newtree[4] = item_4_element
 |  |   
 |  |   426 return newtree (array(3 => item_3_element, 4 => item_4_element))
 |  |
 |  404 newtree[2][children] = array(3 => item_3_element, 4 => item_4_element)
 |  
 |  400 firstsortorder = 5
 |  403 newtree[5] = cat_5_element
 |  404 newtree[5][children] = renumber(5, cat_5_element[children])
 |  |   383 sortorder = 5
 |  |   396 newtree = array()
 |  |   397 firstsortorder = 5
 |  |   
 |  |   400 firstsortorder = 6
 |  |   407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = null
 |  |   408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = null
 |  |   409 newtree[6] = item_6_element
 |  |          
 |  |   426 return newtree (array(6 => item_6_element))
 |  |   
 |  404 newtree[5][children] = array(6 => item_6_element)
 |
404 newtree[1][children] = array(2 => array(children => array(3 => item_3_element, 4 => item_4_element)),
                                 5 => array(children => array(6 => item_6_element)))
400 firstsortorder = 7
407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = 1
408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = 8
409 newtree[7] = item_7_element

400 firstsortorder = 8
403 newtree[8] = cat_8_element
404 newtree[8][children] = renumber(8, cat_8_element[children])
|  383 sortorder = 8
|  396 newtree = array()
|  397 firstsortorder = 8
|  
|  400 firstsortorder = 9
|  407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = null
|  408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = 10
|  409 newtree[9] = item_9_element
|  
|  400 firstsortorder = 10
|  407 element[object]->previous_sortorder = get_neighbour_sortorder(element, previous) = 9
|  408 element[object]->next_sortorder = get_neighbour_sortorder(element, next) = null
|  409 newtree[10] = item_10_element
|  
|  426 return newtree (array(9 => item_9_element, 10 => item_10_element))
|
404 newtree[8][children] = array(9 => item_9_element, 10 => item_10_element)
421 tree_array = newtree
422 first_sortorder = null
423 build_tree_filled
424 return true