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
|
/*
* Copyright (C) 2023, KylinSoft Co., Ltd.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*
**/
#include "pinyin.h"
#include <QFile>
#include <QTextStream>
static QHash<uint, QString> dict = {};
const char kDictFile[] = ":/dpinyin.dict";
static void InitDict() {
if (!dict.isEmpty()) {
return;
}
dict.reserve(25333);
QFile file(kDictFile);
if (!file.open(QIODevice::ReadOnly))
return;
QByteArray content = file.readAll();
file.close();
QTextStream stream(&content, QIODevice::ReadOnly);
while (!stream.atEnd()) {
const QString line = stream.readLine();
const QStringList items = line.split(QChar(':'));
if (items.size() == 2) {
dict.insert(items[0].toInt(nullptr, 16), items[1]);
}
}
}
QString Chinese2Pinyin(const QString &words)
{
InitDict();
QString result;
for (int i = 0; i < words.length(); ++i) {
const uint key = words.at(i).unicode();
auto find_result = dict.find(key);
if (find_result != dict.end()) {
result.append(find_result.value());
} else {
result.append(words.at(i));
}
}
return result;
}
|
