fork download
copy 
  1. <?php
  2.     ERROR_REPORTING(-1);
  3.  
  4. class Node {
  5.  
  6.     private $parentNode = NULL;
  7.     private $child = array();
  8.     protected $name;
  9.  
  10.  
  11.     public function __construct($name) {
  12.         $this->name = $name;
  13.     }
  14.     public function __toString() {
  15.         $node = "\nNameNode: " . $this->name . "\n";
  16.         $node .= "ParentName: " . $this->parentNode->getName() . "\n";
  17.         foreach ($this->child as $child) {
  18.             $node .= "ChildName: " . $child->getName() ."\n";
  19.         }
  20.         return $node;
  21.     }
  22.     public function getName() {
  23.         return $this->name;
  24.     }
  25.  
  26.     public function getParentNode(){ 
  27.         if (isset($this->parentNode)) {
  28.             return $this->parentNode;
  29.         }
  30.         return NULL;
  31.     }
  32.     public function getChildrenNode() {
  33.         return $this->child;
  34.     }
  35.  
  36.     public function getAllParents(){
  37.         if (NULL == $this->getParentNode()) {
  38.             return array();
  39.         } else {
  40.             $parent = $this->getParentNode();
  41.             $parents = $parent->getAllParents();
  42.             $parents[] = $parent;
  43.             return $parents;
  44.         }
  45.     }
  46.     public function getAllChildren(){
  47.         $childrenNode = $this->getChildrenNode();
  48.         $children = $childrenNode;
  49.         foreach ($childrenNode as $child) {
  50.             $children = array_merge($children, $child->getAllChildren());
  51.         }
  52.  
  53.         return $children;
  54.     }
  55.  
  56.     public function getDepth() {
  57.         $children = $this->child;
  58.         $depth = -1;
  59.         //echo $this->name() . '->';
  60.         foreach ($children as $child) {
  61.             $depth = max($depth, $seed->getDepth());
  62.         }
  63.         $depth++;
  64.         return $depth;
  65.     }
  66.  
  67.     public function getDescendantsCount(){
  68.         $DescendantsCount = 0;
  69.         $children = $this->child;
  70.         echo $this->getName() . '->';
  71.         foreach ($children as $child) {
  72.             $DescendantsCount++;
  73.             $DescendantsCount += $child->getDescendantsCount();
  74.         }
  75.         return $DescendantsCount;
  76.     }
  77.  
  78.     public function appendChild(Node $child) {
  79.         if ($this == $child) {
  80.             try {
  81.                 throw new Exception("ОШИБКА! Нельзя делать обьект " . $this->getName() . " родителем самого себя.\n");
  82.             } catch(Exception $e) {
  83.                 echo $e->getMessage();
  84.             }
  85.         }
  86.         $child->remove();
  87.  
  88.         $this->child[] = $child;
  89.         $child->parentNode = $this;
  90.     }
  91.  
  92.     public function remove(){
  93.         if (isset($this->parentNode)) {
  94.             echo "\nУдаление\n";
  95.             $parentNode = $this->parentNode;
  96.  
  97.             $children = $parentNode->child;
  98.             $key = array_search($this , $children);
  99.             unset($parentNode->child[$key]);
  100.  
  101.             $this->parentNode = null;
  102.         }
  103.     }
  104.  
  105.     public function getNextSibling(){
  106.         $parentNode = $this->parentNode;
  107.         if (NULL ==$parentNode) {
  108.             return NULL;
  109.         }
  110.         $siblings = $parentNode->getChildrenNode();
  111.  
  112.         $key = array_search( $siblings, $this);
  113.         if (isset($siblings[$key+1])) {
  114.             return $siblings[$key+1];
  115.         } else { 
  116.             return NULL;
  117.         }
  118.     }
  119.     public function getPreviousSibling(){
  120.         $parentNode = $this->parentNode;
  121.         if (NULL ==$parentNode) {
  122.             return NULL;
  123.         }
  124.         $siblings = $parentNode->getChildrenNode();
  125.         $key = array_search( $siblings, $this);
  126.         if (isset($siblings[$key-1])) {
  127.             return $siblings[$key-1];
  128.         } else { 
  129.             return NULL;
  130.         }
  131.     }
  132.  
  133.  
  134.     public function walk($function) {
  135.         $allChildren = $this->getAllChildren();
  136.         $return = array();
  137.         $callback = 
  138.             function ( $child ) use ( $function, &$return) {
  139.                 $return[] = "Имя узла: " . $child->getName() . "    Количество потомков: "
  140.                 . $child->$function();
  141.             };
  142.         array_walk( $allChildren, $callback );
  143.         print_r($return);
  144.     }
  145.     // обходит всех потомков $node, для каждого вызывая функцию
  146.  
  147.  
  148.  
  149. }
  150.  
  151.  
  152. //создаём узлы 1 -> 2
  153. //               -> 3 -> 4
  154. //               -> 5
  155. $node1 = new Node('node1');
  156.  
  157. $node2 = new Node('node2');
  158. $node1->appendChild($node2);
  159.  
  160. $node3 = new Node('node3');
  161. $node2->appendChild($node3);
  162.  
  163. $node4 = new Node('node4');
  164. $node3->appendChild($node4);
  165.  
  166. $node5 = new Node('node5');
  167. $node1->appendChild($node5);
  168.  
  169. $node6 = new Node('node6');
  170. $node4->appendChild($node6);
  171.  
  172. // Выводем имя всех нод с отступом, чтобы получилось дерево
  173. $node1->walk(function ($child) {
  174. 	// найдем глубину потомка
  175. 	$parentsCount = count($child->getAllParents());
  176. 	echo str_repeat('  ', $parentsCount) . $child->getName() . "\n";
  177. });
  178.  
  179.  
Runtime error #stdin #stdout #stderr 0.01s 20568KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
PHP Fatal error:  Method name must be a string in /home/zuanPb/prog.php on line 140
https://ideone.com/hvNXAH
language:
PHP (php 7.3.5)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!