Changeset 89
- Timestamp:
- Apr 8, 2006 8:30:29 AM (18 years ago)
- Location:
- trunk/lib
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/lib/App.inc.php
r88 r89 894 894 } else if (isset($default_url)) { 895 895 $url = $default_url; 896 }897 896 } else if (!refererIsMe()) { 898 897 // Ensure that the redirecting page is not also the referrer. -
trunk/lib/Hierarchy.inc.php
r88 r89 1 1 <?php 2 2 /** 3 * H eirarchy.inc.php3 * Hierarchy.inc.php 4 4 * Code by Strangecode :: www.strangecode.com :: This document contains copyrighted information 5 5 */ … … 7 7 /** 8 8 * Objective: This class provides the tools to organize pieces of data into a 9 * h eirarchy of nodes. Any form of data (article, product, image) can be10 * represented as a node in this h eirarchy. This class does not manipulate the9 * hierarchy of nodes. Any form of data (article, product, image) can be 10 * represented as a node in this hierarchy. This class does not manipulate the 11 11 * data, nor is it involved in storing or retrieving the data. In fact it does 12 12 * not access the tables where data exists and cannot find out info about the 13 13 * data. You must provide identification of a piece of data (type and ID) to 14 * insert it into the h eirarchy. The node heirarchy is completely14 * insert it into the hierarchy. The node hierarchy is completely 15 15 * separate from data storage and retreival. You must separatly store the data 16 16 * using whatever logic is specific to the data then also call these functions. 17 17 * Nodes are not the data. The nodes are mere singularities in virtual space 18 * that represent a piece of data's relationship with another. The h eirarchy18 * that represent a piece of data's relationship with another. The hierarchy 19 19 * is an inverted tree structure. Each node can have virtually infinite 20 20 * children. Each child can have multiple parents. … … 24 24 */ 25 25 26 class H eirarchy {26 class Hierarchy { 27 27 28 28 /** … … 62 62 * configuration or connection parameters. 63 63 */ 64 function H eirarchy($params=array())64 function Hierarchy($params=array()) 65 65 { 66 66 $this->params = $params; … … 542 542 * the specified node IS an ancestor of a node made into it's parent, we would 543 543 * have a circular reference that would cause an infinite loop with any 544 * recursive queries of the h eirarchy.544 * recursive queries of the hierarchy. 545 545 * @param string $child_type 546 546 * @param string $child_id … … 568 568 * ALL ancestors to the specified node. I'm not sure what the order will be 569 569 * but that probably isn't useful anyways. I use this to prevent circular 570 * references in the h eirarchy.570 * references in the hierarchy. 571 571 * @param string $child_type 572 572 * @param string $child_id … … 677 677 * @return array Details of from the node table of all nodes below the 678 678 * specified node: (type, id, title, indent level, selected status) 679 * 680 * FIX ME: $include_curr doesn't work because the current node will break with an infinite loop. 679 681 */ 680 682 function &getNodeList($preselected=null, $child_type=null, $child_id=null, $type_constraint=null, $include_curr=false, $order='', $_indent=0, $_return_flag=true)
Note: See TracChangeset
for help on using the changeset viewer.