PHP CharsetConverter::substr方法代码示例

 /**
  * Encodes a string for JavaScript.
  *
  * @param string $input The string to encode, may be empty.
  * @return string The encoded string.
  */
 public function encode($input)
 {
     $stringLength = $this->charsetConversion->strlen('utf-8', $input);
     $encodedString = '';
     for ($i = 0; $i < $stringLength; $i++) {
         $c = $this->charsetConversion->substr('utf-8', $input, $i, 1);
         $encodedString .= $this->encodeCharacter($c);
     }
     return $encodedString;
 }

 /**
  * Add word to word-array
  * This function should be used to make sure CJK sequences are split up in the right way
  *
  * @param array $words Array of accumulated words
  * @param string $wordString Complete Input string from where to extract word
  * @param int $start Start position of word in input string
  * @param int $len The Length of the word string from start position
  * @return void
  */
 public function addWords(&$words, &$wordString, $start, $len)
 {
     // Get word out of string:
     $theWord = substr($wordString, $start, $len);
     // Get next chars unicode number and find type:
     $bc = 0;
     $cp = $this->utf8_ord($theWord, $bc);
     list($cType) = $this->charType($cp);
     // If string is a CJK sequence we follow this algorithm:
     /*
             DESCRIPTION OF (CJK) ALGORITHMContinuous letters and numbers make up words. Spaces and symbols
             separate letters and numbers into words. This is sufficient for
             all western text.CJK doesn't use spaces or separators to separate words, so the only
             way to really find out what constitutes a word would be to have a
             dictionary and advanced heuristics. Instead, we form pairs from
             consecutive characters, in such a way that searches will find only
             characters that appear more-or-less the right sequence. For example:ABCDE => AB BC CD DEThis works okay since both the index and the search query is split
             in the same manner, and since the set of characters is huge so the
             extra matches are not significant.(Hint taken from ZOPEs chinese user group)[Kasper: As far as I can see this will only work well with or-searches!]
     */
     if ($cType == 'cjk') {
         // Find total string length:
         $strlen = $this->csObj->strlen('utf-8', $theWord);
         // Traverse string length and add words as pairs of two chars:
         for ($a = 0; $a < $strlen; $a++) {
             if ($strlen == 1 || $a < $strlen - 1) {
                 $words[] = $this->csObj->substr('utf-8', $theWord, $a, 2);
             }
         }
     } else {
         // Normal "single-byte" chars:
         // Remove chars:
         foreach ($this->lexerConf['removeChars'] as $skipJoin) {
             $theWord = str_replace($this->csObj->UnumberToChar($skipJoin), '', $theWord);
         }
         // Add word:
         $words[] = $theWord;
     }
 }

 /**
  * @test
  * @see http://forge.typo3.org/issues/22334
  */
 public function substrForEmptyStringAndNonZeroLengthReturnsEmptyString()
 {
     $this->assertSame('', $this->subject->substr('utf-8', '', 0, 42));
 }