Path::resolve() - Code Metrics - Inspection of "Another scrutinizer microfix" - ama-team/pathetic - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 5419b6...8a2b83 )

by Fike

created 2017-05-31 11:51 UTC

Path::resolve() A

↳ Parent: Path

Complexity

Conditions	2
Paths	2

Size

Total Lines	10
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	7
CRAP Score	2

Importance

Changes

Metric	Value
dl	0
loc	10
ccs	7
cts	7
cp	1
rs	9.4285
c	0
b	0
f	0
cc	2
eloc	7
nc	2
nop	1
crap	2

<?php

namespace AmaTeam\Pathetic;

use ArrayIterator;
use Iterator;
use RuntimeException;

/**
 * This class represents abstract filesystem path - regardless of underlying
 * operating system. It is represented just as (sometimes) scheme, (sometimes)
 * root point, and a list of segments of which path consists. It provides lots
 * of auxiliary methods (like hierarchy comparison or paths resolution) that
 * help to deal with paths in an OS-independent way, which, i hope, will result
 * in easier pathwork in any library.
 *
 * @author Etki <[email protected]>
 */
class Path
{
    const PLATFORM_UNIX = 'unix';
    const PLATFORM_WINDOWS = 'windows';

    /**
     * Separator that is used to render platform-independent representations.
     */
    const SEPARATOR = '/';

    /**
     * Path scheme, if any was used.
     *
     * @var string|null
     */
    private $scheme;

    /**
     * Path root. May be null (relative path), empty string (unix root or
     * windows path \like\that) or drive name (windows-only).
     *
     * @var string|null
     */
    private $root;

    /**
     * List of path segments.
     *
     * @var string[]
     */
    private $segments;

    /**
     * Separator that will be used to assemble path back.
     *
     * @var string
     */
    private $separator;

    /**
     * @param string|null $scheme
     * @param string|null $root
     * @param string[] $segments
     * @param string $separator
     */
    public function __construct($scheme, $root, array $segments, $separator)
    {
        $this->scheme = $scheme;
        $this->root = $root;
        $this->segments = $segments;
        $this->separator = $separator;
    }

    /**
     * Parses provided path into {@link Path} instance, acting as a public
     * constructor for whole Path class.
     *
     * @param string $input Path to be parsed
     * @param string|null $platform Platform used to determine correct
     * algorithm. If omitted/set to null, will be detected automatically.
     *
     * @return Path
     */
    public static function parse($input, $platform = null)
    {
        $platform = $platform ?: static::detectPlatform();
        $separator = $platform === static::PLATFORM_UNIX ? '/' : '\\';
        $scheme = static::extractScheme($input);
        $scheme = empty($scheme) ? null : $scheme;
        $path = static::stripScheme($input, $scheme);
        if ($platform === static::PLATFORM_WINDOWS) {
            $path = str_replace('\\', '/', $path);
        }
        $segments = $path === '' ? [] : explode('/', $path);
        $root = null;
        if (static::containsRoot($segments, $platform)) {
            $root = array_shift($segments);
            $segments = $segments === [''] ? [] : $segments;
        }
        return new static($scheme, $root, $segments, $separator);
    }

    protected static function extractScheme($input)
    {
        $position = strpos($input, '://');
        if ($position === false) {
            return null;
        }
        return substr($input, 0, $position);
    }

    protected static function stripScheme($input, $scheme)
    {
        return empty($scheme) ? $input : substr($input, strlen($scheme) + 3);
    }

    protected static function containsRoot(array $segments, $platform)
    {
        if (empty($segments)) {
            return false;
        }
        if ($segments[0] === '') {
            return true;
        }
        if ($platform === static::PLATFORM_UNIX) {
            return false;
        }
        return strpos($segments[0], ':') > 0;
    }

    /**
     * Returns platform matching the separator. Exists for 100% coverage :P
     *
     * @param string $separator
     * @return string
     */
    public static function getPlatformBySeparator($separator)
    {
        switch ($separator) {
            case '/':
                return static::PLATFORM_UNIX;
            case '\\':
                return static::PLATFORM_WINDOWS;
            default:
                $format = 'Unknown directory separator %s';
                throw new RuntimeException(sprintf($format, $separator));
        }
    }

