Lines Matching refs:node
576 * @param int $max the node at $max level will retrieve all its child nodes through the AJAX mechanism
633 //add root node
683 //Current open node
695 foreach ($nodes as $i => $node) {
698 while (isset($nodes[end($q) - 1]) && $node['level'] <= $nodes[end($q) - 1]['level']) {
702 //till i found its father node
703 if ($node['level'] == 1) {
704 //root node
707 //Father node
710 //add node and its options
711 if ($node['type'] == 'd') {
712 //Search the lowest open node of a tree branch in order to open it.
713 if ($node['open']) {
714 if ($node['level'] < $nodes[$currentOpenNode]['level']) {
720 //insert node in last position
723 $out .= $jscmd . "('" . idfilter($node['id'], false) . "',$i," . $father
724 . "," . json_encode($node['title']);
726 if ($node['hns']) {
727 $out .= ",'" . idfilter($node['hns'], false) . "'";
731 if ($node['type'] == 'd' || $node['type'] == 'l') {
737 if ($node['type'] == 'l') {
784 foreach ($nodes as $i => $node) {
789 //closed node
790 if ($node['type'] == "d" && !$node['open']) {
792 $level = $node['level'];
809 * - open is node open