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
|
#include <stdio.h>
#include "pinyin.h"
int main(int argc, char * argv[]){
SingleGram single_gram;
const guint32 total_freq = 16;
assert(single_gram.set_total_freq(total_freq));
phrase_token_t tokens[6] = { 2, 6, 4, 3, 1, 3};
guint32 freqs[6] = { 1, 2, 4, 8, 16, 32};
for(size_t i = 0; i < 6 ;++i){
single_gram.set_freq(tokens[i], freqs[i]);
}
guint32 freq;
single_gram.get_freq(3, freq);
assert(freq == 32);
printf("--------------------------------------------------------\n");
PhraseIndexRange range;
BigramPhraseArray array = g_array_new(FALSE, FALSE, sizeof(BigramPhraseItem));
range.m_range_begin = 0; range.m_range_end = 8;
single_gram.search(&range,array);
for ( size_t i = 0; i < array->len; ++i){
BigramPhraseItem * item = &g_array_index(array, BigramPhraseItem, i);
printf("item:%d:%f\n", item->m_token, item->m_freq);
}
assert(single_gram.get_total_freq(freq));
assert(freq == total_freq);
Bigram bigram;
assert(bigram.attach(NULL, "/tmp/system.db"));
bigram.store(1, &single_gram);
single_gram.set_freq(5, 8);
single_gram.set_total_freq(32);
bigram.store(2, &single_gram);
SingleGram * system, * user;
for ( int m = 1; m <= 2; ++m ){
printf("--------------------------------------------------------\n");
bigram.load(m, system, user);
assert(NULL == system);
g_array_set_size(array, 0);
range.m_range_begin = 0; range.m_range_end = 8;
user->search(&range,array);
for ( size_t i = 0; i < array->len; ++i){
BigramPhraseItem * item = &g_array_index(array, BigramPhraseItem, i);
printf("item:%d:%f\n", item->m_token, item->m_freq);
}
delete user;
}
bigram.attach("/tmp/system.db", NULL);
for ( int m = 1; m <=2; ++m ){
printf("--------------------------------------------------------\n");
bigram.load(m, system, user);
assert(NULL == user);
g_array_set_size(array, 0);
range.m_range_begin = 0; range.m_range_end = 8;
system->search(&range,array);
for ( size_t i = 0; i < array->len; ++i){
BigramPhraseItem * item = &g_array_index(array, BigramPhraseItem, i);
printf("item:%d:%f\n", item->m_token, item->m_freq);
}
delete system;
}
printf("--------------------------------------------------------\n");
single_gram.prune();
g_array_set_size(array, 0);
range.m_range_begin = 0; range.m_range_end = 8;
single_gram.search(&range,array);
for ( size_t i = 0; i < array->len; ++i){
BigramPhraseItem * item = &g_array_index(array, BigramPhraseItem, i);
printf("item:%d:%f\n", item->m_token, item->m_freq);
}
assert(single_gram.get_total_freq(freq));
printf("total_freq:%d\n", freq);
g_array_free(array, TRUE);
GArray * system_items = g_array_new(FALSE, FALSE, sizeof(phrase_token_t));
GArray * user_items = g_array_new(FALSE, FALSE, sizeof(phrase_token_t));
bigram.get_all_items(system_items, user_items);
printf("----------------------system----------------------------\n");
for ( size_t i = 0; i < system_items->len; ++i){
phrase_token_t * token = &g_array_index(system_items, phrase_token_t, i);
printf("item:%d\n", *token);
}
printf("-----------------------user-----------------------------\n");
for ( size_t i = 0; i < user_items->len; ++i){
phrase_token_t * token = &g_array_index(user_items, phrase_token_t, i);
printf("item:%d\n", *token);
}
}
|
