blob: 9079c24b0127dd131daf94a8c8dce1e9c1204809 (
plain)
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
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2017 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 PHONETIC_LOOKUP_LINEAR_H
#define PHONETIC_LOOKUP_LINEAR_H
template <gint32 nbest>
struct trellis_node {
private:
gint32 m_nelem;
trellis_value_t m_elements[nbest];
public:
trellis_node(){
m_nelem = 0;
/* always assume non-used m_elements contains random data. */
}
public:
gint32 length() { return m_nelem; }
const trellis_value_t * begin() { return m_elements; }
const trellis_value_t * end() { return m_elements + m_nelem; }
bool number() {
for (ssize_t i = 0; i < m_nelem; ++i)
m_elements[i].m_current_index = i;
}
/* return true if the item is stored into m_elements. */
bool eval_item(const trellis_value_t * item) {
/* still have space */
if (m_nelem < nbest) {
m_elements[m_nelem] = *item;
m_nelem ++;
return true;
}
/* find minium item */
trellis_value_t * min = m_elements;
for (gint32 i = 1; i < m_nelem; ++i) {
if (min->m_poss > m_elements[i].m_poss)
min = m_elements + i;
}
/* compare new item */
if (item->m_poss > min->m_poss) {
*min = *item;
return true;
}
return false;
}
};
#endif
|