Lepton\Routing\UrlResolver

Complexity

Total Complexity

5

Size/Duplication

Total Lines	54
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	match()	0	5	2
A	patternMatch()	0	15	1
A	__construct()	0	1	1
A	patternPrepare()	0	23	1

<?php

namespace Lepton\Routing;

class UrlResolver
{

    public function __construct(private $pattern){}

    public function patternPrepare($pattern)
    {
        $pattern = str_replace('?', '\?', $pattern);

        // if the type selector is not followed by a quantifier, than choose any length
        $pattern = preg_replace('/<([^{\d}]+?)(?!{[\d]+}):(.+?)>/', '<${1}+:${2}>', $pattern);

        // if the type selector is "int", match numbers
        $pattern = preg_replace('/<int([+{\d}]+?):(.+?)>/', '<\\d${1}:${2}>', $pattern);

        // if the type selector is "alpha" or "alnum"
        $pattern = preg_replace('/<(alpha|alnum)([+{\d}]+?):(.+?)>/', '<[[:${1}:]]${2}:${3}>', $pattern);

        // if there is no type selector, match anything but a /
        $pattern = preg_replace('/<([^:]+?)>/', '(?<${1}>[^/]+)', $pattern);

        // build regex
        $pattern = preg_replace('/<(.+?):(.+?)>/', '(?<${2}>${1})', $pattern);

        // replace slashes for regex
        $pattern = str_replace('/', '\/', $pattern);

        return $pattern;

    }


    protected function patternMatch($pattern, &$parameters)
    {
        $parameters = array();


        $pattern = $this->patternPrepare($pattern);

        // perform actual match on request uri
        $is_match = preg_match(sprintf("/^%s$/", $pattern), $_SERVER['REQUEST_URI'], $parameters);

        // keep only string keys
        $parameters = array_filter($parameters, function ($k) {
            return is_string($k);
        }, ARRAY_FILTER_USE_KEY);
        return $is_match;
    }

    public function match($pattern): bool|array
    {
        $parameters = array();

        return $this->patternMatch($pattern, $parameters) ? $parameters : false;



    }
}