mdtree.inc.svn-base

来自「PHP 知识管理系统（基于树结构的知识管理系统）, 英文原版的PHP源码。」· SVN-BASE 代码 · 共 394 行 · 第 1/2 页

        $this->root =& $this->contents[0];
        $default->log->debug("MDTree::buildForField done: " . print_r($this, true));

    }

    // handle deleting subtrees
    function deleteNode($iNode) {
        $stack = array();
        array_push($stack, $iNode);
        while (count($stack) != 0)
        {
            $currentNode = array_pop($stack);
            foreach ($this->contents[$currentNode] as $label => $value)
            {
                if ($label === "leaves")
                {
                    foreach ($value as $leaf)
                    {
                        $this->lookups[$leaf]->setTreeParent(0);
                        $this->lookups[$leaf]->update();
                        $this->contents[0]["leaves"][] = $leaf;
                    }
                }
                else array_push($stack, $value);
            }
            $this->mapnodes[$currentNode]->delete();
        }
        // finally, we prune the appropriate item from its parent.
        $iParent = $this->mapnodes[$iNode]->getParentNode();
        foreach ($this->contents[$iParent] as $index => $val)
            if ($iNode === $val) unset($this->contents[$iParent][$index]);
    }

    // add a node to the mapping after the fact (e.g. created later in the process.)
    function addNode($oNode) {
        $iParent = $oNode->getParentNode();
        $this->mapnodes[$oNode->getId()] =& $oNode;
        $this->contents[$oNode->getId()] = array();
        array_push($this->contents[$iParent], $oNode->getId());
    }

    function reparentKeyword($lookup_id, $destination_parent_id)
    {
        global $default;

        $oKeyword = $this->lookups[$lookup_id];
        $oldParent = $oKeyword->getTreeParent();
        $oNewParent = $this->mapnodes[$destination_parent_id];
        // we will have failed by here if its bogus.
        //$default->log->debug('MDTree::reparentKeyword '.print_r($oNewParent, true));

        // if its 0 or NULL, we reparent to null.
        if (($oNewParent === null) or ($desintation_parent_id === 0)) {
            $new_home = 0;
        } else {
            $new_home = $oNewParent->getId();
        }
        $oKeyword->setTreeParent($new_home);
        // don't assume we're reparenting from 0.
        if (!empty($this->contents[$oldparent])) {
             $KWIndex = array_search($lookup_id, $this->contents[$oldParent]["leaves"]);
             unset($this->contents[$oldParent]["leaves"][$KWIndex]);

        }
        $this->contents[$new_home]["leaves"][] = $oKeyword->getId();
        $oKeyword->update();
    }


    // STUB FUNCTIONS:  need to be filled in.


    // REALLY need to deprecate this, but how?
    function render($bEditable) { return null; }     // render using a template (with edit / buttons.) FIXME build a widget / renderer.


    /* ----------------------- EVIL HACK --------------------------
     *
     *  This whole thing needs to replaced, as soon as I work out how
     *  to non-sucking Smarty recursion.
     */

    function _evilTreeRecursion($subnode, $treeToRender, $inputname)
    {
        $treeStr = "<ul>";
        foreach ($treeToRender->contents[$subnode] as $subnode_id => $subnode_val)
        {
            if ($subnode_id !== "leaves") {
                $extraclass = '';
                if (array_key_exists($subnode_val, $this->activenodes)) {
                    $extraclass = ' active';
                } else {
		    $extraclass = ' inactive';
		}

                $treeStr .= '<li class="treenode' . $extraclass . '"><a class="pathnode" onclick="toggleElementClass(\'active\', this.parentNode);toggleElementClass(\'inactive\', this.parentNode);">' . htmlspecialchars($treeToRender->mapnodes[$subnode_val]->getName()) . '</a>';
                $treeStr .= $this->_evilTreeRecursion($subnode_val, $treeToRender, $inputname);
                $treeStr .= '</li>';
            }
            else
            {
                foreach ($subnode_val as $leaf)
                {
                    $is_selected = '';
                    if ($leaf === $this->activevalue) {
                       $is_selected=' checked="checked"';
                    }
                    $sValue = htmlspecialchars($treeToRender->lookups[$leaf]->getName());
                    $treeStr .= '<li class="leafnode"><input type="radio" name="'.$inputname.'" value="'.$sValue.'" '.$is_selected.'>' . $sValue .'</input>';
                    $treeStr .=  '</li>';            }
                }
        }
        $treeStr .= '</ul>';
        return $treeStr;

    }

    // I can't seem to do recursion in smarty, and recursive templates seems a bad solution.
    // Come up with a better way to do this (? NBM)
    function _evilTreeRenderer($treeToRender, $inputname) {
        //global $default;
        $treeStr = "<!-- this is rendered with an unholy hack. sorry. -->";
        $stack = array();
        $exitstack = array();

        // $treeStr .= print_r($this->activenodes,true);
        // the inner section is generised.

        $treeStr .= '<ul class="kt_treenodes">';
        //$default->log->debug("EVILRENDER: " . print_r($treeToRender, true));
        foreach ($treeToRender->getRoot() as $node_id => $subtree_nodes)
        {
            //$default->log->debug("EVILRENDER: ".$node_id." => ".$subtree_nodes." (".($node_id === "leaves").")");
            // leaves are handled differently.
            if ($node_id !== "leaves") {
                $extraclass = '';

                if (array_key_exists($subtree_nodes, $this->activenodes)) {
                    $extraclass = ' active';
                } else {
		    $extraclass = ' inactive';
		}

                $treeStr .= '<li class="treenode' . $extraclass . '"><a class="pathnode"  onclick="toggleElementClass(\'active\', this.parentNode);toggleElementClass(\'inactive\', this.parentNode);">' . $treeToRender->mapnodes[$subtree_nodes]->getName().'</a>';
                $treeStr .= $this->_evilTreeRecursion($subtree_nodes, $treeToRender, $inputname);
                $treeStr .= '</li>';
            }
            else
            {
                foreach ($subtree_nodes as $leaf)
                {
                    $is_selected = '';
                    if ($leaf === $this->activevalue) {
                       $is_selected=' checked="checked"';
                    }
                    $sValue = htmlspecialchars($treeToRender->lookups[$leaf]->getName());
                    $treeStr .= '<li class="leafnode"><input type="radio" name="'.$inputname.'" value="'.$sValue.'" '.$is_selected.'>' . $sValue .'</input>';
                    $treeStr .=  '</li>';
                }
            }
        }
        $treeStr .= '</ul>';
        //$treeStr .= '</li></ul>';

        return $treeStr;

    }

    // again, not pretty.  set a particular item as "active"
    function setActiveItem($sMetadataMatch) {
        // also need to:
        //  (a) find the parent and mark it "live".
        //  (b) repeat until we hit parent == 0.
        //
        // we need the md-item, then.
        $md_node = null;
        foreach ($this->lookups as $lookup) {
            if ($sMetadataMatch == $lookup->getName()) {
                $md_node = $lookup;
            }
        }
        if ($md_node === null) {
            return ;
        } else {
            $this->activevalue = $md_node->getId();
            $current_node = $md_node->getTreeParent();
            $this->activenodes[0] = true; // ALWAYS the case, since we have a node.
            while ($current_node != 0) {
                $this->activenodes[$current_node] = true;
                $current_node = $this->mapnodes[$current_node]->getParentNode();
            }
        }
    }
}

?>