charsetgroupprober.js
3.88 KB
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
/*
* The Original Code is Mozilla Universal charset detector code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 2001
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* António Afonso (antonio.afonso gmail.com) - port to JavaScript
* Mark Pilgrim - port to Python
* Shy Shalom - original C code
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
!function(jschardet) {
jschardet.CharSetGroupProber = function() {
jschardet.CharSetProber.apply(this);
var self = this;
function init() {
self._mActiveNum = 0;
self._mProbers = [];
self._mBestGuessProber = null;
}
this.reset = function() {
jschardet.CharSetGroupProber.prototype.reset.apply(this);
this._mActiveNum = 0;
for( var i = 0, prober; prober = this._mProbers[i]; i++ ) {
if( prober ) {
prober.reset();
prober.active = true;
this._mActiveNum++;
}
}
this._mBestGuessProber = null;
}
this.getCharsetName = function() {
if( !this._mBestGuessProber ) {
this.getConfidence();
if( !this._mBestGuessProber ) return null;
}
return this._mBestGuessProber.getCharsetName();
}
this.feed = function(aBuf) {
for( var i = 0, prober; prober = this._mProbers[i]; i++ ) {
if( !prober || !prober.active ) continue;
var st = prober.feed(aBuf);
if( !st ) continue;
if( st == jschardet.Constants.foundIt ) {
this._mBestGuessProber = prober;
return this.getState();
} else if( st == jschardet.Constants.notMe ) {
prober.active = false;
this._mActiveNum--;
if( this._mActiveNum <= 0 ) {
this._mState = jschardet.Constants.notMe;
return this.getState();
}
}
}
return this.getState();
}
this.getConfidence = function() {
var st = this.getState();
if( st == jschardet.Constants.foundIt ) {
return 0.99;
} else if( st == jschardet.Constants.notMe ) {
return 0.01;
}
var bestConf = 0.0;
this._mBestGuessProber = null;
for( var i = 0, prober; prober = this._mProbers[i]; i++ ) {
if( !prober ) continue;
if( !prober.active ) {
if( jschardet.Constants._debug ) {
jschardet.log(prober.getCharsetName() + " not active\n");
}
continue;
}
var cf = prober.getConfidence();
if( jschardet.Constants._debug ) {
jschardet.log(prober.getCharsetName() + " confidence = " + cf + "\n");
}
if( bestConf < cf ) {
bestConf = cf;
this._mBestGuessProber = prober;
}
}
if( !this._mBestGuessProber ) return 0.0;
return bestConf;
}
init();
}
jschardet.CharSetGroupProber.prototype = new jschardet.CharSetProber();
}(require('./init'));