Changeset 90 for branches/1.1dev/lib

Timestamp:

Apr 8, 2006 8:35:17 AM (18 years ago)

Author:

scdev

Message:

changed addslashes to mysql_real_escape_string

File:

• branches/1.1dev/lib/Hierarchy.inc.php (modified) (9 diffs)

branches/1.1dev/lib/Hierarchy.inc.php

@@ -1 +1 @@
 <?php
 /**
- * Heirarchy.inc.php 
+ * Hierarchy.inc.php 
  * Code by Strangecode :: www.strangecode.com :: This document contains copyrighted information
  */
@@ -7 +7 @@
 /**
  * Objective: This class provides the tools to organize pieces of data into a
- * heirarchy of nodes. Any form of data (article, product, image) can be
- * represented as a node in this heirarchy. This class does not manipulate the
+ * hierarchy of nodes. Any form of data (article, product, image) can be
+ * represented as a node in this hierarchy. This class does not manipulate the
  * data, nor is it involved in storing or retrieving the data. In fact it does
  * not access the tables where data exists and cannot find out info about the
  * data. You must provide identification of a piece of data (type and ID) to
- * insert it into the heirarchy. The node heirarchy is completely
+ * insert it into the hierarchy. The node hierarchy is completely
  * separate from data storage and retreival. You must separatly store the data
  * using whatever logic is specific to the data then also call these functions.
  * Nodes are not the data. The nodes are mere singularities in virtual space
- * that represent a piece of data's relationship with another. The heirarchy
+ * that represent a piece of data's relationship with another. The hierarchy
  * is an inverted tree structure. Each node can have virtually infinite
  * children. Each child can have multiple parents.
@@ -29 +29 @@
 require_once dirname(__FILE__) . '/Utilities.inc.php';
 
-class Heirarchy {
+class Hierarchy {
 
     /**
@@ -67 +67 @@
      *                          configuration or connection parameters.
      */