    /**
     * Detects current platform.
     *
     * @return string
     */
    public static function detectPlatform()
    {
        return static::getPlatformBySeparator(DIRECTORY_SEPARATOR);
    }

    /**
     * Converts input into path. Throws runtime exception if that's not
     * possible.
     *
     * @param Path|string|mixed $input
     * @return Path|null
     */
    protected function tryAdapt($input)
    {
        if ($input instanceof Path) {
            return $input;
        }
        if (is_object($input)) {
            if (method_exists($input, '__toString')) {
                $input = $input->__toString();
            }
        }
        return is_string($input) ? static::parse($input) : null;
    }

    /**
     * Converts input into path. Throws runtime exception if that's not
     * possible.
     *
     * @param Path|string $input
     * @return Path
     */
    protected function adapt($input)
    {
        $input = $this->tryAdapt($input);
        if ($input === null) {
            throw new RuntimeException('Invalid input provided');
        }
        return $input;
    }

    /**
     * Creates new path, destroying as much empty ('') and dot-entries
     * ('.', '..') as possible, so path 'node/./../leaf' will be truncated
     * just to leaf, but 'node/../../leaf' would result in '../leaf'.
     *
     * @return Path
     */
    public function normalize()
    {
        /**
         * @param string[] $carrier
         * @param string $segment
         * @return string[]
         */
        $reducer = function ($carrier, $segment) {
            if ($segment === '' || $segment === '.') {
                return $carrier;
            }
            if ($segment === '..' && !empty($carrier) && end($carrier) !== '..') {
                array_shift($carrier);
                return $carrier;
            }
            $carrier[] = $segment;
            return $carrier;
        };
        $copy = clone $this;
        /** @var string[] $segments */
        $segments = array_reduce($this->segments, $reducer, []);
        $copy->segments = $segments;
        return $copy;
    }

    /**
     * Returns hierarchy branch from the topmost node (root, if present) down
     * to current node, so `/a/b/c` will result in `/a`, `  /a/b` and `/a/b/c`,
     * and `a/b` in `a` and `a/b`.
     *
     * @return Path[]
     */
    public function enumerate()
    {
        $accumulator = [];
        $results = [];
        $normalized = $this->normalize();
        foreach ($normalized->segments as $segment) {
            $copy = clone $normalized;
            $copy->segments = $accumulator;
            $results[] = $copy;
            $accumulator[] = $segment;
        }
        $results[] = $this;
        return $results;
    }

    /**
     * Returns iterator that will iterate hierarchy branch according to
     * {@link #enumerate} rules.
     *
     * @return Iterator Iterator that emits Path instances.
     */
    public function iterator()
    {
        return new ArrayIterator($this->enumerate());
    }

    /**
     * Returns list of path parents, starting from the topmost one and going
     * down one by one, similar to {@link #enumerate}.
     *
     * @return Path[]
     */
    public function getParents()
    {
        $enumeration = $this->enumerate();
        array_pop($enumeration);
        return $enumeration;
    }

    /**
     * @return bool
     */
    public function isAbsolute()
    {
        return $this->root !== null;
    }

    /**
     * @return bool
     */
    public function isRelative()
    {
        return $this->root === null;
    }

    /**
     * @return bool
     */
    public function isRoot()
    {
        return $this->root !== null && empty($this->segments);
    }

    /**
     * Returns true if $other is located on the same hierarchy branch higher
     * that current path.
     *
     * If path schemes differ, or not both paths are relative/absolute, this
     * method will instantly return false.
     *
     * @param Path|string $other
     * @return bool
     */
    public function isDescendantOf($other)
    {
        $other = $this->adapt($other)->normalize();
        $current = $this->normalize();
        if ($current->scheme !== $other->scheme) {
            return false;
        }
        if ($current->root !== $other->root) {
            return false;
        }
        if (sizeof($current->segments) <= sizeof($other->segments)) {
            return false;
        }
        $limit = sizeof($other->segments);
        for ($i = 0; $i < $limit; $i++) {
            if ($other->segments[$i] !== $current->segments[$i]) {
                return false;
            }
        }
        return true;
    }

