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
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2012 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 "pinyin_lookup2.h"
#include "stl_lite.h"
using namespace pinyin;
/* internal definition */
static const size_t nbeam = 32;
static bool dump_max_value(GPtrArray * values){
if (0 == values->len)
return false;
const lookup_value_t * max =
(const lookup_value_t *) g_ptr_array_index(values, 0);
for (size_t i = 1; i < values->len; ++i) {
const lookup_value_t * cur =
(const lookup_value_t *) g_ptr_array_index(values, i);
if (cur->m_poss > max->m_poss)
max = cur;
}
printf("max value: %f\n", max->m_poss);
return true;
}
static bool dump_all_values(GPtrArray * values) {
if (0 == values->len)
return false;
printf("values:");
for (size_t i = 0; i < values->len; ++i) {
const lookup_value_t * cur =
(const lookup_value_t *) g_ptr_array_index(values, i);
printf("%f\t", cur->m_poss);
}
printf("\n");
return true;
}
/* populate the candidates. */
static bool populate_candidates(/* out */ GPtrArray * candidates,
/* in */ LookupStepContent step) {
g_ptr_array_set_size(candidates, 0);
if (0 == step->len)
return false;
for (size_t i = 0; i < step->len; ++i) {
lookup_value_t * value = &g_array_index
(step, lookup_value_t, i);
g_ptr_array_add(candidates, value);
}
dump_max_value(candidates);
return true;
}
static bool lookup_value_less_than(lookup_value_t * lhs, lookup_value_t * rhs){
return lhs->m_poss < rhs->m_poss;
}
/* use maximum heap to get the topest results. */
static bool get_top_results(/* out */ GPtrArray * topresults,
/* in */ GPtrArray * candidates) {
g_ptr_array_set_size(topresults, 0);
if (0 == candidates->len)
return false;
lookup_value_t ** begin =
(lookup_value_t **) &g_ptr_array_index(candidates, 0);
lookup_value_t ** end =
(lookup_value_t **) &g_ptr_array_index(candidates, candidates->len);
std_lite::make_heap(begin, end, lookup_value_less_than);
while (end != begin) {
lookup_value_t * one = *begin;
g_ptr_array_add(topresults, one);
std_lite::pop_heap(begin, end, lookup_value_less_than);
--end;
if (topresults->len >= nbeam)
break;
}
dump_all_values(topresults);
return true;
}
|
