blob: 30336b99a3eb672ebe4d38d0397e4a94befd8140 (
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
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
|
/*
* 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_HEAP_H
#define PHONETIC_LOOKUP_HEAP_H
template <gint32 nbest>
struct trellis_node {
private:
gint32 m_nelem;
trellis_value_t m_elements[nbest+1];
public:
... // helper methods
};
/* for space usage and performance. */
/* as trellis node only contains one element,
* when the trellis node created, always put one element in it.
* when no trellis node, it represents zero element.
*/
template <>
struct trellis_node <1> {
private:
trellis_value_t m_element;
public:
trellis_node <1> () : m_element(-FLT_MAX) {}
public:
gint32 length() { return 1; }
const trellis_value_t * begin() { return &m_element; }
const trellis_value_t * end() { return &m_element + 1; }
/* return true if the item is stored into m_element. */
bool eval_item(const trellis_value_t * item) {
if (item->m_poss > m_element.m_poss) {
m_element = *item;
return true;
}
return false;
}
};
template <gint32 nbest>
struct matrix_step {
private:
gint32 m_nelem;
matrix_value_t m_elements[nbest+1];
public:
... // helper methods
};
/* for space usage and performance. */
/* as matrix step contains only one element,
initialize with empty element. */
template <>
struct matrix_step <1> {
private:
matrix_value_t m_element;
public:
matrix_step <1> () : m_element(-FLT_MAX) {}
public:
gint32 length() { return 1; }
const matrix_value_t * begin() { return &m_element; }
const matrix_value_t * end() { return &m_element + 1; }
/* return true if the item is stored into m_element. */
bool eval_item(const matrix_value_t * item) {
if (item->m_poss > m_element.m_poss) {
m_element = *item;
return true;
}
return false;
}
};
#endif
|
