ꦫꦣꦺꦤ꧀ꦄꦤ꧀ꦠꦱꦺꦤ

PATH: home / lab2454c / crypto.keyreum.com / vendor / fakerphp / faker / src / Faker / Provider

<?php

namespace Faker\Provider;

abstract class Text extends Base
{
    protected static $baseText = '';
    protected static $separator = ' ';
    protected static $separatorLen = 1;
    protected $explodedText;
    protected $consecutiveWords = [];
    protected static $textStartsWithUppercase = true;

/**
     * Generate a text string by the Markov chain algorithm.
     *
     * Depending on the $maxNbChars, returns a random valid looking text. The algorithm
     * generates a weighted table with the specified number of words as the index and the
     * possible following words as the value.
     *
     * @example 'Alice, swallowing down her flamingo, and began by taking the little golden key'
     *
     * @param int $maxNbChars Maximum number of characters the text should contain (minimum: 10)
     * @param int $indexSize  Determines how many words are considered for the generation of the next word.
     *                        The minimum is 1, and it produces a higher level of randomness, although the
     *                        generated text usually doesn't make sense. Higher index sizes (up to 5)
     *                        produce more correct text, at the price of less randomness.
     *
     * @return string
     */
    public function realText($maxNbChars = 200, $indexSize = 2)
    {
        return $this->realTextBetween((int) round($maxNbChars * 0.8), $maxNbChars, $indexSize);
    }

/**
     * Generate a text string by the Markov chain algorithm.
     *
     * Depending on the $maxNbChars, returns a random valid looking text. The algorithm
     * generates a weighted table with the specified number of words as the index and the
     * possible following words as the value.
     *
     * @example 'Alice, swallowing down her flamingo, and began by taking the little golden key'
     *
     * @param int $minNbChars Minimum number of characters the text should contain (maximum: 8)
     * @param int $maxNbChars Maximum number of characters the text should contain (minimum: 10)
     * @param int $indexSize  Determines how many words are considered for the generation of the next word.
     *                        The minimum is 1, and it produces a higher level of randomness, although the
     *                        generated text usually doesn't make sense. Higher index sizes (up to 5)
     *                        produce more correct text, at the price of less randomness.
     *
     * @return string
     */
    public function realTextBetween($minNbChars = 160, $maxNbChars = 200, $indexSize = 2)
    {
        if ($minNbChars < 1) {
            throw new \InvalidArgumentException('minNbChars must be at least 1');
        }

if ($maxNbChars < 10) {
            throw new \InvalidArgumentException('maxNbChars must be at least 10');
        }

if ($indexSize < 1) {
            throw new \InvalidArgumentException('indexSize must be at least 1');
        }

if ($indexSize > 5) {
            throw new \InvalidArgumentException('indexSize must be at most 5');
        }

if ($minNbChars >= $maxNbChars) {
            throw new \InvalidArgumentException('minNbChars must be smaller than maxNbChars');
        }

$words = $this->getConsecutiveWords($indexSize);
        $iterations = 0;

do {
            ++$iterations;

if ($iterations >= 100) {
                throw new \OverflowException(sprintf('Maximum retries of %d reached without finding a valid real text', $iterations));
            }

$result = $this->generateText($maxNbChars, $words);
        } while (static::strlen($result) <= $minNbChars);

return $result;
    }

/**
     * @param int   $maxNbChars
     * @param array $words
     *
     * @return string
     */
    protected function generateText($maxNbChars, $words)
    {
        $result = [];
        $resultLength = 0;
        // take a random starting point
        $next = static::randomKey($words);

while ($resultLength < $maxNbChars && isset($words[$next])) {
            // fetch a random word to append
            $word = static::randomElement($words[$next]);

// calculate next index
            $currentWords = static::explode($next);
            $currentWords[] = $word;
            array_shift($currentWords);
            $next = static::implode($currentWords);

// ensure text starts with an uppercase letter
            if ($resultLength == 0 && !static::validStart($word)) {
                continue;
            }

// append the element
            $result[] = $word;
            $resultLength += static::strlen($word) + static::$separatorLen;
        }

// remove the element that caused the text to overflow
        array_pop($result);

// build result
        $result = static::implode($result);

return static::appendEnd($result);
    }

protected function getConsecutiveWords($indexSize)
    {
        if (!isset($this->consecutiveWords[$indexSize])) {
            $parts = $this->getExplodedText();
            $words = [];
            $index = [];

for ($i = 0; $i < $indexSize; ++$i) {
                $index[] = array_shift($parts);
            }

for ($i = 0, $count = count($parts); $i < $count; ++$i) {
                $stringIndex = static::implode($index);

if (!isset($words[$stringIndex])) {
                    $words[$stringIndex] = [];
                }
                $word = $parts[$i];
                $words[$stringIndex][] = $word;
                array_shift($index);
                $index[] = $word;
            }
            // cache look up words for performance
            $this->consecutiveWords[$indexSize] = $words;
        }

return $this->consecutiveWords[$indexSize];
    }

protected function getExplodedText()
    {
        if ($this->explodedText === null) {
            $this->explodedText = static::explode(preg_replace('/\s+/u', ' ', static::$baseText));
        }

return $this->explodedText;
    }

protected static function explode($text)
    {
        return explode(static::$separator, $text);
    }

protected static function implode($words)
    {
        return implode(static::$separator, $words);
    }

protected static function strlen($text)
    {
        return function_exists('mb_strlen') ? mb_strlen($text, 'UTF-8') : strlen($text);
    }

protected static function validStart($word)
    {
        $isValid = true;

if (static::$textStartsWithUppercase) {
            $isValid = preg_match('/^\p{Lu}/u', $word);
        }

return $isValid;
    }

protected static function appendEnd($text)
    {
        return preg_replace("/([ ,-:;\x{2013}\x{2014}]+$)/us", '', $text) . '.';
    }
}

