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
|
/*
* 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.
*/
#include "chewing_large_table2.h"
#include <kchashdb.h>
#include <kcprotodb.h>
#include "kyotodb_utils.h"
using namespace kyotocabinet;
namespace pinyin{
ChewingLargeTable2::ChewingLargeTable2() {
/* create in-memory db. */
m_db = new ProtoTreeDB;
assert(m_db->open("-", BasicDB::OREADER|BasicDB::OWRITER|BasicDB::OCREATE));
init_entries();
}
void ChewingLargeTable2::reset() {
if (m_db) {
m_db->synchronize();
m_db->close();
delete m_db;
m_db = NULL;
}
fini_entries();
}
/* attach method */
bool ChewingLargeTable2::attach(const char * dbfile, guint32 flags) {
reset();
uint32_t mode = attach_options(flags);
if (!dbfile)
return false;
m_db = new TreeDB;
init_entries();
return m_db->open(dbfile, mode);
}
/* load/store method */
/* use in-memory DBM here, for better performance. */
bool ChewingLargeTable2::load_db(const char * filename) {
reset();
/* create in-memory db. */
m_db = new ProtoTreeDB;
if (!m_db->open("-", BasicDB::OREADER|BasicDB::OWRITER|BasicDB::OCREATE))
return false;
/* 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;
init_entries();
return true;
}
bool ChewingLargeTable2::store_db(const char * new_filename) {
int ret = unlink(new_filename);
if ( ret != 0 && errno != ENOENT)
return false;
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;
return true;
}
template<int phrase_length>
int ChewingLargeTable2::search_internal(/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* out */ PhraseIndexRanges ranges) const {
int result = SEARCH_NONE;
ChewingTableEntry<phrase_length> * entry =
(ChewingTableEntry<phrase_length> *)
g_ptr_array_index(m_entries, phrase_length);
assert(NULL != entry);
const char * kbuf = (char *) index;
const int32_t vsiz = m_db->check(kbuf, phrase_length * sizeof(ChewingKey));
/* -1 on failure. */
if (-1 == vsiz)
return result;
/* continue searching. */
result |= SEARCH_CONTINUED;
if (0 == vsiz)
return result;
entry->m_chunk.set_size(vsiz);
/* m_chunk may re-allocate here. */
char * vbuf = (char *) entry->m_chunk.begin();
assert(vsiz == m_db->get(kbuf, phrase_length * sizeof(ChewingKey),
vbuf, vsiz));
result = entry->search(keys, ranges) | result;
return result;
}
int ChewingLargeTable2::search_internal(int phrase_length,
/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* out */ PhraseIndexRanges ranges) const {
#define CASE(len) case len: \
{ \
return search_internal<len>(index, keys, ranges); \
}
switch(phrase_length) {
CASE(1);
CASE(2);
CASE(3);
CASE(4);
CASE(5);
CASE(6);
CASE(7);
CASE(8);
CASE(9);
CASE(10);
CASE(11);
CASE(12);
CASE(13);
CASE(14);
CASE(15);
CASE(16);
default:
assert(false);
}
#undef CASE
return SEARCH_NONE;
}
};
|
