Wala shell

Advanced PHP File Manager

Server IP: 127.0.0.1 | PHP Version: 8.3.30 | Domains Hosted: 54

Name	Size	Last Modified	Actions
📁 ..	-	2025-05-25 12:37
📄 FormUtil.php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Form\Util; /* * @author Bernhard Schussek <bschussek@gmail.com> / class FormUtil { /* * This class should not be instantiated / private function __construct() {} /* * Returns whether the given data is empty. * * This logic is reused multiple times throughout the processing of * a form and needs to be consistent. PHP's keyword `empty` cannot * be used as it also considers 0 and "0" to be empty. * * @param mixed $data * * @return Boolean */ public static function isEmpty($data) { // Should not do a check for array() === $data!!! // This method is used in occurrences where arrays are // not considered to be empty, ever. return null === $data \|\| '' === $data; } }	1.04 KB	2024-07-17 10:22
📄 InheritDataAwareIterator.php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Form\Util; /* * Iterator that traverses an array of forms. * * Contrary to \ArrayIterator, this iterator recognizes changes in the original * array during iteration. * * You can wrap the iterator into a {@link \RecursiveIterator} in order to * enter any child form that inherits its parent's data and iterate the children * of that form as well. * * @author Bernhard Schussek <bschussek@gmail.com> */ class InheritDataAwareIterator extends VirtualFormAwareIterator { }	748 B	2024-07-17 10:22
📄 OrderedHashMap.php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Form\Util; /* * A hash map which keeps track of deletions and additions. * * Like in associative arrays, elements can be mapped to integer or string keys. * Unlike associative arrays, the map keeps track of the order in which keys * were added and removed. This order is reflected during iteration. * * The map supports concurrent modification during iteration. That means that * you can insert and remove elements from within a foreach loop and the * iterator will reflect those changes accordingly. * * While elements that are added during the loop are recognized by the iterator, * changed elements are not. Otherwise the loop could be infinite if each loop * changes the current element: * * $map = new OrderedHashMap(); * $map[1] = 1; * $map[2] = 2; * $map[3] = 3; * * foreach ($map as $index => $value) { * echo "$index: $value\n" * if (1 === $index) { * $map[1] = 4; * $map[] = 5; * } * } * * print_r(iterator_to_array($map)); * * // => 1: 1 * // 2: 2 * // 3: 3 * // 4: 5 * // Array * // ( * // [1] => 4 * // [2] => 2 * // [3] => 3 * // [4] => 5 * // ) * * The map also supports multiple parallel iterators. That means that you can * nest foreach loops without affecting each other's iteration: * * foreach ($map as $index => $value) { * foreach ($map as $index2 => $value2) { * // ... * } * } * * @author Bernhard Schussek <bschussek@gmail.com> * * @since 2.2.6 / class OrderedHashMap implements \ArrayAccess, \IteratorAggregate, \Countable { /* * The elements of the map, indexed by their keys. * * @var array / private $elements = array(); /* * The keys of the map in the order in which they were inserted or changed. * * @var array / private $orderedKeys = array(); /* * References to the cursors of all open iterators. * * @var array / private $managedCursors = array(); /* * Creates a new map. * * @param array $elements The elements to insert initially. * * @since 2.2.6 / public function __construct(array $elements = array()) { $this->elements = $elements; $this->orderedKeys = array_keys($elements); } /* * {@inheritdoc} * * @since 2.2.6 / public function offsetExists($key) { return isset($this->elements[$key]); } /* * {@inheritdoc} * * @since 2.2.6 / public function offsetGet($key) { if (!isset($this->elements[$key])) { throw new \OutOfBoundsException('The offset "' . $key . '" does not exist.'); } return $this->elements[$key]; } /* * {@inheritdoc} * * @since 2.2.6 / public function offsetSet($key, $value) { if (null === $key \|\| !isset($this->elements[$key])) { if (null === $key) { $key = array() === $this->orderedKeys // If the array is empty, use 0 as key ? 0 // Imitate PHP's behavior of generating a key that equals // the highest existing integer key + 1 : max($this->orderedKeys) + 1; } $this->orderedKeys[] = $key; } $this->elements[$key] = $value; } /* * {@inheritdoc} * * @since 2.2.6 / public function offsetUnset($key) { if (false !== ($position = array_search($key, $this->orderedKeys))) { array_splice($this->orderedKeys, $position, 1); unset($this->elements[$key]); foreach ($this->managedCursors as $i => $cursor) { if ($cursor >= $position) { --$this->managedCursors[$i]; } } } } /* * {@inheritdoc} * * @since 2.2.6 / public function getIterator() { return new OrderedHashMapIterator($this->elements, $this->orderedKeys, $this->managedCursors); } /* * {@inheritdoc} * * @since 2.2.6 */ public function count() { return count($this->elements); } }	4.55 KB	2024-07-17 10:22
📄 OrderedHashMapIterator.php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Form\Util; /* * Iterator for {@link OrderedHashMap} objects. * * This class is internal and should not be used. * * @author Bernhard Schussek <bschussek@gmail.com> * * @since 2.2.6 / class OrderedHashMapIterator implements \Iterator { /* * @var array / private $elements; /* * @var array / private $orderedKeys; /* * @var integer / private $cursor; /* * @var integer / private $cursorId; /* * @var array / private $managedCursors; /* * @var string\|integer\|null / private $key; /* * @var mixed / private $current; /* * Creates a new iterator. * * @param array $elements The elements of the map, indexed by their * keys. * @param array $orderedKeys The keys of the map in the order in which * they should be iterated. * @param array $managedCursors An array from which to reference the * iterator's cursor as long as it is alive. * This array is managed by the corresponding * {@link OrderedHashMap} instance to support * recognizing the deletion of elements. * * @since 2.2.6 / public function __construct(array &$elements, array &$orderedKeys, array &$managedCursors) { $this->elements = &$elements; $this->orderedKeys = &$orderedKeys; $this->managedCursors = &$managedCursors; $this->cursorId = count($managedCursors); $this->managedCursors[$this->cursorId] = &$this->cursor; } /* * Removes the iterator's cursors from the managed cursors of the * corresponding {@link OrderedHashMap} instance. * * @since 2.2.6 / public function __destruct() { // Use array_splice() instead of isset() to prevent holes in the // array indices, which would break the initialization of $cursorId array_splice($this->managedCursors, $this->cursorId, 1); } /* {@inheritdoc} * @since 2.2.6 / public function current() { return $this->current; } /* * {@inheritdoc} * * @since 2.2.6 / public function next() { ++$this->cursor; if (isset($this->orderedKeys[$this->cursor])) { $this->key = $this->orderedKeys[$this->cursor]; $this->current = $this->elements[$this->key]; } else { $this->key = null; $this->current = null; } } /* {@inheritdoc} * @since 2.2.6 / public function key() { return $this->key; } /* {@inheritdoc} * @since 2.2.6 / public function valid() { return null !== $this->key; } /* {@inheritdoc} * @since 2.2.6 */ public function rewind() { $this->cursor = 0; if (isset($this->orderedKeys[0])) { $this->key = $this->orderedKeys[0]; $this->current = $this->elements[$this->key]; } else { $this->key = null; $this->current = null; } } }	3.54 KB	2024-07-17 10:22
📄 VirtualFormAwareIterator.php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Form\Util; /* * Iterator that traverses an array of forms. * * You can wrap the iterator into a {@link \RecursiveIterator} in order to * enter any child form that inherits its parent's data and iterate the children * of that form as well. * * @author Bernhard Schussek <bschussek@gmail.com> * * @deprecated Deprecated since version 2.3, to be removed in 3.0. Use * {@link InheritDataAwareIterator} instead. / class VirtualFormAwareIterator extends \IteratorIterator implements \RecursiveIterator { /* * {@inheritdoc} / public function getChildren() { return new static($this->current()); } /* {@inheritdoc} / public function hasChildren() { return (bool) $this->current()->getConfig()->getInheritData(); } }	1.05 KB	2024-07-17 10:22

Terminal