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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2024 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "punct_table.h"
#include <kchashdb.h>
#include <kccachedb.h>
#include "kyotodb_utils.h"
using namespace kyotocabinet;
using namespace pinyin;
PunctTable::PunctTable() {
/* create in-memory db. */
m_db = new ProtoTreeDB;
check_result(m_db->open("-", BasicDB::OREADER|BasicDB::OWRITER|BasicDB::OCREATE));
m_entry = new PunctTableEntry;
}
void PunctTable::reset() {
if (m_db) {
m_db->synchronize();
m_db->close();
delete m_db;
m_db = NULL;
}
if (m_entry) {
delete m_entry;
m_entry = NULL;
}
}
/* attach method */
bool PunctTable::attach(const char * dbfile, guint32 flags) {
reset();
m_entry = new PunctTableEntry;
uint32_t mode = attach_options(flags);
if (!dbfile)
return false;
m_db = new TreeDB;
return m_db->open(dbfile, mode);
}
/* load_db/save_db method */
/* use in-memory DBM here, for better performance. */
bool PunctTable::load_db(const char * filename) {
reset();
m_entry = new PunctTableEntry;
/* create in-memory db. */
m_db = new ProtoTreeDB;
if (!m_db->open("-", BasicDB::OREADER|BasicDB::OWRITER|BasicDB::OCREATE))
return false;
if (!m_db->load_snapshot(filename, NULL))
return false;
#if 0
/* load db into memory. */
BasicDB * tmp_db = new TreeDB;
if (!tmp_db->open(filename, BasicDB::OREADER))
return false;
CopyVisitor visitor(m_db);
tmp_db->iterate(&visitor, false);
tmp_db->close();
delete tmp_db;
#endif
return true;
}
bool PunctTable::save_db(const char * new_filename) {
int ret = unlink(new_filename);
if ( ret != 0 && errno != ENOENT)
return false;
if (!m_db->dump_snapshot(new_filename, NULL))
return false;
#if 0
BasicDB * tmp_db = new TreeDB;
if (!tmp_db->open(new_filename, BasicDB::OWRITER|BasicDB::OCREATE))
return false;
CopyVisitor visitor(tmp_db);
m_db->iterate(&visitor, false);
tmp_db->synchronize();
tmp_db->close();
delete tmp_db;
#endif
return true;
}
bool PunctTable::load_entry(phrase_token_t index) {
if (NULL == m_db)
return false;
assert(NULL != m_entry);
m_entry->m_chunk.set_size(0);
const char * kbuf = (char *) &index;
const int32_t vsiz = m_db->check(kbuf, sizeof(phrase_token_t));
/* -1 on failure. */
if (-1 == vsiz || 0 == vsiz)
return true;
m_entry->m_chunk.set_size(vsiz);
/* m_chunk may re-allocate here. */
char * vbuf = (char *) m_entry->m_chunk.begin();
check_result(vsiz == m_db->get(kbuf, sizeof(phrase_token_t),
vbuf, vsiz));
return true;
}
bool PunctTable::store_entry(phrase_token_t index) {
if (NULL == m_db)
return false;
assert(NULL != m_entry);
const char * kbuf = (char *) &index;
char * vbuf = (char *) m_entry->m_chunk.begin();
int32_t vsiz = m_entry->m_chunk.size();
return m_db->set(kbuf, sizeof(phrase_token_t), vbuf, vsiz);
}
bool PunctTable::remove_all_punctuations(/* in */ phrase_token_t index) {
if (NULL == m_db)
return false;
const char * kbuf = (char *) &index;
return m_db->remove(kbuf, sizeof(phrase_token_t));
}
class KeyCollectVisitor : public DB::Visitor {
private:
GArray * m_items;
public:
KeyCollectVisitor(GArray * items) {
m_items = items;
}
virtual const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
assert(ksiz == sizeof(phrase_token_t));
const phrase_token_t * token = (phrase_token_t *) kbuf;
g_array_append_val(m_items, *token);
return NOP;
}
virtual const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp) {
/* assume no empty record. */
assert (FALSE);
return NOP;
}
};
bool PunctTable::get_all_items(/* out */ GArray * items) {
g_array_set_size(items, 0);
if ( !m_db )
return false;
KeyCollectVisitor visitor(items);
m_db->iterate(&visitor, false);
return true;
}
|