    /**
     * Returns true if $other is located on the same hierarchy branch deeper
     * that current path.
     *
     * If path schemes differ, or not both paths are relative/absolute, this
     * method will instantly return false.
     *
     * @param Path|string $other
     * @return bool
     */
    public function isAncestorOf($other)
    {
        return $this->adapt($other)->isDescendantOf($this);
    }

    /**
     * Returns true if $other is direct parent of current path.
     *
     * If path schemes differ, or not both paths are relative/absolute, this
     * method will instantly return false.
     *
     * @param Path|string $other
     * @return bool
     */
    public function isChildOf($other)
    {
        $other = $this->adapt($other)->normalize();
        $current = $this->normalize();
        if (sizeof($other->segments) !== sizeof($current->segments) - 1) {
            return false;
        }
        return $current->isDescendantOf($other);
    }

    /**
     * Returns true if $other is direct child of current path.
     *
     * If path schemes differ, or not both paths are relative/absolute, this
     * method will instantly return false.
     *
     * @param Path|string $other
     * @return bool
     */
    public function isParentOf($other)
    {
        return $this->adapt($other)->isChildOf($this);
    }

    /**
     * Returns true if $other is located on the smae hierarchy level.
     *
     * If path schemes differ, or not both paths are relative/absolute, this
     * method will instantly return false.
     *
     * @param Path|string $other
     * @return bool
     */
    public function isSiblingOf($other)
    {
        $other = $this->adapt($other);
        if ($other->isRoot()) {
            return $this->isRoot() && $this->root === $other->root;
        }
        return $other->getParent()->isParentOf($this);
    }

    /**
     * Returns direct parent of current path. In case of call on root node
     * exception will be thrown.
     *
     * @return Path
     */
    public function getParent()
    {
        if ($this->isRoot()) {
            throw new RuntimeException('Root cannot have parent node');
        }
        $copy = clone $this;
        $copy->segments[] = '..';
        return $copy->normalize();
    }

    /**
     * Resolves other path against current one (or, in other words, prepends
     * current path to provided one). If provided path is absolute, it is
     * returned as-is, otherwise it is appended to current one:
     *
     * /a/b resolve /c/d => /b/c
     * /a/b resolve c/d => /a/b/c/d
     * a/b resolve c/d => a/b/c/d
     *
     * @param Path|string $other
     *
     * @return Path
     */
    public function resolve($other)
    {
        $other = $this->adapt($other);
        if ($other->isAbsolute()) {
            return $other;
        }
        $copy = clone $this;
        $copy->segments = array_merge($copy->segments, $other->segments);
        return $copy;
    }

    /**
     * Construct a relative path, trying to subtract current path from provided
     * one (thus providing a path required to traverse from current one to
     * provided one). If called with an absolute path against relative or vice
     * versa, will return other path as is.
     *
     * @param Path|string $other
     *
     * @return Path
     */
    public function relativize($other)
    {
        $other = $this->adapt($other);
        if ($other->root !== $this->root) {
            return $other;
        }
        $current = $this->normalize();
        $other = $other->normalize();
        $counter = 0;
        $count = sizeof($current->segments);
        for ($i = 0; $i < $count; $i++) {
            if (!isset($other->segments[$i])) {
                break;
            }
            if ($current->segments[$i] !== $other->segments[$i]) {
                break;
            }
            $counter++;
        }
        /** @var string[] $traversal */
        $traversal = [];
        if ($count - $counter > 0) {
            $traversal = array_fill(0, $count - $counter, '..');
        }
        /** @var string[] $slice */
        $slice = array_slice($other->segments, $counter);
        /** @var string[] $segments */
        $segments = array_merge($traversal, $slice);
        $copy = clone $this;
        $copy->root = null;
        $copy->segments = $segments;
        return $copy;
    }

