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
|
/*
* 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 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/>.
*/
#ifndef CHEWING_LARGE_TABLE2_KYOTODB_H
#define CHEWING_LARGE_TABLE2_KYOTODB_H
#include "novel_types.h"
#include "memory_chunk.h"
#include <stdio.h>
#include <kcdb.h>
#include "table_info.h"
namespace pinyin{
template<int phrase_length>
class ChewingTableEntry;
class ChewingLargeTable2{
private:
/* member variables. */
kyotocabinet::BasicDB * m_db;
protected:
/* Array of ChewingTableEntry. */
GPtrArray * m_entries;
void init_entries();
void fini_entries();
void reset();
protected:
template<int phrase_length>
int search_internal(/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* out */ PhraseIndexRanges ranges) const;
int search_internal(int phrase_length,
/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* out */ PhraseIndexRanges ranges) const;
template<int phrase_length>
int add_index_internal(/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
int add_index_internal(int phrase_length,
/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
template<int phrase_length>
int remove_index_internal(/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
int remove_index_internal(int phrase_length,
/* in */ const ChewingKey index[],
/* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
public:
ChewingLargeTable2();
~ChewingLargeTable2() {
reset();
}
/* attach method */
bool attach(const char * dbfile, guint32 flags);
bool sync() {
assert(NULL != m_db);
m_db->synchronize();
return true;
}
#if 0
/* load/store method */
/* use in-memory DBM here, for better performance. */
bool load_db(const char * filename);
bool store_db(const char * new_filename);
#endif
bool load_text(FILE * infile, TABLE_PHONETIC_TYPE type);
/* search method */
int search(int phrase_length, /* in */ const ChewingKey keys[],
/* out */ PhraseIndexRanges ranges) const;
/* add/remove index method */
int add_index(int phrase_length, /* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
int remove_index(int phrase_length, /* in */ const ChewingKey keys[],
/* in */ phrase_token_t token);
/* mask out method */
bool mask_out(phrase_token_t mask, phrase_token_t value);
};
};
#endif
|
