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
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2016 Peng Wu <alexepico@gmail.com>
*
* 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 2 of the License, 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef PHONETIC_KEY_MATRIX_H
#define PHONETIC_KEY_MATRIX_H
#include <assert.h>
#include "novel_types.h"
#include "chewing_key.h"
namespace pinyin {
template<typename Item>
class PhoneticTable {
protected:
/* Pointer Array of Array of Item. */
GPtrArray * m_table_content;
public:
bool clear_all() {
for (size_t i = 0; i < m_table_content->len; ++i) {
GArray * column = (GArray *)
g_ptr_array_index(m_table_content, i);
g_array_free(column, TRUE);
}
g_ptr_array_set_size(m_table_content, 0);
return true;
}
bool size() {
return m_table_content->len;
}
/* when call this function,
reserve one extra slot for the end slot. */
bool set_size(size_t size) {
clear_all();
g_ptr_array_set_size(m_table_content, size);
for (size_t i = 0; i < m_table_content->len; ++i) {
g_ptr_array_index(m_table_content, i) =
g_array_new(TRUE, TRUE, sizeof(Item));
}
return true;
}
/* Array of Item. */
bool get_items(size_t index, GArray * items) {
g_array_set_size(items, 0);
if (index >= m_table_content->len)
return false;
GArray * column = (GArray *)
g_ptr_array_index(m_table_content, index);
g_array_append_vals(items, column->data, column->len);
return true;
}
bool append(size_t index, const Item & item) {
if (index >= m_table_content->len)
return false;
GArray * column = (GArray *)
g_ptr_array_index(m_table_content, index);
g_array_append_val(column, item);
return true;
}
};
class PhoneticKeyMatrix {
protected:
PhoneticTable<ChewingKey> m_keys;
PhoneticTable<ChewingKeyRest> m_key_rests;
public:
bool clear_all() {
return m_keys.clear_all() && m_key_rests.clear_all();
}
bool size() {
assert(m_keys.size() == m_key_rests.size());
return m_keys.size();
}
/* reserve one extra slot, same as PhoneticTable. */
bool set_size(size_t size) {
return m_keys.set_size(size) && m_key_rests.set_size(size);
}
/* Array of keys and key rests. */
bool get_items(size_t index, GArray * keys, GArray * key_rests) {
return m_keys.get_items(index, keys) &&
m_key_rests.get_items(index, key_rests);
}
bool append(size_t index, const ChewingKey & key,
const ChewingKeyRest & key_rest) {
return m_keys.append(index, key) &&
m_key_rests.append(index, key_rest);
}
};
bool fill_phonetic_key_matrix_from_chewing_keys(PhoneticKeyMatrix * matrix,
ChewingKeyVector keys,
ChewingKeyRestVector key_rests);
bool dump_phonetic_key_matrix(PhoneticKeyMatrix * matrix);
};
#endif
|
