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
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2010 Peng Wu
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <assert.h>
#include <string.h>
#include "phrase_large_table.h"
template<size_t phrase_length>
struct PhraseIndexItem{
phrase_token_t m_token;
utf16_t m_phrase[phrase_length];
public:
PhraseIndexItem<phrase_length>(utf16_t phrase[], phrase_token_t token){
memmove(m_phrase, phrase, sizeof(utf16_t) * phrase_length);
m_token = token;
}
};
template<size_t phrase_length>
static int phrase_compare(const PhraseIndexItem<phrase_length> &lhs,
const PhraseIndexItem<phrase_length> &rhs){
utf16_t * phrase_lhs = (utf16_t *) lhs.m_phrase;
utf16_t * phrase_rhs = (utf16_t *) rhs.m_phrase;
return memcmp(phrase_lhs, phrase_rhs, sizeof(utf16_t) * phrase_length);
}
template<size_t phrase_length>
static bool phrase_less_than(const PhraseIndexItem<phrase_length> & lhs,
const PhraseIndexItem<phrase_length> & rhs){
return 0 > phrase_compare(lhs, rhs);
}
PhraseBitmapIndexLevel::PhraseBitmapIndexLevel(){
memset(m_phrase_length_indexes, 0, sizeof(m_phrase_length_indexes));
}
void PhraseBitmapIndexLevel::reset(){
for ( size_t i = 0; i < PHRASE_Number_Of_Bitmap_Index; i++){
PhraseLengthIndexLevel * length_array =
m_phrase_length_indexes[i];
if ( length_array )
delete length_array;
}
}
int PhraseBitmapIndexLevel::search( int phrase_length, /* in */ utf16_t phrase[], /* out */ phrase_token_t & token){
assert(phrase_length > 0);
int result = SEARCH_NONE;
utf16_t first_key = phrase[0];
PhraseLengthIndexLevel * phrase_array = m_phrase_length_indexes[first_key];
if ( phrase_array )
return phrase_array->search(phrase_length - 1, phrase + 1, token);
return result;
}
PhraseLengthIndexLevel::PhraseLengthIndexLevel(){
m_phrase_array_indexes = g_array_new(FALSE, TRUE, sizeof(void *));
}
PhraseLengthIndexLevel::~PhraseLengthIndexLevel(){
#define CASE(x) case x: \
{ \
PhraseArrayIndexLevel<x> * array = g_array_index \
(m_phrase_array_indexes, PhraseArrayIndexLevel<x> *, x); \
if ( array ) \
delete array; \
break; \
}
for ( size_t i = 0 ; i < m_phrase_array_indexes->len; ++i){
switch (i){
CASE(0);
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);
default:
assert(false);
}
}
g_array_free(m_phrase_array_indexes, TRUE);
#undef CASE
}
int PhraseLengthIndexLevel::search(int phrase_length,
/* in */ utf16_t phrase[],
/* out */ phrase_token_t & token){
int result = SEARCH_NONE;
if(m_phrase_array_indexes->len < phrase_length + 1)
return result;
if (m_phrase_array_indexes->len > phrase_length + 1)
result |= SEARCH_CONTINUED;
#define CASE(len) case len: \
{ \
PhraseArrayIndexLevel<len> * array = g_array_index \
(m_phrase_array_indexes, PhraseArrayIndexLevel<len> *, len); \
if ( !array ) \
return result; \
result |= array->search(phrase, token); \
return result; \
}
switch ( phrase_length ){
CASE(0);
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);
default:
assert(false);
}
#undef CASE
}
template<size_t phrase_length>
int PhraseArrayIndexLevel<phrase_length>::search(/* in */ utf16_t phrase[], /* out */ phrase_token_t & token){
PhraseIndexItem<phrase_length> * chunk_begin, * chunk_end;
chunk_begin = (PhraseIndexItem<phrase_length> *)m_chunk.begin();
chunk_end = (PhraseIndexItem<phrase_length> *)m_chunk.end();
PhraseIndexItem<phrase_length> search_elem(phrase, -1);
//do the search
std_lite::pair<PhraseIndexItem<phrase_length> *, PhraseIndexItem<phrase_length> *> range;
range = std_lite::equal_range(chunk_begin, chunk_end, search_elem, phrase_less_than<phrase_length>);
if ( range.first == range.second )
return SEARCH_NONE;
assert(range.second - range.first == 1);
return SEARCH_OK;
}
|