    /**
     * Lexicographically compares one path to another.
     *
     * @param Path|string|null $other
     * @return int
     */
    public function compareTo($other)
    {
        $other = $this->tryAdapt($other);
        if ($other === null) {
            return 1;
        }
        $other = $other->normalize();
        $current = $this->normalize();
        $schemes = $this->compareStrings($current->scheme, $other->scheme);
        if ($schemes !== 0) {
            return $schemes;
        }
        $roots = $this->compareStrings($current->root, $other->root);
        if ($roots !== 0) {
            return $roots;
        }
        $limit = max(sizeof($current->segments), sizeof($other->segments));
        for ($i = 0; $i < $limit; $i++) {
            if (!isset($current->segments[$i])) {
                return -1;
            } else if (!isset($other->segments[$i])) {
                return 1;
            } else if ($current->segments[$i] === $other->segments[$i]) {
                continue;
            }
            return strcmp($current->segments[$i], $other->segments[$i]);
        }
        return 0;
    }

    /**
     * Helper method for {@link #compareTo()}
     *
     * @param string|null $left
     * @param string|null $right
     * @return int
     */
    protected function compareStrings($left, $right)
    {
        if ($left === null) {
            return $right === null ? 0 : -1;
        }
        if ($right === null) {
            return 1;
        }
        return strcmp($left, $right);
    }

    /**
     * Compares current path to provided one and tells if they are equal.
     *
     * @param Path|string|null $other
     * @return bool
     */
    public function equals($other)
    {
        return $this->compareTo($other) === 0;
    }

    /**
     * @return string|null
     */
    public function getScheme()
    {
        return $this->scheme;
    }

    /**
     * @return string|null
     */
    public function getRoot()
    {
        return $this->root;
    }

    /**
     * @return string[]
     */
    public function getSegments()
    {
        return $this->segments;
    }

    /**
     * @return string
     */
    public function getSeparator()
    {
        return $this->separator;
    }

    /**
     * @param string|null $scheme
     * @return Path
     */
    public function withScheme($scheme)
    {
        $copy = clone ($this);
        $copy->scheme = $scheme;
        return $copy;
    }

    /**
     * @return Path
     */
    public function withoutScheme()
    {
        return $this->withScheme(null);
    }

    /**
     * @param string $root
     * @return Path
     */
    public function withRoot($root)
    {
        $copy = clone $this;
        $copy->root = $root;
        return $copy;
    }

    /**
     * @return Path
     */
    public function withoutRoot()
    {
        return $this->withRoot(null);
    }

    /**
     * Assembles string representation using provided separator.
     *
     * @param string $separator
     * @return string
     */
    protected function assemble($separator)
    {
        $builder = '';
        if (!empty($this->scheme)) {
            $builder .= $this->scheme . '://';
        }
        if ($this->root !== null) {
            $builder .= $this->root . $separator;
        }
        return $builder . implode($separator, $this->segments);
    }

    /**
     * Returns platform-independent representation.
     *
     * @return string
     */
    public function __toString()
    {
        return $this->assemble(static::SEPARATOR);
    }

    /**
     * Returns representation for target platform.
     *
     * @return string
     */
    public function toPlatformString()
    {
        return $this->assemble($this->separator);
    }
}


