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
|
/*
* libpinyin
* Library to deal with pinyin.
*
* Copyright (C) 2006-2007 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 <stdio.h>
#include "pinyin.h"
//increase all unigram frequency by one.
int main(int argc, char * argv[]){
FacadePhraseIndex phrase_index;
//gb_char binary file
MemoryChunk * chunk = new MemoryChunk;
chunk->load("../../data/gb_char.bin");
phrase_index.load(1, chunk);
//gbk_char binary file
chunk = new MemoryChunk;
chunk->load("../../data/gbk_char.bin");
phrase_index.load(2, chunk);
PhraseIndexRange range;
int result = phrase_index.get_range(1, range);
if ( result == ERROR_OK ) {
for ( size_t i = range.m_range_begin; i <= range.m_range_end; ++i){
phrase_index.add_unigram_frequency(i, 1);
}
}
#if 0
int result = phrase_index.get_range(2, range);
if ( result == ERROR_OK ) {
for ( size_t i = range.m_range_begin; i <= range.m_range_end; ++i){
phrase_index.add_unigram_frequency(i, 1);
}
}
#endif
MemoryChunk * new_chunk = new MemoryChunk;
phrase_index.store(1, new_chunk);
new_chunk->save("../../data/gb_char.bin");
phrase_index.load(1, new_chunk);
new_chunk = new MemoryChunk;
phrase_index.store(2, new_chunk);
new_chunk->save("../../data/gbk_char.bin");
phrase_index.load(2, new_chunk);
return 0;
}
|
