function getFirstLetter($text)
{
if (empty($text)) {
return '';
}
if (preg_match('/^[A-Za-z]/', $text)) {
return strtoupper($text[0]);
}
$pinyinMap = [
'A' => [-20319, -20284],
'B' => [-20283, -19776],
'C' => [-19775, -19219],
'D' => [-19218, -18711],
'E' => [-18710, -18527],
'F' => [-18526, -18240],
'G' => [-18239, -17923],
'H' => [-17922, -17418],
'J' => [-17417, -16475],
'K' => [-16474, -16213],
'L' => [-16212, -15641],
'M' => [-15640, -15166],
'N' => [-15165, -14923],
'O' => [-14922, -14915],
'P' => [-14914, -14631],
'Q' => [-14630, -14150],
'R' => [-14149, -14091],
'S' => [-14090, -13319],
'T' => [-13318, -12839],
'W' => [-12838, -12557],
'X' => [-12556, -11848],
'Y' => [-11847, -11056],
'Z' => [-11055, -10247],
];
$char = '';
$length = mb_strlen($text, 'UTF-8');
for ($i = 0; $i < $length; $i++) {
$str = mb_substr($text, $i, 1, 'UTF-8');
$s1 = iconv('UTF-8', 'gb2312', $str);
$s2 = iconv('gb2312', 'UTF-8', $s1);
$s = $s2 === $str ? $s1 : $str;
if (strlen($s) > 1) {
$asc = ord($s[0]) * 256 + ord($s[1]) - 65536;
foreach ($pinyinMap as $letter => $range) {
if ($asc >= $range[0] && $asc <= $range[1]) {
$char .= $letter;
break;
}
}
}
}
return $char;
}
323

被折叠的 条评论
为什么被折叠?



