| line |
true |
false |
branch |
|
59
|
4 |
0 |
mProbers[0] = new nsUTF8Prober();
|
|
|
4 |
0 |
mProbers[0] = new nsUTF8Prober();
|
|
60
|
4 |
0 |
mProbers[1] = new nsSJISProber();
|
|
|
4 |
0 |
mProbers[1] = new nsSJISProber();
|
|
61
|
4 |
0 |
mProbers[2] = new nsEUCJPProber();
|
|
|
4 |
0 |
mProbers[2] = new nsEUCJPProber();
|
|
62
|
4 |
0 |
mProbers[3] = new nsGB18030Prober();
|
|
|
4 |
0 |
mProbers[3] = new nsGB18030Prober();
|
|
63
|
4 |
0 |
mProbers[4] = new nsEUCKRProber();
|
|
|
4 |
0 |
mProbers[4] = new nsEUCKRProber();
|
|
64
|
4 |
0 |
mProbers[5] = new nsBig5Prober();
|
|
|
4 |
0 |
mProbers[5] = new nsBig5Prober();
|
|
65
|
4 |
0 |
mProbers[6] = new nsEUCTWProber();
|
|
|
4 |
0 |
mProbers[6] = new nsEUCTWProber();
|
|
66
|
4 |
0 |
Reset();
|
|
71
|
28 |
4 |
for (PRUint32 i = 0; i < NUM_OF_PROBERS; i++)
|
|
73
|
28 |
0 |
delete mProbers[i];
|
|
|
28 |
0 |
delete mProbers[i];
|
|
79
|
0 |
4 |
if (mBestGuess == -1)
|
|
82
|
0 |
0 |
if (mBestGuess == -1)
|
|
91
|
28 |
4 |
for (PRUint32 i = 0; i < NUM_OF_PROBERS; i++)
|
|
93
|
28 |
0 |
if (mProbers[i])
|
|
114
|
46 |
4 |
for (PRUint32 pos = 0; pos < aLen; ++pos)
|
|
116
|
28 |
18 |
if (aBuf[pos] & 0x80)
|
|
118
|
4 |
24 |
if (!keepNext)
|
|
122
|
4 |
14 |
else if (keepNext)
|
|
124
|
2 |
2 |
if (--keepNext == 0)
|
|
126
|
14 |
2 |
for (PRUint32 i = 0; i < NUM_OF_PROBERS; i++)
|
|
128
|
14 |
0 |
if (!mIsActive[i])
|
|
131
|
0 |
14 |
if (st == eFoundIt)
|
|
137
|
6 |
8 |
else if (st == eNotMe)
|
|
141
|
0 |
6 |
if (mActiveNum <= 0)
|
|
152
|
2 |
2 |
if (keepNext) {
|
|
153
|
14 |
2 |
for (PRUint32 i = 0; i < NUM_OF_PROBERS; i++)
|
|
155
|
14 |
0 |
if (!mIsActive[i])
|
|
158
|
0 |
14 |
if (st == eFoundIt)
|
|
164
|
10 |
4 |
else if (st == eNotMe)
|
|
168
|
0 |
10 |
if (mActiveNum <= 0)
|
|
193
|
28 |
4 |
for (i = 0; i < NUM_OF_PROBERS; i++)
|
|
195
|
12 |
16 |
if (!mIsActive[i])
|
|
198
|
4 |
8 |
if (bestConf < cf)
|