Lines Matching defs:children

133 	public $children = array();
161 		$this->children = null;
225 		$string .= ' children: ' . count($this->children);
242 		// children list first.
246 			$this->parent->children[] = $this;
254 		return !empty($this->children);
257 	function children($idx = -1)
260 			return $this->children;
263 		if (isset($this->children[$idx])) {
264 			return $this->children[$idx];
272 		if (count($this->children) > 0) {
273 			return $this->children[0];
280 		if (count($this->children) > 0) {
281 			return end($this->children);
292 		$idx = array_search($this, $this->parent->children, true);
294 		if ($idx !== false && isset($this->parent->children[$idx + 1])) {
295 			return $this->parent->children[$idx + 1];
307 		$idx = array_search($this, $this->parent->children, true);
310 			return $this->parent->children[$idx - 1];
589 			$nodes = $this->children;
592 			&& in_array($this, $this->parent->children)) { // Next-Sibling Combinator
593 				$index = array_search($this, $this->parent->children, true) + 1;
594 				if ($index < count($this->parent->children))
595 					$nodes[] = $this->parent->children[$index];
598 			&& in_array($this, $this->parent->children)) { // Subsequent Sibling Combinator
599 				$index = array_search($this, $this->parent->children, true);
600 				$nodes = array_slice($this->parent->children, $index);
622 			if($pass && !in_array($node, $node->parent->children, true)) {
693 								foreach ($node->parent->children as $c) {
1294 		$cidx = array_search($node, $this->children, true);
1299 			foreach($node->children as $child) {
1314 			unset($this->children[$cidx]);
1349 		return $this->children($idx);
1601 		if (isset($this->children)) {
1602 			foreach ($this->children as $n) {
2142 			$this->parent->children[] = $node;