public
Last active

PHP bug reproducement

  • Download Gist
tree.php
PHP
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
<?php
/**
* @author AlexanderC
*/
 
class Tree
{
/**
* @var Node
*/
protected $head;
 
/**
* @param Node $head
*/
public function __construct(Node $head = null)
{
$this->head = $head ? : new Node('HEAD');
}
 
/**
* @return Node
*/
public function getHead()
{
return $this->head;
}
 
/**
* @param mixed $uid
* @return Node|bool
*/
public function find($uid)
{
$iterator = $this->getIterator();
 
/** @var Node $node */
foreach($iterator as $node) {
if($node->getUid() === $uid) {
return $node;
}
}
 
return false;
}
 
/**
* @param mixed $uid
* @return \SplStack
*/
public function & findAll($uid)
{
$result = new \SplStack();
 
/** @var Node $node */
foreach($this->getIterator() as $node) {
if($node->getUid() == $uid) {
$result->push($node);
}
}
 
return $result;
}
 
/**
* @return \RecursiveIteratorIterator
*/
public function getIterator()
{
return new \RecursiveIteratorIterator(
$this->head->getChildren(),
\RecursiveIteratorIterator::SELF_FIRST
);
}
}
 
class Node extends \RecursiveArrayIterator implements \Countable
{
/**
* @var array
*/
protected $children = [];
 
/**
* @var Node
*/
protected $parent;
 
/**
* @var mixed
*/
protected $data;
 
/**
* @var mixed
*/
protected $uid;
 
/**
* @var int
*/
protected $index = 0;
 
/**
* @var bool
*/
protected $assureUnique;
 
/**
* @param mixed $data
* @param mixed $uid
* @param Node $parent
* @param bool $assureUnique
*/
public function __construct($data, $uid = null, Node $parent = null, $assureUnique = false)
{
if(null !== $parent) {
$this->parent = $parent;
}
 
$this->data = $data;
$this->uid = $uid ? : uniqid(sha1(serialize($data)), true);
$this->assureUnique = $assureUnique;
}
 
/**
* @param mixed $uid
*/
public function setUid($uid)
{
$this->uid = $uid;
}
 
/**
* @return mixed
*/
public function getUid()
{
return $this->uid;
}
 
/**
* @param Node $child
*/
public function addChild(Node $child)
{
$child->setParent($this);
$this->children[] = $child;
}
 
/**
* @param array $children
*/
public function setChildren(array $children)
{
$this->children = $children;
}
 
/**
* @return array
*/
public function getChildrenArray()
{
return $this->children;
}
 
/**
* @param mixed $data
*/
public function setData($data)
{
$this->data = $data;
}
 
/**
* @return mixed
*/
public function getData()
{
return $this->data;
}
 
/**
* @param Node $parent
* @throws \RuntimeException
*/
public function setParent(Node $parent)
{
if(true === $this->assureUnique && !self::checkUnique($parent, $this->uid)) {
throw new \RuntimeException("Node uid is not unique in assigned node tree");
}
 
$this->parent = $parent;
}
 
/**
* @param Node $node
* @param mixed $uid
* @return bool
*/
protected static function checkUnique(Node $node, $uid)
{
$headNode = $node;
do {
$headNode = $node;
} while($node = $node->getParent());
 
$tree = new Tree($headNode);
 
return !$tree->find($uid);
}
 
/**
* @return \IJsonRPC\Helpers\Tree\Node
*/
public function getParent()
{
return $this->parent;
}
 
/**
* @return Node
*/
public function current()
{
return $this->children[$this->index];
}
 
/**
* @return scalar
*/
public function key()
{
return $this->index;
}
 
/**
* @return void
*/
public function next()
{
++$this->index;
}
 
/**
* @return void
*/
public function rewind()
{
$this->index = 0;
}
 
/**
* @return bool
*/
public function valid()
{
return array_key_exists($this->index, $this->children);
}
 
/**
* @return int
*/
public function count()
{
return count($this->children);
}
 
/**
* @return bool
*/
public function hasChildren()
{
return !empty($this->children);
}
 
/**
* @return \RecursiveArrayIterator
*/
public function getChildren()
{
return new \RecursiveArrayIterator($this->children);
}
}
 
$tree = new Tree();
$node1 = new Node('value1', 1);
$tree->getHead()->addChild($node1);
$node2 = new Node('value2', 2);
$node1->addChild($node2);
 
var_dump($tree->findAll(2)->offsetGet(0));

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.