1		<?php
2
3		namespace AmaTeam\Pathetic;
4
5		use ArrayIterator;
6		use Iterator;
7		use RuntimeException;
8
9		/**
10		* This class represents abstract filesystem path - regardless of underlying
11		* operating system. It is represented just as (sometimes) scheme, (sometimes)
12		* root point, and a list of segments of which path consists. It provides lots
13		* of auxiliary methods (like hierarchy comparison or paths resolution) that
14		* help to deal with paths in an OS-independent way, which, i hope, will result
15		* in easier pathwork in any library.
16		*
17		* @author Etki <[email protected]>
18		*/
19		class Path
20		{
21		const PLATFORM_UNIX = 'unix';
22		const PLATFORM_WINDOWS = 'windows';
23
24		/**
25		* Separator that is used to render platform-independent representations.
26		*/
27		const SEPARATOR = '/';
28
29		/**
30		* Path scheme, if any was used.
31		*
32		* @var string\|null
33		*/
34		private $scheme;
35
36		/**
37		* Path root. May be null (relative path), empty string (unix root or
38		* windows path \like\that) or drive name (windows-only).
39		*
40		* @var string\|null
41		*/
42		private $root;
43
44		/**
45		* List of path segments.
46		*
47		* @var string[]
48		*/
49		private $segments;
50
51		/**
52		* Separator that will be used to assemble path back.
53		*
54		* @var string
55		*/
56		private $separator;
57
58		/**
59		* @param string\|null $scheme
60		* @param string\|null $root
61		* @param string[] $segments
62		* @param string $separator
63		*/
64	97	public function __construct($scheme, $root, array $segments, $separator)
65		{
66	97	$this->scheme = $scheme;
67	97	$this->root = $root;
68	97	$this->segments = $segments;
69	97	$this->separator = $separator;
70	97	}
71
72		/**
73		* Parses provided path into {@link Path} instance, acting as a public
74		* constructor for whole Path class.
75		*
76		* @param string $input Path to be parsed
77		* @param string\|null $platform Platform used to determine correct
78		* algorithm. If omitted/set to null, will be detected automatically.
79		*
80		* @return Path
81		*/
82	97	public static function parse($input, $platform = null)
83		{
84	97	$platform = $platform ?: static::detectPlatform();
85	97	$separator = $platform === static::PLATFORM_UNIX ? '/' : '\\';
86	97	$scheme = static::extractScheme($input);
87	97	$scheme = empty($scheme) ? null : $scheme;
88	97	$path = static::stripScheme($input, $scheme);
89	97	if ($platform === static::PLATFORM_WINDOWS) {
90	34	$path = str_replace('\\', '/', $path);
91	34	}
92	97	$segments = $path === '' ? [] : explode('/', $path);
93	97	$root = null;
94	97	if (static::containsRoot($segments, $platform)) {
95	37	$root = array_shift($segments);
96	37	$segments = $segments === [''] ? [] : $segments;
97	37	}
98	97	return new static($scheme, $root, $segments, $separator);
99		}
100
101	97	protected static function extractScheme($input)
102		{
103	97	$position = strpos($input, '://');
104	97	if ($position === false) {
105	88	return null;
106		}
107	10	return substr($input, 0, $position);
108		}
109
110	97	protected static function stripScheme($input, $scheme)
111		{
112	97	return empty($scheme) ? $input : substr($input, strlen($scheme) + 3);
113		}
114
115	97	protected static function containsRoot(array $segments, $platform)
116		{
117	97	if (empty($segments)) {
118	7	return false;
119		}
120	93	if ($segments[0] === '') {
121	23	return true;
122		}
123	75	if ($platform === static::PLATFORM_UNIX) {
124	47	return false;
125		}
126	28	return strpos($segments[0], ':') > 0;
127		}
128
129		/**
130		* Returns platform matching the separator. Exists for 100% coverage :P
131		*
132		* @param string $separator
133		* @return string
134		*/
135	31	public static function getPlatformBySeparator($separator)
136		{
137		switch ($separator) {
138	31	case '/':
139	30	return static::PLATFORM_UNIX;
140	2	case '\\':
141	1	return static::PLATFORM_WINDOWS;
142	1	default:
143	1	$format = 'Unknown directory separator %s';
144	1	throw new RuntimeException(sprintf($format, $separator));
145	1	}
146		}
147
148		/**
149		* Detects current platform.
150		*
151		* @return string
152		*/
153	30	public static function detectPlatform()
154		{
155	30	return static::getPlatformBySeparator(DIRECTORY_SEPARATOR);
156		}
157
158		/**
159		* Converts input into path. Throws runtime exception if that's not
160		* possible.
161		*
162		* @param Path\|string\|mixed $input
163		* @return Path\|null
164		*/
165	45	protected function tryAdapt($input)
166		{
167	45	if ($input instanceof Path) {
168	43	return $input;
169		}
170	3	if (is_object($input)) {
171	1	if (method_exists($input, '__toString')) {
172	1	$input = $input->__toString();
173	1	}
174	1	}
175	3	return is_string($input) ? static::parse($input) : null;
176		}
177
178		/**
179		* Converts input into path. Throws runtime exception if that's not
180		* possible.
181		*
182		* @param Path\|string $input
183		* @return Path
184		*/
185	35	protected function adapt($input)
186		{
187	35	$input = $this->tryAdapt($input);
188	35	if ($input === null) {
189	1	throw new RuntimeException('Invalid input provided');
190		}
191	34	return $input;
192		}
193
194		/**
195		* Creates new path, destroying as much empty ('') and dot-entries
196		* ('.', '..') as possible, so path 'node/./../leaf' will be truncated
197		* just to leaf, but 'node/../../leaf' would result in '../leaf'.
198		*
199		* @return Path
200		*/
201		public function normalize()
202		{
203		/**
204		* @param string[] $carrier
205		* @param string $segment
206		* @return string[]
207		*/
208	43	$reducer = function ($carrier, $segment) {
209	42	if ($segment === '' \|\| $segment === '.') {
210	6	return $carrier;
211		}
212	42	if ($segment === '..' && !empty($carrier) && end($carrier) !== '..') {
213	12	array_shift($carrier);
214	12	return $carrier;
215		}
216	42	$carrier[] = $segment;
217	42	return $carrier;
218	43	};
219	43	$copy = clone $this;
220		/** @var string[] $segments */
221	43	$segments = array_reduce($this->segments, $reducer, []);
222	43	$copy->segments = $segments;
223	43	return $copy;
224		}
225
226		/**
227		* Returns hierarchy branch from the topmost node (root, if present) down
228		* to current node, so `/a/b/c` will result in `/a`, ` /a/b` and `/a/b/c`,
229		* and `a/b` in `a` and `a/b`.
230		*
231		* @return Path[]
232		*/
233	5	public function enumerate()
234		{
235	5	$accumulator = [];
236	5	$results = [];
237	5	$normalized = $this->normalize();
238	5	foreach ($normalized->segments as $segment) {
239	5	$copy = clone $normalized;
240	5	$copy->segments = $accumulator;
241	5	$results[] = $copy;
242	5	$accumulator[] = $segment;
243	5	}
244	5	$results[] = $this;
245	5	return $results;
246		}
247
248		/**
249		* Returns iterator that will iterate hierarchy branch according to
250		* {@link #enumerate} rules.
251		*
252		* @return Iterator Iterator that emits Path instances.
253		*/
254	5	public function iterator()
255		{
256	5	return new ArrayIterator($this->enumerate());
257		}
258
259		/**
260		* Returns list of path parents, starting from the topmost one and going
261		* down one by one, similar to {@link #enumerate}.
262		*
263		* @return Path[]
264		*/
265	5	public function getParents()
266		{
267	5	$enumeration = $this->enumerate();
268	5	array_pop($enumeration);
269	5	return $enumeration;
270		}
271
272		/**
273		* @return bool
274		*/
275	17	public function isAbsolute()
276		{
277	17	return $this->root !== null;
278		}
279
280		/**
281		* @return bool
282		*/
283	9	public function isRelative()
284		{
285	9	return $this->root === null;
286		}
287
288		/**
289		* @return bool
290		*/
291	21	public function isRoot()
292		{
293	21	return $this->root !== null && empty($this->segments);
294		}
295
296		/**
297		* Returns true if $other is located on the same hierarchy branch higher
298		* that current path.
299		*
300		* If path schemes differ, or not both paths are relative/absolute, this
301		* method will instantly return false.
302		*
303		* @param Path\|string $other
304		* @return bool
305		*/
306	12	public function isDescendantOf($other)
307		{
308	12	$other = $this->adapt($other)->normalize();
309	12	$current = $this->normalize();
310	12	if ($current->scheme !== $other->scheme) {
311	1	return false;
312		}
313	11	if ($current->root !== $other->root) {
314	1	return false;
315		}
316	10	if (sizeof($current->segments) <= sizeof($other->segments)) {
317	9	return false;
318		}
319	9	$limit = sizeof($other->segments);
320	9	for ($i = 0; $i < $limit; $i++) {
321	6	if ($other->segments[$i] !== $current->segments[$i]) {
322	1	return false;
323		}
324	6	}
325	8	return true;
326		}
327
328		/**
329		* Returns true if $other is located on the same hierarchy branch deeper
330		* that current path.
331		*
332		* If path schemes differ, or not both paths are relative/absolute, this
333		* method will instantly return false.
334		*
335		* @param Path\|string $other
336		* @return bool
337		*/
338	11	public function isAncestorOf($other)
339		{
340	11	return $this->adapt($other)->isDescendantOf($this);
341		}
342
343		/**
344		* Returns true if $other is direct parent of current path.
345		*
346		* If path schemes differ, or not both paths are relative/absolute, this
347		* method will instantly return false.
348		*
349		* @param Path\|string $other
350		* @return bool
351		*/
352	13	public function isChildOf($other)
353		{
354	13	$other = $this->adapt($other)->normalize();
355	12	$current = $this->normalize();
356	12	if (sizeof($other->segments) !== sizeof($current->segments) - 1) {
357	11	return false;
358		}
359	9	return $current->isDescendantOf($other);
360		}
361
362		/**
363		* Returns true if $other is direct child of current path.
364		*
365		* If path schemes differ, or not both paths are relative/absolute, this
366		* method will instantly return false.
367		*
368		* @param Path\|string $other
369		* @return bool
370		*/
371	12	public function isParentOf($other)
372		{
373	12	return $this->adapt($other)->isChildOf($this);
374		}
375
376		/**
377		* Returns true if $other is located on the smae hierarchy level.
378		*
379		* If path schemes differ, or not both paths are relative/absolute, this
380		* method will instantly return false.
381		*
382		* @param Path\|string $other
383		* @return bool
384		*/
385	11	public function isSiblingOf($other)
386		{
387	11	$other = $this->adapt($other);
388	11	if ($other->isRoot()) {
389	1	return $this->isRoot() && $this->root === $other->root;
390		}
391	10	return $other->getParent()->isParentOf($this);
392		}
393
394		/**
395		* Returns direct parent of current path. In case of call on root node
396		* exception will be thrown.
397		*
398		* @return Path
399		*/
400	11	public function getParent()
401		{
402	11	if ($this->isRoot()) {
403	1	throw new RuntimeException('Root cannot have parent node');
404		}
405	10	$copy = clone $this;
406	10	$copy->segments[] = '..';
407	10	return $copy->normalize();
408		}
409
410		/**
411		* Resolves other path against current one (or, in other words, prepends
412		* current path to provided one). If provided path is absolute, it is
413		* returned as-is, otherwise it is appended to current one:
414		*
415		* /a/b resolve /c/d => /b/c
416		* /a/b resolve c/d => /a/b/c/d
417		* a/b resolve c/d => a/b/c/d
418		*
419		* @param Path\|string $other
420		*
421		* @return Path
422		*/
423	8	public function resolve($other)
424		{
425	8	$other = $this->adapt($other);
426	8	if ($other->isAbsolute()) {
427	4	return $other;
428		}
429	4	$copy = clone $this;
430	4	$copy->segments = array_merge($copy->segments, $other->segments);
431	4	return $copy;
432		}
433
434		/**
435		* Construct a relative path, trying to subtract current path from provided
436		* one (thus providing a path required to traverse from current one to
437		* provided one). If called with an absolute path against relative or vice
438		* versa, will return other path as is.
439		*
440		* @param Path\|string $other
441		*
442		* @return Path
443		*/
444	14	public function relativize($other)
445		{
446	14	$other = $this->adapt($other);
447	14	if ($other->root !== $this->root) {
448	4	return $other;
449		}
450	10	$current = $this->normalize();
451	10	$other = $other->normalize();
452	10	$counter = 0;
453	10	$count = sizeof($current->segments);
454	10	for ($i = 0; $i < $count; $i++) {
455	10	if (!isset($other->segments[$i])) {
456	2	break;
457		}
458	10	if ($current->segments[$i] !== $other->segments[$i]) {
459	4	break;
460		}
461	10	$counter++;
462	10	}
463		/** @var string[] $traversal */
464	10	$traversal = [];
465	10	if ($count - $counter > 0) {
466	6	$traversal = array_fill(0, $count - $counter, '..');
467	6	}
468		/** @var string[] $slice */
469	10	$slice = array_slice($other->segments, $counter);
470		/** @var string[] $segments */
471	10	$segments = array_merge($traversal, $slice);
472	10	$copy = clone $this;
473	10	$copy->root = null;
474	10	$copy->segments = $segments;
475	10	return $copy;
476		}
477
478		/**
479		* Lexicographically compares one path to another.
480		*
481		* @param Path\|string\|null $other
482		* @return int
483		*/
484	10	public function compareTo($other)
485		{
486	10	$other = $this->tryAdapt($other);
487	10	if ($other === null) {
488	1	return 1;
489		}
490	9	$other = $other->normalize();
491	9	$current = $this->normalize();
492	9	$schemes = $this->compareStrings($current->scheme, $other->scheme);
493	9	if ($schemes !== 0) {
494	1	return $schemes;
495		}
496	8	$roots = $this->compareStrings($current->root, $other->root);
497	8	if ($roots !== 0) {
498	1	return $roots;
499		}
500	7	$limit = max(sizeof($current->segments), sizeof($other->segments));
501	7	for ($i = 0; $i < $limit; $i++) {
502	7	if (!isset($current->segments[$i])) {
503	1	return -1;
504	7	} else if (!isset($other->segments[$i])) {
505	1	return 1;
506	7	} else if ($current->segments[$i] === $other->segments[$i]) {
507	7	continue;
508		}
509	2	return strcmp($current->segments[$i], $other->segments[$i]);
510		}
511	3	return 0;
512		}
513
514		/**
515		* Helper method for {@link #compareTo()}
516		*
517		* @param string\|null $left
518		* @param string\|null $right
519		* @return int
520		*/
521	9	protected function compareStrings($left, $right)
522		{
523	9	if ($left === null) {
524	8	return $right === null ? 0 : -1;
525		}
526	4	if ($right === null) {
527	2	return 1;
528		}
529	2	return strcmp($left, $right);
530		}
531
532		/**
533		* Compares current path to provided one and tells if they are equal.
534		*
535		* @param Path\|string\|null $other
536		* @return bool
537		*/
538	10	public function equals($other)
539		{
540	10	return $this->compareTo($other) === 0;
541		}
542
543		/**
544		* @return string\|null
545		*/
546	16	public function getScheme()
547		{
548	16	return $this->scheme;
549		}
550
551		/**
552		* @return string\|null
553		*/
554	16	public function getRoot()
555		{
556	16	return $this->root;
557		}
558
559		/**
560		* @return string[]
561		*/
562	18	public function getSegments()
563		{
564	18	return $this->segments;
565		}
566
567		/**
568		* @return string
569		*/
570	15	public function getSeparator()
571		{
572	15	return $this->separator;
573		}
574
575		/**
576		* @param string\|null $scheme
577		* @return Path
578		*/
579	1	public function withScheme($scheme)
580		{
581	1	$copy = clone ($this);
582	1	$copy->scheme = $scheme;
583	1	return $copy;
584		}
585
586		/**
587		* @return Path
588		*/
589	1	public function withoutScheme()
590		{
591	1	return $this->withScheme(null);
592		}
593
594		/**
595		* @param string $root
596		* @return Path
597		*/
598	1	public function withRoot($root)
599		{
600	1	$copy = clone $this;
601	1	$copy->root = $root;
602	1	return $copy;
603		}
604
605		/**
606		* @return Path
607		*/
608	1	public function withoutRoot()
609		{
610	1	return $this->withRoot(null);
611		}
612
613		/**
614		* Assembles string representation using provided separator.
615		*
616		* @param string $separator
617		* @return string
618		*/
619	42	protected function assemble($separator)
620		{
621	42	$builder = '';
622	42	if (!empty($this->scheme)) {
623	2	$builder .= $this->scheme . '://';
624	2	}
625	42	if ($this->root !== null) {
626	12	$builder .= $this->root . $separator;
627	12	}
628	42	return $builder . implode($separator, $this->segments);
629		}
630
631		/**
632		* Returns platform-independent representation.
633		*
634		* @return string
635		*/
636	42	public function __toString()
637		{
638	42	return $this->assemble(static::SEPARATOR);
639		}
640
641		/**
642		* Returns representation for target platform.
643		*
644		* @return string
645		*/
646	13	public function toPlatformString()
647		{
648	13	return $this->assemble($this->separator);
649		}
650		}
651

ama-team / pathetic

Push — master ( 5419b6...8a2b83 )

Path::resolve() A

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like