| Server IP : 62.109.13.187 / Your IP : 216.73.216.11 [ Web Server : Apache/2.4.6 (CentOS) mpm-itk/2.4.7-04 OpenSSL/1.0.2k-fips PHP/8.2.28 System : Linux robothost.ru 3.10.0-1160.119.1.el7.x86_64 #1 SMP Tue Jun 4 14:43:51 UTC 2024 x86_64 User : mosrembit ( 6064) PHP Version : 8.2.28 Disable Function : NONE Domains : 0 Domains MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : ON | Sudo : ON | Pkexec : ON Directory : /proc/self/cwd/wp-content/plugins/duplicator-pro/classes/utilities/ |
Upload File : |
<?php
defined("ABSPATH") or die("");
/**
* Utility class to create a tree structure from paths
*
* Standard: PSR-2
* @link http://www.php-fig.org/psr/psr-2
*
* @package DUP_PRO
* @subpackage classes/utilities
* @copyright (c) 2017, Snapcreek LLC
* @license https://opensource.org/licenses/GPL-3.0 GNU Public License
* @since 3.8.1
*
*/
/**
* Tree files utility
*
*/
class DUP_PRO_Tree_files
{
/**
* All props must be public for json encode
*/
/**
*
* @var DUP_PRO_Tree_files_node
*/
public $tree = null;
/**
*
* @var string root tree path
*/
public $rootPath = '';
/**
*
* @param string $rootPath
*/
public function __construct($rootPath, $addAllChilds = true, $excludeList = array())
{
$rootPath = rtrim(str_replace("\\", '/', $rootPath), '/');
$this->tree = new DUP_PRO_Tree_files_node($rootPath);
if ($addAllChilds) {
$this->tree->addAllChilds($excludeList);
}
$this->rootPath = $rootPath;
}
/**
*
* @param string $path full path
* @param array $data optiona data associated at node
* @param bool $fullPath
*
* @return boolean|DUP_PRO_Tree_files_node
*/
public function addElement($path, $data = array(), $fullPath = true)
{
$newElem = $this->tree->addChild($path, $fullPath, false);
if ($newElem) {
$newElem->data = $data;
}
return $newElem;
}
}
/**
* Tree node data
*/
class DUP_PRO_Tree_files_node
{
const MAX_CHILDS_FOR_FOLDER = 250;
const MAX_TREE_NODES = 5000;
/**
* All props must be public for json encode
*/
/**
*
* @var string unique id l0_l1_l2....
*/
public $id = '';
/**
*
* @var string parent id l0_l1_...
*/
public $parentId = '';
/**
*
* @var string file basename
*/
public $name = '';
/**
*
* @var string full path
*/
public $fullPath = '';
/**
*
* @var bool is directory
*/
public $isDir = false;
/**
*
* @var DUP_PRO_Tree_files_node[] childs nodes
*/
public $childs = array();
/**
*
* @var array optiona data associated ad node
*/
public $data = array();
/**
*
* @var bool true if folder have a childs
*/
public $haveChildren = null;
/**
*
* @var bool
*/
private $traversed = false;
/**
*
* @var int if can't add a child increment exceeede count
*/
private $nodesExceeded = 0;
/**
*
* @var int
*/
private $numTreeNodes = 1;
/**
*
* @param string $path // file path
* @param string $id // current level unique id
* @param string $parent_id // parent id
*/
public function __construct($path, $id = '0', $parent_id = '')
{
$safePath = rtrim(str_replace("\\", '/', $path), '/');
$this->id = (strlen($parent_id) == 0 ? '' : $parent_id.'_').$id;
$this->parentId = $parent_id;
$this->name = basename($safePath);
$this->fullPath = $safePath;
$this->isDir = @is_dir($this->fullPath);
$this->haveChildrenCheck();
}
/**
* create tree tructure until at basename
*
* @param string $path file path
* @param bool $fullPath if true is considered a full path and must be a child of a current node else is a relative path
* @param bool $loadTraverse if true, add the files and folders present at the level of each node
* @return boolean|DUP_PRO_Tree_files_node if fails terurn false ellse return the leaf child added
* @throws Exception
*/
public function addChild($path, $fullPath = true, $loadTraverse = false)
{
if (empty($path)) {
return false;
}
$safePath = rtrim(str_replace("\\", '/', $path), '/');
if ($fullPath) {
if (strpos($safePath, $this->fullPath) !== 0) {
throw new Exception('Can\'t add no child on tree; file: "'.$safePath.'" || fullpath: "'.$this->fullPath.'"');
}
$childPath = substr($safePath, strlen($this->fullPath));
} else {
$childPath = $safePath;
}
$tree_list = explode('/', $childPath);
if (empty($tree_list[0])) {
array_shift($tree_list);
}
if (($child = $this->checkAndAddChild($tree_list[0])) === false) {
return false;
}
if ($loadTraverse) {
$child->addAllChilds();
}
if (count($tree_list) > 1) {
array_shift($tree_list);
$nodesBefore = $child->getNumTreeNodes();
$result = $child->addChild(implode('/', $tree_list), false, $loadTraverse);
$this->numTreeNodes += $child->getNumTreeNodes() - $nodesBefore;
return $result;
} else {
return $child;
}
}
/**
* if is dir scan all children files and add on childs list
*
* @param string[] exclude child to add
*/
public function addAllChilds($excludeList = array())
{
if ($this->traversed === false) {
$this->traversed = true;
if ($this->isDir) {
if ($dh = @opendir($this->fullPath)) {
while (($childName = readdir($dh)) !== false) {
if ($childName == '.' || $childName == '..' || in_array($childName, $excludeList)) {
continue;
}
$this->checkAndAddChild($childName);
}
closedir($dh);
}
}
}
}
/**
* check if current dir have children without load nodes
*/
private function haveChildrenCheck()
{
if ($this->isDir) {
$this->haveChildren = false;
if ($dh = opendir($this->fullPath)) {
while (!$this->haveChildren && ($file = readdir($dh)) !== false) {
$this->haveChildren = $file !== "." && $file !== "..";
}
closedir($dh);
}
}
}
/**
*
* @param string $name child name
* @return boolean|DUP_PRO_Tree_files_node if notes exceeded return false
*/
private function checkAndAddChild($name)
{
if (!array_key_exists($name, $this->childs)) {
if ($this->numTreeNodes > self::MAX_TREE_NODES || count($this->childs) >= self::MAX_CHILDS_FOR_FOLDER) {
$this->nodesExceeded ++;
return false;
} else {
$child = new DUP_PRO_Tree_files_node($this->fullPath.'/'.$name, count($this->childs), $this->id);
$this->childs[$name] = $child;
$this->numTreeNodes ++;
}
}
return $this->childs[$name];
}
/**
* sort child list with callback function
*
* @param callable $value_compare_func
* @return void
*/
public function uasort($value_compare_func)
{
if (!is_callable($value_compare_func)) {
return;
}
foreach ($this->childs as $child) {
$child->uasort($value_compare_func);
}
uasort($this->childs, $value_compare_func);
}
/**
* traverse tree anche call callback function
*
* @param callable $callback
* @return type
*/
public function treeTraverseCallback($callback)
{
if (!is_callable($callback)) {
return;
}
foreach ($this->childs as $child) {
$child->treeTraverseCallback($callback);
}
call_user_func($callback, $this);
}
/**
*
* @return int
*/
public function getNodesExceeded()
{
return $this->nodesExceeded;
}
public function getNumTreeNodes()
{
return $this->numTreeNodes;
}
}