source-class-Com.Tecnick.Unicode.Bidi.StepL

It appears that you are using AdBlocking software. The cost of running this website is covered by advertisements. If you like it please feel free to a small amount of money to secure the future of this website.
  1:   2:   3:   4:   5:   6:   7:   8:   9:  10:  11:  12:  13:  14:  15:  16:  17:  18:  19:  20:  21:  22:  23:  24:  25:  26:  27:  28:  29:  30:  31:  32:  33:  34:  35:  36:  37:  38:  39:  40:  41:  42:  43:  44:  45:  46:  47:  48:  49:  50:  51:  52:  53:  54:  55:  56:  57:  58:  59:  60:  61:  62:  63:  64:  65:  66:  67:  68:  69:  70:  71:  72:  73:  74:  75:  76:  77:  78:  79:  80:  81:  82:  83:  84:  85:  86:  87:  88:  89:  90:  91:  92:  93:  94:  95:  96:  97:  98:  99: 100: 101: 102: 103: 104: 105: 106: 107: 108: 109: 110: 111: 112: 113: 114: 115: 116: 117: 118: 119: 120: 121: 122: 123: 124: 125: 126: 127: 128: 129: 130: 131: 132: 133: 134: 135: 136: 137: 138: 139: 140: 141: 142: 143: 144: 145: 146: 147: 148: 149: 150: 151: 152: 153: 154: 155: 156: 157: 158: 159: 160: 161: 162: 163: 164: 165: 166: 167: 168: 
<?php
/**
 * StepL.php
 *
 * @since       2011-05-23
 * @category    Library
 * @package     Unicode
 * @author      Nicola Asuni <info@tecnick.com>
 * @copyright   2011-2015 Nicola Asuni - Tecnick.com LTD
 * @license     http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
 * @link        https://github.com/tecnickcom/tc-lib-unicode
 *
 * This file is part of tc-lib-unicode software library.
 */

namespace Com\Tecnick\Unicode\Bidi;

use \Com\Tecnick\Unicode\Data\Mirror as UniMirror;
use \Com\Tecnick\Unicode\Data\Constant as UniConstant;

/**
 * Com\Tecnick\Unicode\Bidi\StepL
 *
 * @since       2015-07-13
 * @category    Library
 * @package     Unicode
 * @author      Nicola Asuni <info@tecnick.com>
 * @copyright   2011-2015 Nicola Asuni - Tecnick.com LTD
 * @license     http://www.gnu.org/copyleft/lesser.html GNU-LGPL v3 (see LICENSE.TXT)
 * @link        https://github.com/tecnickcom/tc-lib-unicode
 */
class StepL
{
    /**
     * Array of characters data to return
     *
     * @var array
     */
    protected $chardata = array();

    /**
     * Number of characters in $this->chardata
     *
     * @var int
     */
    protected $numchars = 0;

    /**
     * Paragraph embedding level
     *
     * @var int
     */
    protected $pel = 0;

    /**
     * Maximul level
     *
     * @var int
     */
    protected $maxlevel = 0;

    /**
     * L steps
     *
     * @param array $chardata Array of characters data
     * @param int   $pel      Paragraph embedding level
     */
    public function __construct($chardata, $pel, $maxlevel)
    {
        // reorder chars by their original position
        usort($chardata, function ($apos, $bpos) {
            return ($apos['pos'] - $bpos['pos']);
        });
        $this->chardata = $chardata;
        $this->numchars = count($this->chardata);
        $this->pel = $pel;
        $this->maxlevel = $maxlevel;
        $this->processL1();
        $this->processL2();
    }

    /**
     * Returns the processed array
     *
     * @return array
     */
    public function getChrData()
    {
        return $this->chardata;
    }

    /**
     * L1. On each line, reset the embedding level of the following characters to the paragraph embedding level:
     *     1. Segment separators,
     *     2. Paragraph separators,
     *     3. Any sequence of whitespace characters and/or isolate formatting characters (FSI, LRI, RLI, and PDI)
     *        preceding a segment separator or paragraph separator, and
     *     4. Any sequence of whitespace characters and/or isolate formatting characters (FSI, LRI, RLI, and PDI)
     *        at the end of the line.
     */
    protected function processL1()
    {
        for ($idx = 0; $idx < $this->numchars; ++$idx) {
            $this->processL1b($idx, $idx);
        }
    }

    /**
     * Internal L1 step
     *
     * @param int $idx Main character index
     * @param int $jdx Current index
     */
    protected function processL1b($idx, $jdx)
    {
        if ($jdx >= $this->numchars) {
            return;
        }
        if ((($this->chardata[$jdx]['otype'] == 'S') || ($this->chardata[$jdx]['otype'] == 'B'))
            || (($jdx == ($this->numchars - 1)) && ($this->chardata[$jdx]['otype'] == 'WS'))
        ) {
            $this->chardata[$idx]['level'] = $this->pel;
            return;
        } elseif (($this->chardata[$jdx]['otype'] != 'WS')
            && (($this->chardata[$idx]['char'] < UniConstant::LRI)
            || ($this->chardata[$idx]['char'] > UniConstant::PDI))
        ) {
            return $this->processL1b($idx, ($jdx + 1));
        }
    }

    /**
     * L2. From the highest level found in the text to the lowest odd level on each line,
     *     including intermediate levels not actually present in the text,
     *     reverse any contiguous sequence of characters that are at that level or higher.
     *     This rule reverses a progressively larger series of substrings.
     */
    protected function processL2()
    {
        for ($level = $this->maxlevel; $level > 0; --$level) {
            $ordered = array();
            $reversed = array();
            foreach ($this->chardata as $char) {
                if ($char['level'] >= $level) {
                    if (($char['type'] == 'R') && (isset(UniMirror::$uni[$char['char']]))) {
                        // L4. A character is depicted by a mirrored glyph if and only if
                        //     (a) the resolved directionality of that character is R, and
                        //     (b) the Bidi_Mirrored property value of that character is true.
                        $char['char'] = UniMirror::$uni[$char['char']];
                    }
                    $reversed[] = $char;
                } else {
                    if (!empty($reversed)) {
                        $ordered = array_merge($ordered, array_reverse($reversed));
                        $reversed = array();
                    }
                    $ordered[] = $char;
                }
            }
            if (!empty($reversed)) {
                $ordered = array_merge($ordered, array_reverse($reversed));
                $reversed = array();
            }
            $this->chardata = $ordered;
        }
    }
}
 

© 2004-2017 – Nicola Asuni - Tecnick.com - All rights reserved.
about - disclaimer - privacy