[-] UserAgent.php [edit]
[+] tr_TR
[+] bg_BG
[+] nb_NO
[+] ja_JP
[+] sr_Latn_RS
[+] it_IT
[+] bn_BD
[+] en_NG
[-] Internet.php [edit]
[-] File.php [edit]
[+] sk_SK
[+] is_IS
[+] fi_FI
[+] en_PH
[+] kk_KZ
[+] sl_SI
[-] Miscellaneous.php [edit]
[+] ..
[+] et_EE
[+] id_ID
[+] pl_PL
[-] Address.php [edit]
[+] en_IN
[-] Color.php [edit]
[+] lt_LT
[+] en_GB
[+] ru_RU
[-] Company.php [edit]
[+] th_TH
[+] fa_IR
[+] ko_KR
[+] ka_GE
[+] hr_HR
[+] en_US
[+] nl_BE
[+] de_CH
[-] Lorem.php [edit]
[+] sr_RS
[-] Biased.php [edit]
[+] he_IL
[+] vi_VN
[+] pt_PT
[-] Image.php [edit]
[+] ar_JO
[+] uk_UA
[+] cs_CZ
[+] en_UG
[+] it_CH
[-] Medical.php [edit]
[+] ms_MY
[+] hy_AM
[-] Person.php [edit]
[+] de_AT
[+] zh_CN
[+] en_ZA
[-] Barcode.php [edit]
[+] fr_BE
[+] hu_HU
[-] HtmlLorem.php [edit]
[+] en_NZ
[+] ar_SA
[+] sv_SE
[+] en_AU
[+] lv_LV
[+] ro_RO
[+] en_CA
[+] sr_Cyrl_RS
[-] Text.php [edit]
[+] el_CY
[+] es_VE
[+] me_ME
[+] en_SG
[+] fr_CA
[-] DateTime.php [edit]
[+] en_HK
[-] Base.php [edit]
[+] ro_MD
[+] at_AT
[+] mn_MN
[+] da_DK
[-] Payment.php [edit]
[+] pt_BR
[-] PhoneNumber.php [edit]
[+] nl_NL
[+] es_PE
[+] ne_NP
[-] Uuid.php [edit]
[+] es_ES
[+] de_DE
[+] zh_TW
[+] fr_CH
[+] fr_FR
[+] el_GR
[+] es_AR