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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/**
* Yudit Unicode Editor Source File
*
* GNU Copyright (C) 1997-2023 Gaspar Sinai <gaspar@yudit.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License, version 2,
* dated June 1991. See file COPYYING for details.
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "stoolkit/sencoder/SB_UHC.h"
#include "stoolkit/SString.h"
#include "stoolkit/SStringVector.h"
/**
* Korean text converter (MS-Windows Korean)
* rewritten code contributed by Jungshik Shin
* @author: Gaspar Sinai <gaspar@yudit.org>
* @version: 2000-05-12
*/
SB_UHC::SB_UHC() : SBEncoder ("\n,\r\n,\r"), ksc_5601_r ("ksc-5601-r")
{
ok = ksc_5601_r.isOK();
}
SB_UHC::~SB_UHC ()
{
}
/**
* return false if this generic encoder does not exist.
*/
bool
SB_UHC::isOK() const
{
return ok;
}
/**
* This is encoding a unicode string into a bytestring
* @param input is a unicode string.
*/
const SString&
SB_UHC::encode (const SV_UCS4& input)
{
const SS_UCS4* in = input.array();
sstring.clear();
sstring.ensure(input.size()*2);
SS_UCS2 got;
for (unsigned int i=0; i<input.size(); i++)
{
if (in[i] < 0x80)
{
sstring.append ((char) in[i]);
continue;
}
if (ksc_5601_r.isOK() && (got=ksc_5601_r.encode (in[i])) != 0)
{
sstring.append ((char) (got>>8));
sstring.append ((char) (got&0xff));
continue;
}
quoteString (in[i]);
}
return sstring;
}
/**
* Decode an input string into a unicode string.
* @param input is a string.
* he output can be null, in this case a line is not
* read fully. If input size is zero output will be flushed.
*/
const SV_UCS4&
SB_UHC::decode (const SString& input)
{
const unsigned char* in = (unsigned char*) input.array();
ucs4string.clear();
ucs4string.ensure(input.size());
SS_UCS4 got;
for (unsigned i=0; i<input.size(); i++)
{
got=0;
//
// patch from Jungshik Shin 9 Nov 1998
// Modified for better readability Gaspar Sinai 2010-01-24
//
if (input.size() > i+1 && (
(in[i] > 0xa0 && in[i] < 0xff && in[i+1] > 0xa0 && in[i+1] < 0xff)
|| (in[i] > 0x80 && in[i] < 0xc6 &&
((in[i+1] > 0x40 && in[i+1] < 0x5b)
|| (in[i+1] > 0x60 && in[i+1] < 0x7b)
|| (in[i+1] > 0x80 && in[i+1] < 0xff)))
|| (in[i] == 0xc6 && in[i+1] > 0x40 && in[i+1] < 0x53)))
{
// KSC5601
if (ksc_5601_r.isOK())
{
got = ksc_5601_r.decode ((SS_UCS2)((in[i] & 0xff) << 8)
| (in[i+1] & 0xff) );
}
if (got != 0)
{
ucs4string.append (got);
}
else
{
quoteUCS4 ((unsigned char) in[i]);
quoteUCS4 ((unsigned char) in[i+1]);
}
i++;
continue;
}
ucs4string.append ((SS_UCS4) in[i]);
}
return ucs4string;
}
/**
* These methods guess the line delimiters for the input
* The one without arguments is giving the 'first approximation'
* It returns an inclusive list of all possibilities.
*/
const SStringVector&
SB_UHC::delimiters ()
{
return realDelimiters;
}
/**
* These methods guess the line delimiters for the input
* The one without arguments is giving the 'first approximation'
* It returns an exact list
*/
const SStringVector&
SB_UHC::delimiters (const SString& sample)
{
return sampleDelimiters;
}
|