-    function Heirarchy($params=array())
+    function Hierarchy($params=array())
     {
         $this->params = $params;
@@ -128 +128 @@
     
     /**
-     * Takes a singlar node identifier and returns it as components of an array.
+     * Takes a singular node identifier and returns it as components of an array.
      * @param string    $node
      * @return mixed    Array of node type and id on success, false on failure.
@@ -547 +547 @@
      * the specified node IS an ancestor of a node made into it's parent, we would
      * have a circular reference that would cause an infinite loop with any
-     * recursive queries of the heirarchy.
+     * recursive queries of the hierarchy.
      * @param  string    $child_type
      * @param  string    $child_id
@@ -573 +573 @@
      * ALL ancestors to the specified node. I'm not sure what the order will be
      * but that probably isn't useful anyways. I use this to prevent circular
-     * references in the heirarchy.
+     * references in the hierarchy.
      * @param  string    $child_type
      * @param  string    $child_id
@@ -712 +712 @@
             for ($i=0; $i<$num_children; $i++) {
 
-                $row = $my_children[$i];
-                // Preventing circular references.
-                if ($row['child_type'] == $child_type && $row['child_id'] == $child_id) {
-                    logMsg(sprintf(_("Circular reference detected: %s has itself as a parent."), $this->toStringID($row['child_type'], $row['child_id'])), LOG_ERR, __FILE__, __LINE__);
+                // Preventing circular references (Except when including current  item in list).
+                if ($my_children[$i]['child_type'] == $child_type && $my_children[$i]['child_id'] == $child_id && !($_return_flag && $include_curr)) {
+                    logMsg(sprintf(_("Circular reference detected: %s has itself as a parent."), $this->toStringID($my_children[$i]['child_type'], $my_children[$i]['child_id'])), LOG_ERR, __FILE__, __LINE__);
                     continue;
                 }
-                $row['indent'] = $_indent;
-                if (in_array($this->toStringID($row['child_type'], $row['child_id']), $preselected)) {
-                    $row['selected'] = true;
+                
+                $my_children[$i]['indent'] = $_indent;
+
+                if (in_array($this->toStringID($my_children[$i]['child_type'], $my_children[$i]['child_id']), $preselected)) {
+                    $my_children[$i]['selected'] = true;
                 }
-                $output[] = $row;
-                unset($row);
+
+                $output[] = $my_children[$i];
                 
-                // This is so we test if each node is a string only once. We store the result in the is_a_leaf array statically.
+                // Test if each node is a string only once. Store the result in the is_a_leaf array statically.
                 if (!isset($is_a_leaf[$this->toStringID($my_children[$i]['child_type'], $my_children[$i]['child_id'])])) {
                     $is_a_leaf[$this->toStringID($my_children[$i]['child_type'], $my_children[$i]['child_id'])] = $this->isLeaf($my_children[$i]['child_type'], $my_children[$i]['child_id']);
                 }
                 if (!$is_a_leaf[$this->toStringID($my_children[$i]['child_type'], $my_children[$i]['child_id'])]) {
-                    // If this node is not a leaf, we dive into it recursivly.
+                    // If this node is not a leaf, we dive into it recursively.
                     $this->getNodeList($preselected, $my_children[$i]['child_type'], $my_children[$i]['child_id'], $type_constraint, $include_curr, $order, $_indent+1, false);
                 }
@@ -747 +748 @@
     }
     
+    function convertListToTree($curr, $child_type=null, $child_id=null, $_return_flag=true)
+    {
+        if (!is_array($curr) || empty($curr)) {
+            return array();
+        }
+
+        static $orig;
+        static $children_map;
+        static $node_map;
+        
+        // The original $curr contains the full list. Save a copy of this.
+        if (!isset($orig)) {
+            $orig = $curr;
+
+            // Create children map, a dictionary of Parent IDs -> Children IDs.
+            $children_map = array();
+            foreach ($orig as $i => $n) {
+                $n_parent = $this->toStringID($n['parent_type'], $n['parent_id']);
+                $n_child = $this->toStringID($n['child_type'], $n['child_id']);
+                $children_map[$n_parent][] = $n_child;
+            }
+
+            // Create node array map, a dictionary of $orig keys -> node IDs.
+            $node_map = array();
+            foreach ($orig as $i => $n) {
+                $n_child = $this->toStringID($n['child_type'], $n['child_id']);
+                $node_map[$n_child] = $i;
+            }
+            
+            // Set initial (root) node.
+            if (isset($child_type) && isset($child_id)) {
+                // Use provided node as starting point.
+                $curr = $orig[$node_map[$this->toStringID($child_type, $child_id)]];
+            } else {
+                // Otherwise assume first element of orig is starting point.
+                $curr = $orig[0];
+            }
+        }
+        
+        // Get children of current node.
+        $curr_str_id = $this->toStringID($curr['child_type'], $curr['child_id']);
+        $curr_children = $children_map[$curr_str_id];
+        
+        // If any children, recurse in appending a multidimensional array to $curr.
+        if (!empty($curr_children)) {
+            foreach ($curr_children as $child) {
+                $curr['children'][] = $this->convertListToTree($orig[$node_map[$child]], null, null, false);
+            }
+        }
+        
+        if ($_return_flag) {
+            // We must reset the static variables so that they do
+            // not fill up during subsequent function calls.
+            $orig = null;
+            $children_map = null;
+            $node_map = null;
+            return array($curr);
+        }
+
+        return $curr;
+    }
+
+    function printTree($in)
+    {
+        if (!is_array($in) || empty($in)) {
+            return false;
+        }
+
+        ?><ul><?php
+        foreach ($in as $n) {
+            $class = $n['selected'] ? ' class="current"' : '';
+            ?><li<?php echo $class; ?>><?php
+            echo oTxt($n['title']);
+            if (isset($n['children']) && !empty($n['children'])) {
+                $this->printTree($n['children']);
+            }
+            ?></li><?php
+        }
+        ?></ul><?php
+    }
     
     /**