@ -60,18 +60,18 @@ function(b){return h.parseFromString(b,"text/xml")};this.exit=process.exit;this.
function RhinoRuntime ( ) { function m ( b , a ) { var e ; void 0 !== a ? e = b : a = b ; "alert" === e && print ( "\n!!!!! ALERT !!!!!" ) ; print ( a ) ; "alert" === e && print ( "!!!!! ALERT !!!!!" ) } var n = this , k = Packages . javax . xml . parsers . DocumentBuilderFactory . newInstance ( ) , c , a , h = "" ; k . setValidating ( ! 1 ) ; k . setNamespaceAware ( ! 0 ) ; k . setExpandEntityReferences ( ! 1 ) ; k . setSchema ( null ) ; a = Packages . org . xml . sax . EntityResolver ( { resolveEntity : function ( b , a ) { var e = new Packages . java . io . FileReader ( a ) ; return new Packages . org . xml . sax . InputSource ( e ) } } ) ; c = k . newDocumentBuilder ( ) ;
c . setEntityResolver ( a ) ; this . ByteArray = function ( b ) { return [ b ] } ; this . byteArrayFromArray = function ( b ) { return b } ; this . byteArrayFromString = function ( b , a ) { var e = [ ] , d , c = b . length ; for ( d = 0 ; d < c ; d += 1 ) e [ d ] = b . charCodeAt ( d ) & 255 ; return e } ; this . byteArrayToString = Runtime . byteArrayToString ; this . getVariable = Runtime . getVariable ; this . fromJson = Runtime . fromJson ; this . toJson = Runtime . toJson ; this . concatByteArrays = function ( b , a ) { return b . concat ( a ) } ; this . loadXML = function ( b , a ) { var e = new Packages . java . io . File ( b ) , d ; try { d = c . parse ( e ) } catch ( h ) { print ( h ) ;
a ( h ) ; return } a ( null , d ) } ; this . readFile = function ( b , a , e ) { h && ( b = h + "/" + b ) ; var d = new Packages . java . io . File ( b ) , c = "binary" === a ? "latin1" : a ; d . isFile ( ) ? ( b = readFile ( b , c ) , "binary" === a && ( b = n . byteArrayFromString ( b , "binary" ) ) , e ( null , b ) ) : e ( b + " is not a file." ) } ; this . writeFile = function ( a , f , e ) { h && ( a = h + "/" + a ) ; a = new Packages . java . io . FileOutputStream ( a ) ; var d , c = f . length ; for ( d = 0 ; d < c ; d += 1 ) a . write ( f [ d ] ) ; a . close ( ) ; e ( null ) } ; this . deleteFile = function ( a , f ) { h && ( a = h + "/" + a ) ; ( new Packages . java . io . File ( a ) ) [ "delete" ] ( ) ? f ( null ) : f ( "Could not delete " +
a ) } ; this . read = function ( a , f , e , d ) { h && ( a = h + "/" + a ) ; var c ; c = a ; var l = "binary" ; ( new Packages . java . io . File ( c ) ) . isFile ( ) ? ( "binary" === l && ( l = "latin1" ) , c = readFile ( c , l ) ) : c = null ; c ? d ( null , this . byteArrayFromString ( c . substring ( f , f + e ) , "binary" ) ) : d ( "Cannot read " + a ) } ; this . readFileSync = function ( a , f) { return f ? readFile ( a , f ) : "" } ; this . isFile = function ( a , f ) { h && ( a = h + "/" + a ) ; var e = new Packages . java . io . File ( a ) ; f ( e . isFile ( ) ) } ; this . getFileSize = function ( a , f ) { h && ( a = h + "/" + a ) ; var e = new Packages . java . io . File ( a ) ; f ( e . length ( ) ) } ; this . log =
m ; this . assert = function ( a , f , e ) { a || ( m ( "alert" , "ASSERTION FAILED: " + f ) , e && e ( ) ) } ; this . setTimeout = function ( a ) { a ( ) ; return 0 } ; this . clearTimeout = function ( ) { } ; this . libraryPaths = function ( ) { return [ "lib" ] } ; this . setCurrentDirectory = function ( a ) { h = a } ; this . currentDirectory = function ( ) { return h } ; this . type = function ( ) { return "RhinoRuntime" } ; this . getDOMImplementation = function ( ) { return c . getDOMImplementation ( ) } ; this . parseXML = function ( a ) { return c . parse ( a ) } ; this . exit = quit ; this . getWindow = function ( ) { return null } }
a ) } ; this . read = function ( a , f , e , d ) { h && ( a = h + "/" + a ) ; var c ; c = a ; var l = "binary" ; ( new Packages . java . io . File ( c ) ) . isFile ( ) ? ( "binary" === l && ( l = "latin1" ) , c = readFile ( c , l ) ) : c = null ; c ? d ( null , this . byteArrayFromString ( c . substring ( f , f + e ) , "binary" ) ) : d ( "Cannot read " + a ) } ; this . readFileSync = function ( a , c) { return c ? readFile ( a , c ) : "" } ; this . isFile = function ( a , c ) { h && ( a = h + "/" + a ) ; var e = new Packages . java . io . File ( a ) ; c ( e . isFile ( ) ) } ; this . getFileSize = function ( a , c ) { h && ( a = h + "/" + a ) ; var e = new Packages . java . io . File ( a ) ; c ( e . length ( ) ) } ; this . log =
m ; this . assert = function ( a , c , e ) { a || ( m ( "alert" , "ASSERTION FAILED: " + c ) , e && e ( ) ) } ; this . setTimeout = function ( a ) { a ( ) ; return 0 } ; this . clearTimeout = function ( ) { } ; this . libraryPaths = function ( ) { return [ "lib" ] } ; this . setCurrentDirectory = function ( a ) { h = a } ; this . currentDirectory = function ( ) { return h } ; this . type = function ( ) { return "RhinoRuntime" } ; this . getDOMImplementation = function ( ) { return c . getDOMImplementation ( ) } ; this . parseXML = function ( a ) { return c . parse ( a ) } ; this . exit = quit ; this . getWindow = function ( ) { return null } }
var runtime = function ( ) { return "undefined" !== String ( typeof window ) ? new BrowserRuntime ( window . document . getElementById ( "logoutput" ) ) : "undefined" !== String ( typeof require ) ? new NodeJSRuntime : new RhinoRuntime } ( ) ;
( function ( ) { function m ( c ) { var a = c [ 0 ] , h ; h = eval ( "if (typeof " + a + " === 'undefined') {eval('" + a + " = {};');}" + a ) ; for ( a = 1 ; a < c . length - 1 ; a += 1 ) h = h . hasOwnProperty ( c [ a ] ) ? h [ c [ a ] ] : h [ c [ a ] ] = { } ; return h [ c [ c . length - 1 ] ] } var n = { } , k = { } ; runtime . loadClass = function ( c ) { function a ( a ) { a = a . replace ( /\./g , "/" ) + ".js" ; var d = runtime . libraryPaths ( ) , b , l , f ; runtime . currentDirectory && d . push ( runtime . currentDirectory ( ) ) ; for ( b = 0 ; b < d . length ; b += 1 ) { l = d [ b ] ; if ( ! k . hasOwnProperty ( l ) ) try { f = runtime . readFileSync ( d [ b ] + "/manifest.js" , "utf8" ) , k [ l ] =
f&& f . length ? eval ( f ) : null } catch ( g ) { k [ l ] = null , runtime . log ( "Cannot load manifest for " + l + "." ) } f = null ; if ( ( l = k [ l ] ) && l . indexOf && - 1 !== l . indexOf ( a ) ) return d [ b ] + "/" + a } return null } function h ( b ) { var d , f; f = a ( b ) ; if ( ! f ) throw b + " is not listed in any manifest.js." ; try { d = runtime . readFileSync ( f , "utf8" ) } catch ( l ) { throw runtime . log ( "Error loading " + b + " " + l ) , l ; } if ( void 0 === d ) throw "Cannot load class " + b ; d = d + ( "\n//# sourceURL=" + f) + ( "\n//@ sourceURL=" + f ) ; try { d = eval ( b + " = eval(code);" ) } catch ( c ) { throw runtime . log ( "Error loading " +
b + " " + c) , c ; } return d } if ( ! IS _COMPILED _CODE && ! n . hasOwnProperty ( c ) ) { var b = c . split ( "." ) , f ; f = m ( b ) ; if ( ! f && ( f = h ( c ) , ! f || Runtime . getFunctionName ( f ) !== b [ b . length - 1 ] ) ) throw runtime . log ( "Loaded code is not for " + b [ b . length - 1 ] ) , "Loaded code is not for " + b [ b . length - 1 ] ; n [ c ] = ! 0 } } } ) ( ) ;
( function ( ) { function m ( c ) { var a = c [ 0 ] , h ; h = eval ( "if (typeof " + a + " === 'undefined') {eval('" + a + " = {};');}" + a ) ; for ( a = 1 ; a < c . length - 1 ; a += 1 ) h = h . hasOwnProperty ( c [ a ] ) ? h [ c [ a ] ] : h [ c [ a ] ] = { } ; return h [ c [ c . length - 1 ] ] } var n = { } , k = { } ; runtime . loadClass = function ( c ) { function a ( a ) { a = a . replace ( /\./g , "/" ) + ".js" ; var d = runtime . libraryPaths ( ) , b , l , c ; runtime . currentDirectory && d . push ( runtime . currentDirectory ( ) ) ; for ( b = 0 ; b < d . length ; b += 1 ) { l = d [ b ] ; if ( ! k . hasOwnProperty ( l ) ) try { c = runtime . readFileSync ( d [ b ] + "/manifest.js" , "utf8" ) , k [ l ] =
c&& c . length ? eval ( c ) : null } catch ( g ) { k [ l ] = null , runtime . log ( "Cannot load manifest for " + l + "." ) } c = null ; if ( ( l = k [ l ] ) && l . indexOf && - 1 !== l . indexOf ( a ) ) return d [ b ] + "/" + a } return null } function h ( b ) { var d , c; c = a ( b ) ; if ( ! c ) throw b + " is not listed in any manifest.js." ; try { d = runtime . readFileSync ( c , "utf8" ) } catch ( l ) { throw runtime . log ( "Error loading " + b + " " + l ) , l ; } if ( void 0 === d ) throw "Cannot load class " + b ; d = d + ( "\n//# sourceURL=" + c) + ( "\n//@ sourceURL=" + c ) ; try { d = eval ( b + " = eval(code);" ) } catch ( f ) { throw runtime . log ( "Error loading " +
b + " " + f) , f ; } return d } if ( ! IS _COMPILED _CODE && ! n . hasOwnProperty ( c ) ) { var b = c . split ( "." ) , f ; f = m ( b ) ; if ( ! f && ( f = h ( c ) , ! f || Runtime . getFunctionName ( f ) !== b [ b . length - 1 ] ) ) throw runtime . log ( "Loaded code is not for " + b [ b . length - 1 ] ) , "Loaded code is not for " + b [ b . length - 1 ] ; n [ c ] = ! 0 } } } ) ( ) ;
( function ( m ) { function n ( k ) { if ( k . length ) { var c = k [ 0 ] ; runtime . readFile ( c , "utf8" , function ( a , h ) { function b ( ) { var a ; ( a = eval ( e ) ) && runtime . exit ( a ) } var f = "" , e = h ; - 1 !== c . indexOf ( "/" ) && ( f = c . substring ( 0 , c . indexOf ( "/" ) ) ) ; runtime . setCurrentDirectory ( f ) ; a || null === e ? ( runtime . log ( a ) , runtime . exit ( 1 ) ) : b . apply ( null , k ) } ) } } m = m ? Array . prototype . slice . call ( m ) : [ ] ; "NodeJSRuntime" === runtime . type ( ) ? n ( process . argv . slice ( 2 ) ) : "RhinoRuntime" === runtime . type ( ) ? n ( m ) : n ( m . slice ( 1 ) ) } ) ( "undefined" !== String ( typeof arguments ) && arguments ) ;
// Input 2
core . Base64 = function ( ) { function m ( a ) { var d = [ ] , b , g = a . length ; for ( b = 0 ; b < g ; b += 1 ) d [ b ] = a . charCodeAt ( b ) & 255 ; return d } function n ( a ) { var d , b = "" , g , l = a . length - 2 ; for ( g = 0 ; g < l ; g += 3 ) d = a [ g ] << 16 | a [ g + 1 ] << 8 | a [ g + 2 ] , b += q [ d >>> 18 ] , b += q [ d >>> 12 & 63 ] , b += q [ d >>> 6 & 63 ] , b += q [ d & 63 ] ; g === l + 1 ? ( d = a [ g ] << 4 , b += q [ d >>> 6 ] , b += q [ d & 63 ] , b += "==" ) : g === l && ( d = a [ g ] << 10 | a [ g + 1 ] << 2 , b += q [ d >>> 12 ] , b += q [ d >>> 6 & 63 ] , b += q [ d & 63 ] , b += "=" ) ; return b } function k ( a ) { a = a . replace ( /[^A-Za-z0-9+\/]+/g , "" ) ; var d = [ ] , b = a . length % 4 , g , l = a . length , f ; for ( g = 0 ; g < l ; g += 4 ) f = ( s [ a . charAt ( g ) ] ||
0 ) << 18 | ( s [ a . charAt ( g + 1 ) ] || 0 ) << 12 | ( s [ a . charAt ( g + 2 ) ] || 0 ) << 6 | ( s [ a . charAt ( g + 3 ) ] || 0 ) , d . push ( f>> 16 , f >> 8 & 255 , f & 255 ) ; d . length -= [ 0 , 0 , 2 , 1 ] [ b ] ; return d } function c ( a ) { var d = [ ] , b , g = a . length , l ; for ( b = 0 ; b < g ; b += 1 ) l = a [ b ] , 128 > l ? d . push ( l ) : 2048 > l ? d . push ( 192 | l >>> 6 , 128 | l & 63 ) : d . push ( 224 | l >>> 12 & 15 , 128 | l >>> 6 & 63 , 128 | l & 63 ) ; return d } function a ( a ) { var d = [ ] , b , g = a . length , l , f , e ; for ( b = 0 ; b < g ; b += 1 ) l = a [ b ] , 128 > l ? d . push ( l ) : ( b += 1 , f = a [ b ] , 224 > l ? d . push ( ( l & 31 ) << 6 | f & 63 ) : ( b += 1 , e = a [ b ] , d . push ( ( l & 15 ) << 12 | ( f & 63 ) << 6 | e & 63 ) ) ) ; return d } function h ( a ) { return n ( m ( a ) ) }
function b ( a ) { return String . fromCharCode . apply ( String , k ( a ) ) } function f ( d ) { return a ( m ( d ) ) } function e ( d ) { d = a ( d ) ; for ( var b = "" , g = 0 ; g < d . length ; ) b += String . fromCharCode . apply ( String , d . slice ( g , g + 45E3 ) ) , g += 45E3 ; return b } function d ( a , d , b ) { var g = "" , l , f , e ; for ( e = d ; e < b ; e += 1 ) d = a . charCodeAt ( e ) & 255 , 128 > d ? g += String . fromCharCode ( d ) : ( e += 1 , l = a . charCodeAt ( e ) & 255 , 224 > d ? g += String . fromCharCode ( ( d & 31 ) << 6 | l & 63 ) : ( e += 1 , f = a . charCodeAt ( e ) & 255 , g += String . fromCharCode ( ( d & 15 ) << 12 | ( l & 63 ) << 6 | f & 63 ) ) ) ; return g } function t ( a , b ) { function g ( ) { var c =
e + l ; c> a . length && ( c = a . length ) ; f += d ( a , e , c ) ; e = c ; c = e === a . length ; b ( f , c ) && ! c && runtime . setTimeout ( g , 0 ) } var l = 1E5 , f = "" , e = 0 ; a . length < l ? b ( d ( a , 0 , a . length ) , ! 0 ) : ( "string" !== typeof a && ( a = a . slice ( ) ) , g ( ) ) } function l ( a ) { return c ( m ( a ) ) } function p ( a ) { return String . fromCharCode . apply ( String , c ( a ) ) } function g ( a ) { return String . fromCharCode . apply ( String , c ( m ( a ) ) ) } var q = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" , s = function ( a ) { var d = { } , b , g ; b = 0 ; for ( g = a . length ; b < g ; b += 1 ) d [ a . charAt ( b ) ] = b ; return d } ( q ) , w ,
core . Base64 = function ( ) { function m ( a ) { var d = [ ] , b , g = a . length ; for ( b = 0 ; b < g ; b += 1 ) d [ b ] = a . charCodeAt ( b ) & 255 ; return d } function n ( a ) { var d , b = "" , g , l = a . length - 2 ; for ( g = 0 ; g < l ; g += 3 ) d = a [ g ] << 16 | a [ g + 1 ] << 8 | a [ g + 2 ] , b += q [ d >>> 18 ] , b += q [ d >>> 12 & 63 ] , b += q [ d >>> 6 & 63 ] , b += q [ d & 63 ] ; g === l + 1 ? ( d = a [ g ] << 4 , b += q [ d >>> 6 ] , b += q [ d & 63 ] , b += "==" ) : g === l && ( d = a [ g ] << 10 | a [ g + 1 ] << 2 , b += q [ d >>> 12 ] , b += q [ d >>> 6 & 63 ] , b += q [ d & 63 ] , b += "=" ) ; return b } function k ( a ) { a = a . replace ( /[^A-Za-z0-9+\/]+/g , "" ) ; var d = [ ] , b = a . length % 4 , g , l = a . length , c ; for ( g = 0 ; g < l ; g += 4 ) c = ( s [ a . charAt ( g ) ] ||
0 ) << 18 | ( s [ a . charAt ( g + 1 ) ] || 0 ) << 12 | ( s [ a . charAt ( g + 2 ) ] || 0 ) << 6 | ( s [ a . charAt ( g + 3 ) ] || 0 ) , d . push ( c>> 16 , c >> 8 & 255 , c & 255 ) ; d . length -= [ 0 , 0 , 2 , 1 ] [ b ] ; return d } function c ( a ) { var d = [ ] , b , g = a . length , l ; for ( b = 0 ; b < g ; b += 1 ) l = a [ b ] , 128 > l ? d . push ( l ) : 2048 > l ? d . push ( 192 | l >>> 6 , 128 | l & 63 ) : d . push ( 224 | l >>> 12 & 15 , 128 | l >>> 6 & 63 , 128 | l & 63 ) ; return d } function a ( a ) { var d = [ ] , b , g = a . length , l , c , e ; for ( b = 0 ; b < g ; b += 1 ) l = a [ b ] , 128 > l ? d . push ( l ) : ( b += 1 , c = a [ b ] , 224 > l ? d . push ( ( l & 31 ) << 6 | c & 63 ) : ( b += 1 , e = a [ b ] , d . push ( ( l & 15 ) << 12 | ( c & 63 ) << 6 | e & 63 ) ) ) ; return d } function h ( a ) { return n ( m ( a ) ) }
function b ( a ) { return String . fromCharCode . apply ( String , k ( a ) ) } function f ( d ) { return a ( m ( d ) ) } function e ( d ) { d = a ( d ) ; for ( var b = "" , g = 0 ; g < d . length ; ) b += String . fromCharCode . apply ( String , d . slice ( g , g + 45E3 ) ) , g += 45E3 ; return b } function d ( a , d , b ) { var g = "" , l , c , e ; for ( e = d ; e < b ; e += 1 ) d = a . charCodeAt ( e ) & 255 , 128 > d ? g += String . fromCharCode ( d ) : ( e += 1 , l = a . charCodeAt ( e ) & 255 , 224 > d ? g += String . fromCharCode ( ( d & 31 ) << 6 | l & 63 ) : ( e += 1 , c = a . charCodeAt ( e ) & 255 , g += String . fromCharCode ( ( d & 15 ) << 12 | ( l & 63 ) << 6 | c & 63 ) ) ) ; return g } function t ( a , b ) { function g ( ) { var f =
e + l ; f> a . length && ( f = a . length ) ; c += d ( a , e , f ) ; e = f ; f = e === a . length ; b ( c , f ) && ! f && runtime . setTimeout ( g , 0 ) } var l = 1E5 , c = "" , e = 0 ; a . length < l ? b ( d ( a , 0 , a . length ) , ! 0 ) : ( "string" !== typeof a && ( a = a . slice ( ) ) , g ( ) ) } function l ( a ) { return c ( m ( a ) ) } function p ( a ) { return String . fromCharCode . apply ( String , c ( a ) ) } function g ( a ) { return String . fromCharCode . apply ( String , c ( m ( a ) ) ) } var q = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" , s = function ( a ) { var d = { } , b , g ; b = 0 ; for ( g = a . length ; b < g ; b += 1 ) d [ a . charAt ( b ) ] = b ; return d } ( q ) , w ,
u , A = runtime . getWindow ( ) , x , r ; A && A . btoa ? ( x = function ( a ) { return A . btoa ( a ) } , w = function ( a ) { return x ( g ( a ) ) } ) : ( x = h , w = function ( a ) { return n ( l ( a ) ) } ) ; A && A . atob ? ( r = function ( a ) { return A . atob ( a ) } , u = function ( a ) { a = r ( a ) ; return d ( a , 0 , a . length ) } ) : ( r = b , u = function ( a ) { return e ( k ( a ) ) } ) ; return function ( ) { this . convertByteArrayToBase64 = this . convertUTF8ArrayToBase64 = n ; this . convertBase64ToByteArray = this . convertBase64ToUTF8Array = k ; this . convertUTF16ArrayToByteArray = this . convertUTF16ArrayToUTF8Array = c ; this . convertByteArrayToUTF16Array =
this . convertUTF8ArrayToUTF16Array = a ; this . convertUTF8StringToBase64 = h ; this . convertBase64ToUTF8String = b ; this . convertUTF8StringToUTF16Array = f ; this . convertByteArrayToUTF16String = this . convertUTF8ArrayToUTF16String = e ; this . convertUTF8StringToUTF16String = t ; this . convertUTF16StringToByteArray = this . convertUTF16StringToUTF8Array = l ; this . convertUTF16ArrayToUTF8String = p ; this . convertUTF16StringToUTF8String = g ; this . convertUTF16StringToBase64 = w ; this . convertBase64ToUTF16String = u ; this . fromBase64 = b ; this . toBase64 = h ; this . atob =
r ; this . btoa = x ; this . utob = g ; this . btou = t ; this . encode = w ; this . encodeURI = function ( a ) { return w ( a ) . replace ( /[+\/]/g , function ( a ) { return "+" === a ? "-" : "_" } ) . replace ( /\\=+$/ , "" ) } ; this . decode = function ( a ) { return u ( a . replace ( /[\-_]/g , function ( a ) { return "-" === a ? "+" : "/" } ) ) } } } ( ) ;
@ -79,18 +79,18 @@ r;this.btoa=x;this.utob=g;this.btou=t;this.encode=w;this.encodeURI=function(a){r
core . RawDeflate = function ( ) { function m ( ) { this . dl = this . fc = 0 } function n ( ) { this . extra _bits = this . static _tree = this . dyn _tree = null ; this . max _code = this . max _length = this . elems = this . extra _base = 0 } function k ( a , d , b , g ) { this . good _length = a ; this . max _lazy = d ; this . nice _length = b ; this . max _chain = g } function c ( ) { this . next = null ; this . len = 0 ; this . ptr = [ ] ; this . ptr . length = a ; this . off = 0 } var a = 8192 , h , b , f , e , d = null , t , l , p , g , q , s , w , u , A , x , r , v , D , G , y , P , z , R , E , K , X , oa , L , ra , aa , ea , O , V , S , M , H , F , I , Q , ba , fa , N , ca , ha , C , ka , ia , T , ja , la , U , ma , W , $ , B , sa , ya = [ 0 ,
0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 1 , 2 , 2 , 2 , 2 , 3 , 3 , 3 , 3 , 4 , 4 , 4 , 4 , 5 , 5 , 5 , 5 , 0 ] , ta = [ 0 , 0 , 0 , 0 , 1 , 1 , 2 , 2 , 3 , 3 , 4 , 4 , 5 , 5 , 6 , 6 , 7 , 7 , 8 , 8 , 9 , 9 , 10 , 10 , 11 , 11 , 12 , 12 , 13 , 13 ] , xa = [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 2 , 3 , 7 ] , J = [ 16 , 17 , 18 , 0 , 8 , 7 , 9 , 6 , 10 , 5 , 11 , 4 , 12 , 3 , 13 , 2 , 14 , 1 , 15 ] , ua ; ua = [ new k ( 0 , 0 , 0 , 0 ) , new k ( 4 , 4 , 8 , 4 ) , new k ( 4 , 5 , 16 , 8 ) , new k ( 4 , 6 , 32 , 32 ) , new k ( 4 , 4 , 16 , 16 ) , new k ( 8 , 16 , 32 , 32 ) , new k ( 8 , 16 , 128 , 128 ) , new k ( 8 , 32 , 128 , 256 ) , new k ( 32 , 128 , 258 , 1024 ) , new k ( 32 , 258 , 258 , 4096 ) ] ; var va = function ( g ) { d [ l + t ++ ] = g ; if ( l + t === a ) { var e ; if ( 0 !== t ) { null !== h ? ( g = h , h = h . next ) : g = new c ;
g . next = null ; g . len = g . off = 0 ; null === b ? b = f = g : f = f . next = g ; g . len = t - l ; for ( e = 0 ; e < g . len ; e ++ ) g . ptr [ e ] = d [ l + e ] ; t = l = 0 } } } , na = function ( b ) { b &= 65535 ; l + t < a - 2 ? ( d [ l + t ++ ] = b & 255 , d [ l + t ++ ] = b >>> 8 ) : ( va ( b & 255 ) , va ( b >>> 8 ) ) } , pa = function ( ) { r = ( r << 5 ^ g [ z + 3 - 1 ] & 255 ) & 8191 ; v = w [ 32768 + r ] ; w [ z & 32767 ] = v ; w [ 32768 + r ] = z } , ga = function ( a , b ) { A > 16 - b ? ( u |= a << A , na ( u ) , u = a >> 16 - A , A += b - 16 ) : ( u |= a << A , A += b ) } , Y = function ( a , b ) { ga ( b [ a ] . fc , b [ a ] . dl ) } , da = function ( a , b , d ) { return a [ b ] . fc < a [ d ] . fc || a [ b ] . fc === a [ d ] . fc && N [ b ] <= N [ d ] } , Z = function ( a , b , d ) { var g ; for ( g = 0 ; g < d && sa < B . length ; g ++ ) a [ b +
g ] = B . charCodeAt ( sa ++ ) & 255 ; return g } , wa = function ( ) { var a , b , d = 65536 - K - z ; if ( - 1 === d ) d -- ; else if ( 65274 <= z ) { for ( a = 0 ; 32768 > a ; a ++ ) g [ a ] = g [ a + 32768 ] ; R -= 32768 ; z -= 32768 ; x -= 32768 ; for ( a = 0 ; 8192 > a ; a ++ ) b = w [ 32768 + a ] , w [ 32768 + a ] = 32768 <= b ? b - 32768 : 0 ; for ( a = 0 ; 32768 > a ; a ++ ) b = w [ a ] , w [ a ] = 32768 <= b ? b - 32768 : 0 ; d += 32768 } E || ( a = Z ( g , z + K , d ) , 0 >= a ? E = ! 0 : K += a ) } , qa = function ( a ) { var b = X , d = z , l , e= P , f = 32506 < z ? z - 32506 : 0 , c = z + 258 , q = g [ d + e- 1 ] , p = g [ d + e ] ; P >= ra && ( b >>= 2 ) ; do if ( l = a , g [ l + e] === p && g [ l + e - 1 ] === q && g [ l ] === g [ d ] && g [ ++ l ] === g [ d + 1 ] ) { d += 2 ; l ++ ; do ++ d ; while ( g [ d ] ===
g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && d < c) ; l = 258 - ( c - d ) ; d = c - 258 ; if ( l > e ) { R = a ; e = l ; if ( 258 <= l ) break ; q = g [ d + e- 1 ] ; p = g [ d + e ] } a = w [ a & 32767 ] } while ( a > f&& 0 !== -- b ) ; return e } , za = function ( a , d ) { s [ T ++ ] = d ; 0 === a ? aa [ d ] . fc ++ : ( a -- , aa [ ca [ d ] + 256 + 1 ] . fc ++ , ea [ ( 256 > a ? ha [ a ] : ha [ 256 + ( a >> 7 ) ] ) & 255 ] . fc ++ , q [ ja ++ ] = a , U |= ma ) ; ma <<= 1 ; 0 === ( T & 7 ) && ( ia [ la ++ ] = U , U = 0 , ma = 1 ) ; if ( 2 < L && 0 === ( T & 4095 ) ) { var b = 8 * T , g = z - x , l ; for ( l = 0 ; 30 > l ; l ++ ) b += ea [ l ] . fc * ( 5 + ta [ l ] ) ; b >>= 3 ; if ( ja <
parseInt ( T / 2 , 10 ) && b < parseInt ( g / 2 , 10 ) ) return ! 0 } return 8191 === T || 8192 === ja } , Ba = function ( a , d ) { for ( var b = Q [ d ] , g = d << 1 ; g <= ba ; ) { g < ba && da ( a , Q [ g + 1 ] , Q [ g ] ) && g ++ ; if ( da ( a , b , Q [ g ] ) ) break ; Q [ d ] = Q [ g ] ; d = g ; g <<= 1 } Q [ d ] = b } , Da = function ( a , d ) { var b = 0 ; do b |= a & 1 , a >>= 1 , b <<= 1 ; while ( 0 < -- d ) ; return b >> 1 } , Ea = function ( a , d ) { var b = [ ] ; b . length = 16 ; var g = 0 , l ; for ( l = 1 ; 15 >= l ; l ++ ) g = g + I [ l - 1 ] << 1 , b [ l ] = g ; for ( g = 0 ; g <= d ; g ++ ) l = a [ g ] . dl , 0 !== l && ( a [ g ] . fc = Da ( b [ l ] ++ , l ) ) } , Ca = function ( a ) { var d = a . dyn _tree , b = a . static _tree , g = a . elems , l , e= - 1 , f = g ; ba = 0 ; fa = 573 ; for ( l =
0 ; l < g ; l ++ ) 0 !== d [ l ] . fc ? ( Q [ ++ ba ] = e = l , N [ l ] = 0 ) : d [ l ] . dl = 0 ; for ( ; 2 > ba ; ) l = Q [ ++ ba ] = 2 > e? ++ e : 0 , d [ l ] . fc = 1 , N [ l ] = 0 , W -- , null !== b && ( $ -= b [ l ] . dl ) ; a . max _code = e ; for ( l = ba >> 1 ; 1 <= l ; l -- ) Ba ( d , l ) ; do l = Q [ 1 ] , Q [ 1 ] = Q [ ba -- ] , Ba ( d , 1 ) , b = Q [ 1 ] , Q [ -- fa ] = l , Q [ -- fa ] = b , d [ f ] . fc = d [ l ] . fc + d [ b ] . fc , N [ f ] = N [ l ] > N [ b ] + 1 ? N [ l ] : N [ b ] + 1 , d [ l ] . dl = d [ b ] . dl = f, Q [ 1 ] = f ++ , Ba ( d , 1 ) ; while ( 2 <= ba ) ; Q [ -- fa ] = Q [ 1 ] ; f = a . dyn _tree ; l = a . extra _bits ; var g = a . extra _base , b = a . max _code , c = a . max _length , q = a . static _tree , p , h , r , k , u = 0 ; for ( h = 0 ; 15 >= h ; h ++ ) I [ h ] = 0 ; f [ Q [ fa ] ] . dl = 0 ; for ( a = fa + 1 ; 573 > a ; a ++ ) p =
Q [ a ] , h = f[ f [ p ] . dl ] . dl + 1 , h > c&& ( h = c , u ++ ) , f [ p ] . dl = h , p > b || ( I [ h ] ++ , r = 0 , p >= g && ( r = l [ p - g ] ) , k = f [ p ] . fc , W += k * ( h + r ) , null !== q && ( $ += k * ( q [ p ] . dl + r ) ) ) ; if ( 0 !== u ) { do { for ( h = c - 1 ; 0 === I [ h ] ; ) h -- ; I [ h ] -- ; I [ h + 1 ] += 2 ; I [ c ] -- ; u -= 2 } while ( 0 < u ) ; for ( h = c ; 0 !== h ; h -- ) for ( p = I [ h ] ; 0 !== p ; ) l = Q [ -- a ] , l > b || ( f [ l ] . dl !== h && ( W += ( h - f[ l ] . dl ) * f [ l ] . fc , f [ l ] . fc = h ) , p -- ) } Ea ( d , e ) } , Fa = function ( a , d ) { var b , g = - 1 , l , e= a [ 0 ] . dl , f = 0 , c = 7 , h = 4 ; 0 === e && ( c = 138 , h = 3 ) ; a [ d + 1 ] . dl = 65535 ; for ( b = 0 ; b <= d ; b ++ ) l = e, e = a [ b + 1 ] . dl , ++ f< c && l === e || ( f < h ? S [ l ] . fc += f : 0 !== l ? ( l !== g && S [ l ] . fc ++ , S [ 16 ] . fc ++ ) :
10 >= f ? S [ 17 ] . fc ++ : S [ 18 ] . fc ++ , f= 0 , g = l , 0 === e ? ( c = 138 , h = 3 ) : l === e? ( c = 6 , h = 3 ) : ( c = 7 , h = 4 ) ) } , Ga = function ( ) { 8 < A ? na ( u ) : 0 < A && va ( u ) ; A = u = 0 } , Ha = function ( a , d ) { var b , g = 0 , l = 0 , = 0 , f = 0 , c , h ; if ( 0 !== T ) { do 0 === ( g & 7 ) && ( f= ia [ e ++ ] ) , b = s [ g ++ ] & 255 , 0 === ( f & 1 ) ? Y ( b , a ) : ( c= ca [ b ] , Y ( c + 256 + 1 , a ) , h = ya [ c ] , 0 !== h && ( b -= C [ c ] , ga ( b , h ) ) , b = q [ l ++ ] , c = ( 256 > b ? ha [ b ] : ha [ 256 + ( b >> 7 ) ] ) & 255 , Y ( c, d ) , h = ta [ c ] , 0 !== h && ( b -= ka [ c ] , ga ( b , h ) ) ) , f >>= 1 ; while ( g < T ) } Y ( 256 , a ) } , Ia = function ( a , b ) { var d , g = - 1 , l , f = a [ 0 ] . dl , e = 0 , c= 7 , h = 4 ; 0 === f && ( c = 138 , h = 3 ) ; for ( d = 0 ; d <= b ; d ++ ) if ( l = f, f = a [ d +
1 ] . dl , ! ( ++ e < c&& l === f ) ) { if ( e < h ) { do Y ( l , S ) ; while ( 0 !== -- e ) } else 0 !== l ? ( l !== g && ( Y ( l , S ) , e -- ) , Y ( 16 , S ) , ga ( e - 3 , 2 ) ) : 10 >= e ? ( Y ( 17 , S ) , ga ( e - 3 , 3 ) ) : ( Y ( 18 , S ) , ga ( e - 11 , 7 ) ) ; e = 0 ; g = l ; 0 === f? ( c = 138 , h = 3 ) : l === f? ( c = 6 , h = 3 ) : ( c = 7 , h = 4 ) } } , Ja = function ( ) { var a ; for ( a = 0 ; 286 > a ; a ++ ) aa [ a ] . fc = 0 ; for ( a = 0 ; 30 > a ; a ++ ) ea [ a ] . fc = 0 ; for ( a = 0 ; 19 > a ; a ++ ) S [ a ] . fc = 0 ; aa [ 256 ] . fc = 1 ; U = T = ja = la = W = $ = 0 ; ma = 1 } , Aa = function ( a ) { var b , d , l , e; e = z - x ; ia [ la ] = U ; Ca ( M ) ; Ca ( H ) ; Fa ( aa , M . max _code ) ; Fa ( ea , H . max _code ) ; Ca ( F ) ; for ( l = 18 ; 3 <= l && 0 === S [ J [ l ] ] . dl ; l -- ) ; W += 3 * ( l + 1 ) + 14 ; b = W + 3 + 7 >>
3 ; d = $ + 3 + 7 >> 3 ; d <= b && ( b = d ) ; if ( e + 4 <= b && 0 <= x ) for ( ga ( 0 + a , 3 ) , Ga ( ) , na ( e) , na ( ~ e ) , l = 0 ; l < e ; l ++ ) va ( g [ x + l ] ) ; else if ( d === b ) ga ( 2 + a , 3 ) , Ha ( O , V ) ; else { ga ( 4 + a , 3 ) ; e = M . max _code + 1 ; b = H . max _code + 1 ; l += 1 ; ga ( e - 257 , 5 ) ; ga ( b - 1 , 5 ) ; ga ( l - 4 , 4 ) ; for ( d = 0 ; d < l ; d ++ ) ga ( S [ J [ d ] ] . dl , 3 ) ; Ia ( aa , e - 1 ) ; Ia ( ea , b - 1 ) ; Ha ( aa , ea ) } Ja ( ) ; 0 !== a && Ga ( ) } , Ka = function ( a , g , e) { var f , c , p ; for ( f = 0 ; null !== b && f < e ; ) { c = e - f ; c > b . len && ( c = b . len ) ; for ( p = 0 ; p < c; p ++ ) a [ g + f + p ] = b . ptr [ b . off + p ] ; b . off += c; b . len -= c ; f += c ; 0 === b . len && ( c = b , b = b . next , c . next = h , h = c ) } if ( f === e ) return f ; if ( l < t ) { c =
e- f ; c > t - l && ( c = t - l ) ; for ( p = 0 ; p < c; p ++ ) a [ g + f + p ] = d [ l + p ] ; l += c; f += c ; t === l && ( t = l = 0 ) } return f } , La = function ( a , d , f) { var c ; if ( ! e ) { if ( ! E ) { A = u = 0 ; var h , q ; if ( 0 === V [ 0 ] . dl ) { M . dyn _tree = aa ; M . static _tree = O ; M . extra _bits = ya ; M . extra _base = 257 ; M . elems = 286 ; M . max _length = 15 ; M . max _code = 0 ; H . dyn _tree = ea ; H . static _tree = V ; H . extra _bits = ta ; H . extra _base = 0 ; H . elems = 30 ; H . max _length = 15 ; H . max _code = 0 ; F . dyn _tree = S ; F . static _tree = null ; F . extra _bits = xa ; F . extra _base = 0 ; F . elems = 19 ; F . max _length = 7 ; for ( q = h = F . max _code = 0 ; 28 > q ; q ++ ) for ( C [ q ] = h , c= 0 ; c < 1 << ya [ q ] ; c ++ ) ca [ h ++ ] =
q ; ca [ h - 1 ] = q ; for ( q = h = 0 ; 16 > q ; q ++ ) for ( ka [ q ] = h , c= 0 ; c < 1 << ta [ q ] ; c ++ ) ha [ h ++ ] = q ; for ( h >>= 7 ; 30 > q ; q ++ ) for ( ka [ q ] = h << 7 , c= 0 ; c < 1 << ta [ q ] - 7 ; c ++ ) ha [ 256 + h ++ ] = q ; for ( c= 0 ; 15 >= c ; c ++ ) I [ c ] = 0 ; for ( c = 0 ; 143 >= c ; ) O [ c ++ ] . dl = 8 , I [ 8 ] ++ ; for ( ; 255 >= c; ) O [ c ++ ] . dl = 9 , I [ 9 ] ++ ; for ( ; 279 >= c; ) O [ c ++ ] . dl = 7 , I [ 7 ] ++ ; for ( ; 287 >= c; ) O [ c ++ ] . dl = 8 , I [ 8 ] ++ ; Ea ( O , 287 ) ; for ( c= 0 ; 30 > c ; c ++ ) V [ c ] . dl = 5 , V [ c ] . fc = Da ( c , 5 ) ; Ja ( ) } for ( c= 0 ; 8192 > c ; c ++ ) w [ 32768 + c ] = 0 ; oa = ua [ L ] . max _lazy ; ra = ua [ L ] . good _length ; X = ua [ L ] . max _chain ; x = z = 0 ; K = Z ( g , 0 , 65536 ) ; if ( 0 >= K ) E = ! 0 , K = 0 ; else { for ( E = ! 1 ; 262 > K &&
! E ; ) wa ( ) ; for ( c= r = 0 ; 2 > c ; c ++ ) r = ( r << 5 ^ g [ c ] & 255 ) & 8191 } b = null ; l = t = 0 ; 3 >= L ? ( P = 2 , y = 0 ) : ( y = 2 , G = 0 ) ; p = ! 1 } e = ! 0 ; if ( 0 === K ) return p = ! 0 , 0 } c= Ka ( a , d , f ) ; if ( c === f ) return f ; if ( p ) return c ; if ( 3 >= L ) for ( ; 0 !== K && null === b ; ) { pa ( ) ; 0 !== v && 32506 >= z - v && ( y = qa ( v ) , y > K && ( y = K ) ) ; if ( 3 <= y ) if ( q = za ( z - R , y - 3 ) , K -= y , y <= oa ) { y -- ; do z ++ , pa ( ) ; while ( 0 !== -- y ) ; z ++ } else z += y , y = 0 , r = g [ z ] & 255 , r = ( r << 5 ^ g [ z + 1 ] & 255 ) & 8191 ; else q = za ( 0 , g [ z ] & 255 ) , K -- , z ++ ; q && ( Aa ( 0 ) , x = z ) ; for ( ; 262 > K && ! E ; ) wa ( ) } else for ( ; 0 !== K && null === b ; ) { pa ( ) ; P = y ; D = R ; y = 2 ; 0 !== v && ( P < oa && 32506 >= z - v ) &&
( y = qa ( v ) , y > K && ( y = K ) , 3 === y && 4096 < z - R && y -- ) ; if ( 3 <= P && y <= P ) { q = za ( z - 1 - D , P - 3 ) ; K -= P - 1 ; P -= 2 ; do z ++ , pa ( ) ; while ( 0 !== -- P ) ; G = 0 ; y = 2 ; z ++ ; q && ( Aa ( 0 ) , x = z ) } else 0 !== G ? za ( 0 , g [ z - 1 ] & 255 ) && ( Aa ( 0 ) , x = z ) : G = 1 , z ++ , K -- ; for ( ; 262 > K && ! E ; ) wa ( ) } 0 === K && ( 0 !== G && za ( 0 , g [ z - 1 ] & 255 ) , Aa ( 1 ) , p = ! 0 ) ; return c+ Ka ( a , c + d , f - c ) } ; this . deflate = function ( l , c ) { var p , r ; B = l ; sa = 0 ; "undefined" === String ( typeof c ) && ( c = 6 ) ; ( p = c ) ? 1 > p ? p = 1 : 9 < p && ( p = 9 ) : p = 6 ; L = p ; E = e = ! 1 ; if ( null === d ) { h = b = f = null ; d = [ ] ; d . length = a ; g = [ ] ; g . length = 65536 ; q = [ ] ; q . length = 8192 ; s = [ ] ; s . length = 32832 ;
g ] = B . charCodeAt ( sa ++ ) & 255 ; return g } , wa = function ( ) { var a , b , d = 65536 - K - z ; if ( - 1 === d ) d -- ; else if ( 65274 <= z ) { for ( a = 0 ; 32768 > a ; a ++ ) g [ a ] = g [ a + 32768 ] ; R -= 32768 ; z -= 32768 ; x -= 32768 ; for ( a = 0 ; 8192 > a ; a ++ ) b = w [ 32768 + a ] , w [ 32768 + a ] = 32768 <= b ? b - 32768 : 0 ; for ( a = 0 ; 32768 > a ; a ++ ) b = w [ a ] , w [ a ] = 32768 <= b ? b - 32768 : 0 ; d += 32768 } E || ( a = Z ( g , z + K , d ) , 0 >= a ? E = ! 0 : K += a ) } , qa = function ( a ) { var b = X , d = z , l , c= P , e = 32506 < z ? z - 32506 : 0 , f = z + 258 , q = g [ d + c- 1 ] , p = g [ d + c ] ; P >= ra && ( b >>= 2 ) ; do if ( l = a , g [ l + c] === p && g [ l + c - 1 ] === q && g [ l ] === g [ d ] && g [ ++ l ] === g [ d + 1 ] ) { d += 2 ; l ++ ; do ++ d ; while ( g [ d ] ===
g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && g [ ++ d ] === g [ ++ l ] && d < f) ; l = 258 - ( f - d ) ; d = f - 258 ; if ( l > c ) { R = a ; c = l ; if ( 258 <= l ) break ; q = g [ d + c- 1 ] ; p = g [ d + c ] } a = w [ a & 32767 ] } while ( a > e&& 0 !== -- b ) ; return c } , za = function ( a , d ) { s [ T ++ ] = d ; 0 === a ? aa [ d ] . fc ++ : ( a -- , aa [ ca [ d ] + 256 + 1 ] . fc ++ , ea [ ( 256 > a ? ha [ a ] : ha [ 256 + ( a >> 7 ) ] ) & 255 ] . fc ++ , q [ ja ++ ] = a , U |= ma ) ; ma <<= 1 ; 0 === ( T & 7 ) && ( ia [ la ++ ] = U , U = 0 , ma = 1 ) ; if ( 2 < L && 0 === ( T & 4095 ) ) { var b = 8 * T , g = z - x , l ; for ( l = 0 ; 30 > l ; l ++ ) b += ea [ l ] . fc * ( 5 + ta [ l ] ) ; b >>= 3 ; if ( ja <
parseInt ( T / 2 , 10 ) && b < parseInt ( g / 2 , 10 ) ) return ! 0 } return 8191 === T || 8192 === ja } , Ba = function ( a , d ) { for ( var b = Q [ d ] , g = d << 1 ; g <= ba ; ) { g < ba && da ( a , Q [ g + 1 ] , Q [ g ] ) && g ++ ; if ( da ( a , b , Q [ g ] ) ) break ; Q [ d ] = Q [ g ] ; d = g ; g <<= 1 } Q [ d ] = b } , Da = function ( a , d ) { var b = 0 ; do b |= a & 1 , a >>= 1 , b <<= 1 ; while ( 0 < -- d ) ; return b >> 1 } , Ea = function ( a , d ) { var b = [ ] ; b . length = 16 ; var g = 0 , l ; for ( l = 1 ; 15 >= l ; l ++ ) g = g + I [ l - 1 ] << 1 , b [ l ] = g ; for ( g = 0 ; g <= d ; g ++ ) l = a [ g ] . dl , 0 !== l && ( a [ g ] . fc = Da ( b [ l ] ++ , l ) ) } , Ca = function ( a ) { var d = a . dyn _tree , b = a . static _tree , g = a . elems , l , c= - 1 , e = g ; ba = 0 ; fa = 573 ; for ( l =
0 ; l < g ; l ++ ) 0 !== d [ l ] . fc ? ( Q [ ++ ba ] = c = l , N [ l ] = 0 ) : d [ l ] . dl = 0 ; for ( ; 2 > ba ; ) l = Q [ ++ ba ] = 2 > c? ++ c : 0 , d [ l ] . fc = 1 , N [ l ] = 0 , W -- , null !== b && ( $ -= b [ l ] . dl ) ; a . max _code = c ; for ( l = ba >> 1 ; 1 <= l ; l -- ) Ba ( d , l ) ; do l = Q [ 1 ] , Q [ 1 ] = Q [ ba -- ] , Ba ( d , 1 ) , b = Q [ 1 ] , Q [ -- fa ] = l , Q [ -- fa ] = b , d [ e ] . fc = d [ l ] . fc + d [ b ] . fc , N [ e ] = N [ l ] > N [ b ] + 1 ? N [ l ] : N [ b ] + 1 , d [ l ] . dl = d [ b ] . dl = e, Q [ 1 ] = e ++ , Ba ( d , 1 ) ; while ( 2 <= ba ) ; Q [ -- fa ] = Q [ 1 ] ; e = a . dyn _tree ; l = a . extra _bits ; var g = a . extra _base , b = a . max _code , f = a . max _length , q = a . static _tree , p , h , r , k , u = 0 ; for ( h = 0 ; 15 >= h ; h ++ ) I [ h ] = 0 ; e [ Q [ fa ] ] . dl = 0 ; for ( a = fa + 1 ; 573 > a ; a ++ ) p =
Q [ a ] , h = e[ e [ p ] . dl ] . dl + 1 , h > f&& ( h = f , u ++ ) , e [ p ] . dl = h , p > b || ( I [ h ] ++ , r = 0 , p >= g && ( r = l [ p - g ] ) , k = e [ p ] . fc , W += k * ( h + r ) , null !== q && ( $ += k * ( q [ p ] . dl + r ) ) ) ; if ( 0 !== u ) { do { for ( h = f - 1 ; 0 === I [ h ] ; ) h -- ; I [ h ] -- ; I [ h + 1 ] += 2 ; I [ f ] -- ; u -= 2 } while ( 0 < u ) ; for ( h = f ; 0 !== h ; h -- ) for ( p = I [ h ] ; 0 !== p ; ) l = Q [ -- a ] , l > b || ( e [ l ] . dl !== h && ( W += ( h - e[ l ] . dl ) * e [ l ] . fc , e [ l ] . fc = h ) , p -- ) } Ea ( d , c ) } , Fa = function ( a , d ) { var b , g = - 1 , l , c= a [ 0 ] . dl , e = 0 , f = 7 , h = 4 ; 0 === c && ( f = 138 , h = 3 ) ; a [ d + 1 ] . dl = 65535 ; for ( b = 0 ; b <= d ; b ++ ) l = c, c = a [ b + 1 ] . dl , ++ e< f && l === c || ( e < h ? S [ l ] . fc += e : 0 !== l ? ( l !== g && S [ l ] . fc ++ , S [ 16 ] . fc ++ ) :
10 >= e ? S [ 17 ] . fc ++ : S [ 18 ] . fc ++ , e= 0 , g = l , 0 === c ? ( f = 138 , h = 3 ) : l === c? ( f = 6 , h = 3 ) : ( f = 7 , h = 4 ) ) } , Ga = function ( ) { 8 < A ? na ( u ) : 0 < A && va ( u ) ; A = u = 0 } , Ha = function ( a , d ) { var b , g = 0 , l = 0 , c= 0 , e= 0 , f , h ; if ( 0 !== T ) { do 0 === ( g & 7 ) && ( e= ia [ c ++ ] ) , b = s [ g ++ ] & 255 , 0 === ( e & 1 ) ? Y ( b , a ) : ( f= ca [ b ] , Y ( f + 256 + 1 , a ) , h = ya [ f ] , 0 !== h && ( b -= C [ f ] , ga ( b , h ) ) , b = q [ l ++ ] , f = ( 256 > b ? ha [ b ] : ha [ 256 + ( b >> 7 ) ] ) & 255 , Y ( f, d ) , h = ta [ f ] , 0 !== h && ( b -= ka [ f ] , ga ( b , h ) ) ) , e >>= 1 ; while ( g < T ) } Y ( 256 , a ) } , Ia = function ( a , b ) { var d , g = - 1 , l , c = a [ 0 ] . dl , e = 0 , f= 7 , h = 4 ; 0 === c && ( f = 138 , h = 3 ) ; for ( d = 0 ; d <= b ; d ++ ) if ( l = c, c = a [ d +
1 ] . dl , ! ( ++ e < f&& l === c ) ) { if ( e < h ) { do Y ( l , S ) ; while ( 0 !== -- e ) } else 0 !== l ? ( l !== g && ( Y ( l , S ) , e -- ) , Y ( 16 , S ) , ga ( e - 3 , 2 ) ) : 10 >= e ? ( Y ( 17 , S ) , ga ( e - 3 , 3 ) ) : ( Y ( 18 , S ) , ga ( e - 11 , 7 ) ) ; e = 0 ; g = l ; 0 === c? ( f = 138 , h = 3 ) : l === c? ( f = 6 , h = 3 ) : ( f = 7 , h = 4 ) } } , Ja = function ( ) { var a ; for ( a = 0 ; 286 > a ; a ++ ) aa [ a ] . fc = 0 ; for ( a = 0 ; 30 > a ; a ++ ) ea [ a ] . fc = 0 ; for ( a = 0 ; 19 > a ; a ++ ) S [ a ] . fc = 0 ; aa [ 256 ] . fc = 1 ; U = T = ja = la = W = $ = 0 ; ma = 1 } , Aa = function ( a ) { var b , d , l , c; c = z - x ; ia [ la ] = U ; Ca ( M ) ; Ca ( H ) ; Fa ( aa , M . max _code ) ; Fa ( ea , H . max _code ) ; Ca ( F ) ; for ( l = 18 ; 3 <= l && 0 === S [ J [ l ] ] . dl ; l -- ) ; W += 3 * ( l + 1 ) + 14 ; b = W + 3 + 7 >>
3 ; d = $ + 3 + 7 >> 3 ; d <= b && ( b = d ) ; if ( c + 4 <= b && 0 <= x ) for ( ga ( 0 + a , 3 ) , Ga ( ) , na ( c) , na ( ~ c ) , l = 0 ; l < c ; l ++ ) va ( g [ x + l ] ) ; else if ( d === b ) ga ( 2 + a , 3 ) , Ha ( O , V ) ; else { ga ( 4 + a , 3 ) ; c = M . max _code + 1 ; b = H . max _code + 1 ; l += 1 ; ga ( c - 257 , 5 ) ; ga ( b - 1 , 5 ) ; ga ( l - 4 , 4 ) ; for ( d = 0 ; d < l ; d ++ ) ga ( S [ J [ d ] ] . dl , 3 ) ; Ia ( aa , c - 1 ) ; Ia ( ea , b - 1 ) ; Ha ( aa , ea ) } Ja ( ) ; 0 !== a && Ga ( ) } , Ka = function ( a , g , c) { var e , f , p ; for ( e = 0 ; null !== b && e < c ; ) { f = c - e ; f > b . len && ( f = b . len ) ; for ( p = 0 ; p < f; p ++ ) a [ g + e + p ] = b . ptr [ b . off + p ] ; b . off += f; b . len -= f ; e += f ; 0 === b . len && ( f = b , b = b . next , f . next = h , h = f ) } if ( e === c ) return e ; if ( l < t ) { f =
c- e ; f > t - l && ( f = t - l ) ; for ( p = 0 ; p < f; p ++ ) a [ g + e + p ] = d [ l + p ] ; l += f; e += f ; t === l && ( t = l = 0 ) } return e } , La = function ( a , d , c) { var f ; if ( ! e ) { if ( ! E ) { A = u = 0 ; var h , q ; if ( 0 === V [ 0 ] . dl ) { M . dyn _tree = aa ; M . static _tree = O ; M . extra _bits = ya ; M . extra _base = 257 ; M . elems = 286 ; M . max _length = 15 ; M . max _code = 0 ; H . dyn _tree = ea ; H . static _tree = V ; H . extra _bits = ta ; H . extra _base = 0 ; H . elems = 30 ; H . max _length = 15 ; H . max _code = 0 ; F . dyn _tree = S ; F . static _tree = null ; F . extra _bits = xa ; F . extra _base = 0 ; F . elems = 19 ; F . max _length = 7 ; for ( q = h = F . max _code = 0 ; 28 > q ; q ++ ) for ( C [ q ] = h , f= 0 ; f < 1 << ya [ q ] ; f ++ ) ca [ h ++ ] =
q ; ca [ h - 1 ] = q ; for ( q = h = 0 ; 16 > q ; q ++ ) for ( ka [ q ] = h , f= 0 ; f < 1 << ta [ q ] ; f ++ ) ha [ h ++ ] = q ; for ( h >>= 7 ; 30 > q ; q ++ ) for ( ka [ q ] = h << 7 , f= 0 ; f < 1 << ta [ q ] - 7 ; f ++ ) ha [ 256 + h ++ ] = q ; for ( f= 0 ; 15 >= f ; f ++ ) I [ f ] = 0 ; for ( f = 0 ; 143 >= f ; ) O [ f ++ ] . dl = 8 , I [ 8 ] ++ ; for ( ; 255 >= f; ) O [ f ++ ] . dl = 9 , I [ 9 ] ++ ; for ( ; 279 >= f; ) O [ f ++ ] . dl = 7 , I [ 7 ] ++ ; for ( ; 287 >= f; ) O [ f ++ ] . dl = 8 , I [ 8 ] ++ ; Ea ( O , 287 ) ; for ( f= 0 ; 30 > f ; f ++ ) V [ f ] . dl = 5 , V [ f ] . fc = Da ( f , 5 ) ; Ja ( ) } for ( f= 0 ; 8192 > f ; f ++ ) w [ 32768 + f ] = 0 ; oa = ua [ L ] . max _lazy ; ra = ua [ L ] . good _length ; X = ua [ L ] . max _chain ; x = z = 0 ; K = Z ( g , 0 , 65536 ) ; if ( 0 >= K ) E = ! 0 , K = 0 ; else { for ( E = ! 1 ; 262 > K &&
! E ; ) wa ( ) ; for ( f= r = 0 ; 2 > f ; f ++ ) r = ( r << 5 ^ g [ f ] & 255 ) & 8191 } b = null ; l = t = 0 ; 3 >= L ? ( P = 2 , y = 0 ) : ( y = 2 , G = 0 ) ; p = ! 1 } e = ! 0 ; if ( 0 === K ) return p = ! 0 , 0 } f= Ka ( a , d , c ) ; if ( f === c ) return c ; if ( p ) return f ; if ( 3 >= L ) for ( ; 0 !== K && null === b ; ) { pa ( ) ; 0 !== v && 32506 >= z - v && ( y = qa ( v ) , y > K && ( y = K ) ) ; if ( 3 <= y ) if ( q = za ( z - R , y - 3 ) , K -= y , y <= oa ) { y -- ; do z ++ , pa ( ) ; while ( 0 !== -- y ) ; z ++ } else z += y , y = 0 , r = g [ z ] & 255 , r = ( r << 5 ^ g [ z + 1 ] & 255 ) & 8191 ; else q = za ( 0 , g [ z ] & 255 ) , K -- , z ++ ; q && ( Aa ( 0 ) , x = z ) ; for ( ; 262 > K && ! E ; ) wa ( ) } else for ( ; 0 !== K && null === b ; ) { pa ( ) ; P = y ; D = R ; y = 2 ; 0 !== v && ( P < oa && 32506 >= z - v ) &&
( y = qa ( v ) , y > K && ( y = K ) , 3 === y && 4096 < z - R && y -- ) ; if ( 3 <= P && y <= P ) { q = za ( z - 1 - D , P - 3 ) ; K -= P - 1 ; P -= 2 ; do z ++ , pa ( ) ; while ( 0 !== -- P ) ; G = 0 ; y = 2 ; z ++ ; q && ( Aa ( 0 ) , x = z ) } else 0 !== G ? za ( 0 , g [ z - 1 ] & 255 ) && ( Aa ( 0 ) , x = z ) : G = 1 , z ++ , K -- ; for ( ; 262 > K && ! E ; ) wa ( ) } 0 === K && ( 0 !== G && za ( 0 , g [ z - 1 ] & 255 ) , Aa ( 1 ) , p = ! 0 ) ; return f+ Ka ( a , f + d , c - f ) } ; this . deflate = function ( l , c ) { var p , r ; B = l ; sa = 0 ; "undefined" === String ( typeof c ) && ( c = 6 ) ; ( p = c ) ? 1 > p ? p = 1 : 9 < p && ( p = 9 ) : p = 6 ; L = p ; E = e = ! 1 ; if ( null === d ) { h = b = f = null ; d = [ ] ; d . length = a ; g = [ ] ; g . length = 65536 ; q = [ ] ; q . length = 8192 ; s = [ ] ; s . length = 32832 ;
w = [ ] ; w . length = 65536 ; aa = [ ] ; aa . length = 573 ; for ( p = 0 ; 573 > p ; p ++ ) aa [ p ] = new m ; ea = [ ] ; ea . length = 61 ; for ( p = 0 ; 61 > p ; p ++ ) ea [ p ] = new m ; O = [ ] ; O . length = 288 ; for ( p = 0 ; 288 > p ; p ++ ) O [ p ] = new m ; V = [ ] ; V . length = 30 ; for ( p = 0 ; 30 > p ; p ++ ) V [ p ] = new m ; S = [ ] ; S . length = 39 ; for ( p = 0 ; 39 > p ; p ++ ) S [ p ] = new m ; M = new n ; H = new n ; F = new n ; I = [ ] ; I . length = 16 ; Q = [ ] ; Q . length = 573 ; N = [ ] ; N . length = 573 ; ca = [ ] ; ca . length = 256 ; ha = [ ] ; ha . length = 512 ; C = [ ] ; C . length = 29 ; ka = [ ] ; ka . length = 30 ; ia = [ ] ; ia . length = 1024 } var k = Array ( 1024 ) , u = [ ] , v = [ ] ; for ( p = La ( k , 0 , k . length ) ; 0 < p ; ) { v . length = p ; for ( r =
0 ; r < p ; r ++ ) v [ r ] = String . fromCharCode ( k [ r ] ) ; u [ u . length ] = v . join ( "" ) ; p = La ( k , 0 , k . length ) } B = null ; return u . join ( "" ) } } ;
// Input 4
@ -100,9 +100,9 @@ core.ByteArrayWriter=function(m){var n=this,k=new runtime.ByteArray(0);this.appe
runtime . byteArrayFromString ( c , m ) ) } ; this . getLength = function ( ) { return k . length } ; this . getByteArray = function ( ) { return k } } ;
// Input 6
core . RawInflate = function ( ) { var m , n , k = null , c , a , h , b , f , e , d , t , l , p , g , q , s , w , u = [ 0 , 1 , 3 , 7 , 15 , 31 , 63 , 127 , 255 , 511 , 1023 , 2047 , 4095 , 8191 , 16383 , 32767 , 65535 ] , A = [ 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 13 , 15 , 17 , 19 , 23 , 27 , 31 , 35 , 43 , 51 , 59 , 67 , 83 , 99 , 115 , 131 , 163 , 195 , 227 , 258 , 0 , 0 ] , x = [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 1 , 2 , 2 , 2 , 2 , 3 , 3 , 3 , 3 , 4 , 4 , 4 , 4 , 5 , 5 , 5 , 5 , 0 , 99 , 99 ] , r = [ 1 , 2 , 3 , 4 , 5 , 7 , 9 , 13 , 17 , 25 , 33 , 49 , 65 , 97 , 129 , 193 , 257 , 385 , 513 , 769 , 1025 , 1537 , 2049 , 3073 , 4097 , 6145 , 8193 , 12289 , 16385 , 24577 ] , v = [ 0 , 0 , 0 , 0 , 1 , 1 , 2 , 2 , 3 , 3 , 4 , 4 , 5 , 5 , 6 , 6 , 7 , 7 , 8 , 8 , 9 , 9 , 10 , 10 , 11 , 11 , 12 , 12 , 13 , 13 ] , D = [ 16 , 17 , 18 ,
0 , 8 , 7 , 9 , 6 , 10 , 5 , 11 , 4 , 12 , 3 , 13 , 2 , 14 , 1 , 15 ] , G = function ( ) { this . list = this . next = null } , y = function ( ) { this . n = this . b = this . e = 0 ; this . t = null } , P = function ( a , b , d , l , g , c ) { this . BMAX = 16 ; this . N _MAX = 288 ; this . status = 0 ; this . root = null ; this . m = 0 ; var f = Array ( this . BMAX + 1 ) , e , p , h , q , r , k , u , s = Array ( this . BMAX + 1 ) , m , n , v , w = new y , t = Array ( this . BMAX ) ; q = Array ( this . N _MAX ) ; var x , A = Array ( this . BMAX + 1 ) , X , z , D ; D = this . root = null ; for ( r = 0 ; r < f. length ; r ++ ) f [ r ] = 0 ; for ( r = 0 ; r < s . length ; r ++ ) s [ r ] = 0 ; for ( r = 0 ; r < t . length ; r ++ ) t [ r ] = null ; for ( r = 0 ; r < q . length ; r ++ ) q [ r ] =
0 ; for ( r = 0 ; r < A . length ; r ++ ) A [ r ] = 0 ; e = 256 < b ? a [ 256 ] : this . BMAX ; m = a ; n = 0 ; r = b ; do f [ m [ n ] ] ++ , n ++ ; while ( 0 < -- r ) ; if ( f [ 0 ] == b ) this . root = null , this . status = this . m = 0 ; else { for ( k = 1 ; k <= this . BMAX && 0 == f [ k ] ; k ++ ) ; u = k ; c< k && ( c = k ) ; for ( r = this . BMAX ; 0 != r && 0 == f [ r ] ; r -- ) ; h = r ; c> r && ( c = r ) ; for ( X = 1 << k ; k < r ; k ++ , X <<= 1 ) if ( 0 > ( X -= f [ k ] ) ) { this . status = 2 ; this . m = c ; return } if ( 0 > ( X -= f [ r ] ) ) this . status = 2 , this . m = c; else { f [ r ] += X ; A [ 1 ] = k = 0 ; m = f ; n = 1 ; for ( v = 2 ; 0 < -- r ; ) A [ v ++ ] = k += m [ n ++ ] ; m = a ; r = n = 0 ; do 0 != ( k = m [ n ++ ] ) && ( q [ A [ k ] ++ ] = r ) ; while ( ++ r < b ) ; b = A [ h ] ; A [ 0 ] = r = 0 ; m = q ; n = 0 ;
q = - 1 ; x = s [ 0 ] = 0 ; v = null ; for ( z = 0 ; u <= h ; u ++ ) for ( a = f [ u ] ; 0 < a -- ; ) { for ( ; u > x + s [ 1 + q ] ; ) { x += s [ 1 + q ] ; q ++ ; z = ( z = h - x ) > c? c : z ; if ( ( p = 1 << ( k = u - x ) ) > a + 1 ) for ( p -= a + 1 , v = u ; ++ k < z && ! ( ( p <<= 1 ) <= f[ ++ v ] ) ; ) p -= f [ v ] ; x + k > e && x < e && ( k = e - x ) ; z = 1 << k ; s [ 1 + q ] = k ; v = Array ( z ) ; for ( p = 0 ; p < z ; p ++ ) v [ p ] = new y ; D = null == D ? this . root = new G : D . next = new G ; D . next = null ; D . list = v ; t [ q ] = v ; 0 < q && ( A [ q ] = r , w . b = s [ q ] , w . e = 16 + k , w . t = v , k = ( r & ( 1 << x ) - 1 ) >> x - s [ q ] , t [ q - 1 ] [ k ] . e = w . e , t [ q - 1 ] [ k ] . b = w . b , t [ q - 1 ] [ k ] . n = w . n , t [ q - 1 ] [ k ] . t = w . t ) } w . b = u - x ; n >= b ? w . e = 99 : m [ n ] < d ? ( w . e = 256 > m [ n ] ? 16 : 15 , w . n = m [ n ++ ] ) :
0 , 8 , 7 , 9 , 6 , 10 , 5 , 11 , 4 , 12 , 3 , 13 , 2 , 14 , 1 , 15 ] , G = function ( ) { this . list = this . next = null } , y = function ( ) { this . n = this . b = this . e = 0 ; this . t = null } , P = function ( a , b , d , l , g , f ) { this . BMAX = 16 ; this . N _MAX = 288 ; this . status = 0 ; this . root = null ; this . m = 0 ; var c = Array ( this . BMAX + 1 ) , e , p , h , q , r , k , u , s = Array ( this . BMAX + 1 ) , m , n , v , w = new y , t = Array ( this . BMAX ) ; q = Array ( this . N _MAX ) ; var x , A = Array ( this . BMAX + 1 ) , X , z , D ; D = this . root = null ; for ( r = 0 ; r < c. length ; r ++ ) c [ r ] = 0 ; for ( r = 0 ; r < s . length ; r ++ ) s [ r ] = 0 ; for ( r = 0 ; r < t . length ; r ++ ) t [ r ] = null ; for ( r = 0 ; r < q . length ; r ++ ) q [ r ] =
0 ; for ( r = 0 ; r < A . length ; r ++ ) A [ r ] = 0 ; e = 256 < b ? a [ 256 ] : this . BMAX ; m = a ; n = 0 ; r = b ; do c [ m [ n ] ] ++ , n ++ ; while ( 0 < -- r ) ; if ( c [ 0 ] == b ) this . root = null , this . status = this . m = 0 ; else { for ( k = 1 ; k <= this . BMAX && 0 == c [ k ] ; k ++ ) ; u = k ; f< k && ( f = k ) ; for ( r = this . BMAX ; 0 != r && 0 == c [ r ] ; r -- ) ; h = r ; f> r && ( f = r ) ; for ( X = 1 << k ; k < r ; k ++ , X <<= 1 ) if ( 0 > ( X -= c [ k ] ) ) { this . status = 2 ; this . m = f ; return } if ( 0 > ( X -= c [ r ] ) ) this . status = 2 , this . m = f; else { c [ r ] += X ; A [ 1 ] = k = 0 ; m = c ; n = 1 ; for ( v = 2 ; 0 < -- r ; ) A [ v ++ ] = k += m [ n ++ ] ; m = a ; r = n = 0 ; do 0 != ( k = m [ n ++ ] ) && ( q [ A [ k ] ++ ] = r ) ; while ( ++ r < b ) ; b = A [ h ] ; A [ 0 ] = r = 0 ; m = q ; n = 0 ;
q = - 1 ; x = s [ 0 ] = 0 ; v = null ; for ( z = 0 ; u <= h ; u ++ ) for ( a = c [ u ] ; 0 < a -- ; ) { for ( ; u > x + s [ 1 + q ] ; ) { x += s [ 1 + q ] ; q ++ ; z = ( z = h - x ) > f? f : z ; if ( ( p = 1 << ( k = u - x ) ) > a + 1 ) for ( p -= a + 1 , v = u ; ++ k < z && ! ( ( p <<= 1 ) <= c[ ++ v ] ) ; ) p -= c [ v ] ; x + k > e && x < e && ( k = e - x ) ; z = 1 << k ; s [ 1 + q ] = k ; v = Array ( z ) ; for ( p = 0 ; p < z ; p ++ ) v [ p ] = new y ; D = null == D ? this . root = new G : D . next = new G ; D . next = null ; D . list = v ; t [ q ] = v ; 0 < q && ( A [ q ] = r , w . b = s [ q ] , w . e = 16 + k , w . t = v , k = ( r & ( 1 << x ) - 1 ) >> x - s [ q ] , t [ q - 1 ] [ k ] . e = w . e , t [ q - 1 ] [ k ] . b = w . b , t [ q - 1 ] [ k ] . n = w . n , t [ q - 1 ] [ k ] . t = w . t ) } w . b = u - x ; n >= b ? w . e = 99 : m [ n ] < d ? ( w . e = 256 > m [ n ] ? 16 : 15 , w . n = m [ n ++ ] ) :
( w . e = g [ m [ n ] - d ] , w . n = l [ m [ n ++ ] - d ] ) ; p = 1 << u - x ; for ( k = r >> x ; k < z ; k += p ) v [ k ] . e = w . e , v [ k ] . b = w . b , v [ k ] . n = w . n , v [ k ] . t = w . t ; for ( k = 1 << u - 1 ; 0 != ( r & k ) ; k >>= 1 ) r ^= k ; for ( r ^= k ; ( r & ( 1 << x ) - 1 ) != A [ q ] ; ) x -= s [ q ] , q -- } this . m = s [ 1 ] ; this . status = 0 != X && 1 != h ? 1 : 0 } } } , z = function ( a ) { for ( ; b < a ; ) { var d = h , l ; l = s . length == w ? - 1 : s [ w ++ ] ; h = d | l << b ; b += 8 } } , R = function ( a ) { return h & u [ a ] } , E = function ( a ) { h >>= a ; b -= a } , K = function ( a , b , c ) { var e , h , r ; if ( 0 == c ) return 0 ; for ( r = 0 ; ; ) { z ( g ) ; h = l . list [ R ( g ) ] ; for ( e = h . e ; 16 < e ; ) { if ( 99 == e ) return - 1 ; E ( h . b ) ; e -= 16 ; z ( e ) ; h = h . t [ R ( e ) ] ; e = h . e } E ( h . b ) ;
if ( 16 == e ) n &= 32767 , a [ b + r ++ ] = m [ n ++ ] = h . n ; else { if ( 15 == e ) break ; z ( e ) ; d = h . n + R ( e ) ; E ( e ) ; z ( q ) ; h = p . list [ R ( q ) ] ; for ( e = h . e ; 16 < e ; ) { if ( 99 == e ) return - 1 ; E ( h . b ) ; e -= 16 ; z ( e ) ; h = h . t [ R ( e ) ] ; e = h . e } E ( h . b ) ; z ( e ) ; t = n - h . n - R ( e ) ; for ( E ( e ) ; 0 < d && r < c ; ) d -- , t &= 32767 , n &= 32767 , a [ b + r ++ ] = m [ n ++ ] = m [ t ++ ] } if ( r == c ) return c } f = - 1 ; return r } , X , oa = function ( a , b , d ) { var c , e , f , h , k , u , s , m = Array ( 316 ) ; for ( c = 0 ; c < m . length ; c ++ ) m [ c ] = 0 ; z ( 5 ) ; u = 257 + R ( 5 ) ; E ( 5 ) ; z ( 5 ) ; s = 1 + R ( 5 ) ; E ( 5 ) ; z ( 4 ) ; c = 4 + R ( 4 ) ; E ( 4 ) ; if ( 286 < u || 30 < s ) return - 1 ; for ( e = 0 ; e < c ; e ++ ) z ( 3 ) , m [ D [ e ] ] = R ( 3 ) , E ( 3 ) ; for ( ; 19 >
e ; e ++ ) m [ D [ e ] ] = 0 ; g = 7 ; e = new P ( m , 19 , 19 , null , null , g ) ; if ( 0 != e . status ) return - 1 ; l = e . root ; g = e . m ; h = u + s ; for ( c = f = 0 ; c < h ; ) if ( z ( g ) , k = l . list [ R ( g ) ] , e = k . b , E ( e ) , e = k . n , 16 > e ) m [ c ++ ] = f = e ; else if ( 16 == e ) { z ( 2 ) ; e = 3 + R ( 2 ) ; E ( 2 ) ; if ( c + e > h ) return - 1 ; for ( ; 0 < e -- ; ) m [ c ++ ] = f } else { 17 == e ? ( z ( 3 ) , e = 3 + R ( 3 ) , E ( 3 ) ) : ( z ( 7 ) , e = 11 + R ( 7 ) , E ( 7 ) ) ; if ( c + e > h ) return - 1 ; for ( ; 0 < e -- ; ) m [ c ++ ] = 0 ; f = 0 } g = 9 ; e = new P ( m , u , 257 , A , x , g ) ; 0 == g && ( e . status = 1 ) ; if ( 0 != e . status ) return - 1 ; l = e . root ; g = e . m ; for ( c = 0 ; c < s ; c ++ ) m [ c ] = m [ c + u ] ; q = 6 ; e = new P ( m , s , 0 , r , v , q ) ; p = e . root ; q = e . m ; return 0 == q &&
@ -247,8 +247,8 @@ new core.ByteArray(d),l,f;g=[];for(l=0;l<s;l+=1){f=new h(m,c);if(f.error){b(f.er
d . appendUInt16LE ( 0 ) ; d . appendString ( b . filename ) ; b . data && d . appendByteArray ( b . data ) ; return d } function d ( b , d ) { var g = new core . ByteArrayWriter ( "utf8" ) , c = 0 ; g . appendArray ( [ 80 , 75 , 1 , 2 , 20 , 0 , 20 , 0 , 0 , 0 , 0 , 0 ] ) ; b . data && ( c = b . data . length ) ; g . appendUInt32LE ( a ( b . date ) ) ; g . appendUInt32LE ( k ( b . data ) ) ; g . appendUInt32LE ( c ) ; g . appendUInt32LE ( c ) ; g . appendUInt16LE ( b . filename . length ) ; g . appendArray ( [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] ) ; g . appendUInt32LE ( d ) ; g . appendString ( b . filename ) ; return g } function t ( a , b ) { if ( a === g . length ) b ( null ) ; else { var d = g [ a ] ;
void 0 !== d . data ? t ( a + 1 , b ) : d . load ( function ( d ) { d ? b ( d ) : t ( a + 1 , b ) } ) } } function l ( a , b ) { t ( 0 , function ( c ) { if ( c ) b ( c ) ; else { c = new core . ByteArrayWriter ( "utf8" ) ; var l , f , h , q = [ 0 ] ; for ( l = 0 ; l < g . length ; l += 1 ) c . appendByteArrayWriter ( e ( g [ l ] ) ) , q . push ( c . getLength ( ) ) ; h = c . getLength ( ) ; for ( l = 0 ; l < g . length ; l += 1 ) f = g [ l ] , c . appendByteArrayWriter ( d ( f , q [ l ] ) ) ; l = c . getLength ( ) - h ; c . appendArray ( [ 80 , 75 , 5 , 6 , 0 , 0 , 0 , 0 ] ) ; c . appendUInt16LE ( g . length ) ; c . appendUInt16LE ( g . length ) ; c . appendUInt32LE ( l ) ; c . appendUInt32LE ( h ) ; c . appendArray ( [ 0 , 0 ] ) ; a ( c . getByteArray ( ) ) } } ) }
function p ( a , b ) { l ( function ( d ) { runtime . writeFile ( a , d , b ) } , b ) } var g , q , s , w = ( new core . RawInflate ) . inflate , u = this , A = new core . Base64 ; this . load = f ; this . save = function ( a , b , d , c ) { var l , f ; for ( l = 0 ; l < g . length ; l += 1 ) if ( f = g [ l ] , f . filename === a ) { f . set ( a , b , d , c ) ; return } f = new h ( m ) ; f . set ( a , b , d , c ) ; g . push ( f ) } ; this . write = function ( a ) { p ( m , a ) } ; this . writeAs = p ; this . createByteArray = l ; this . loadContentXmlAsFragments = function ( a , b ) { u . loadAsString ( a , function ( a , d ) { if ( a ) return b . rootElementReady ( a ) ; b . rootElementReady ( null , d , ! 0 ) } ) } ; this . loadAsString =
function ( a , b ) { f ( a , function ( a , d ) { if ( a || null === d ) return b ( a , null ) ; var c = runtime . byteArrayToString ( d , "utf8" ) ; b ( null , c ) } ) } ; this . loadAsDOM = function ( a , b ) { u . loadAsString ( a , function ( a , d ) { if ( a || null === d ) b ( a , null ) ; else { var c = ( new DOMParser ) . parseFromString ( d , "text/xml" ) ; b ( null , c ) } } ) } ; this . loadAsDataURL = function ( a , b , d ) { f ( a , function ( a , c ) { if ( a ) return d ( a , null ) ; var g = 0 , l ; b || ( b = 80 === c[ 1 ] && 78 === c [ 2 ] && 71 === c [ 3 ] ? "image/png" : 255 === c[ 0 ] && 216 === c [ 1 ] && 255 === c [ 2 ] ? "image/jpeg" : 71 === c[ 0 ] && 73 === c [ 1 ] && 70 === c [ 2 ] ? "image/gif" :
"" ) ; for ( l = "data:" + b + ";base64," ; g< c . length ; ) l += A . convertUTF8ArrayToBase64 ( c. slice ( g , Math . min ( g + 45E3 , c . length ) ) ) , g += 45E3 ; d ( null , l ) } ) } ; this . getEntries = function ( ) { return g . slice ( ) } ; q = - 1 ; null === n ? g = [ ] : runtime . getFileSize ( m , function ( a ) { q = a ; 0 > q ? n ( "File '" + m + "' cannot be read." , u ) : runtime . read ( m , q - 22 , 22 , function ( a , d ) { a || null === n || null === d ? n ( a , u ) : b ( d , n ) } ) } ) } ;
function ( a , b ) { f ( a , function ( a , d ) { if ( a || null === d ) return b ( a , null ) ; var g = runtime . byteArrayToString ( d , "utf8" ) ; b ( null , g ) } ) } ; this . loadAsDOM = function ( a , b ) { u . loadAsString ( a , function ( a , d ) { if ( a || null === d ) b ( a , null ) ; else { var g = ( new DOMParser ) . parseFromString ( d , "text/xml" ) ; b ( null , g ) } } ) } ; this . loadAsDataURL = function ( a , b , d ) { f ( a , function ( a , g ) { if ( a ) return d ( a , null ) ; var c = 0 , l ; b || ( b = 80 === g[ 1 ] && 78 === g [ 2 ] && 71 === g [ 3 ] ? "image/png" : 255 === g[ 0 ] && 216 === g [ 1 ] && 255 === g [ 2 ] ? "image/jpeg" : 71 === g[ 0 ] && 73 === g [ 1 ] && 70 === g [ 2 ] ? "image/gif" :
"" ) ; for ( l = "data:" + b + ";base64," ; c< g . length ; ) l += A . convertUTF8ArrayToBase64 ( g. slice ( c , Math . min ( c + 45E3 , g . length ) ) ) , c += 45E3 ; d ( null , l ) } ) } ; this . getEntries = function ( ) { return g . slice ( ) } ; q = - 1 ; null === n ? g = [ ] : runtime . getFileSize ( m , function ( a ) { q = a ; 0 > q ? n ( "File '" + m + "' cannot be read." , u ) : runtime . read ( m , q - 22 , 22 , function ( a , d ) { a || null === n || null === d ? n ( a , u ) : b ( d , n ) } ) } ) } ;
// Input 18
core . CSSUnits = function ( ) { var m = { "in" : 1 , cm : 2.54 , mm : 25.4 , pt : 72 , pc : 12 } ; this . convert = function ( n , k , c ) { return n * m [ c ] / m [ k ] } ; this . convertMeasure = function ( m , k ) { var c , a ; m && k ? ( c = parseFloat ( m ) , a = m . replace ( c . toString ( ) , "" ) , c = this . convert ( c , a , k ) ) : c = "" ; return c . toString ( ) } ; this . getUnits = function ( m ) { return m . substr ( m . length - 2 , m . length ) } } ;
// Input 19
@ -271,7 +271,7 @@ e:h}).e}]);2<h.length&&"element"===m&&(h=[h[0]].concat({name:"group",e:n({name:"
d . documentElement , l , void 0 ) , g , q , s = { } ; for ( g = 0 ; g < p . e . length ; g += 1 ) q = p . e [ g ] , "define" === q . name ? s [ q . a . name ] = q : "start" === q . name && ( b = q ) ; if ( ! b ) return [ new m ( "No Relax NG start element was found." ) ] ; c ( b , s ) ; for ( g in s ) s . hasOwnProperty ( g ) && c ( s [ g ] , s ) ; for ( g = 0 ; g < l . length ; g += 1 ) c ( l [ g ] , s ) ; k && ( h . rootPattern = k ( b . e [ 0 ] , l ) ) ; a ( b , l ) ; for ( g = 0 ; g < l . length ; g += 1 ) a ( l [ g ] , l ) ; h . start = b ; h . elements = l ; h . nsmap = f ; return null } } ;
// Input 22
runtime . loadClass ( "xmldom.RelaxNGParser" ) ;
xmldom . RelaxNG = function ( ) { function m ( a ) { return function ( ) { var b ; return function ( ) { void 0 === b && ( b = a ( ) ) ; return b } } ( ) } function n ( a , b ) { return function ( ) { var c= { } , d = 0 ; return function ( g ) { var f = g . hash || g . toString ( ) , l ; l = c [ f ] ; if ( void 0 !== l ) return l ; c [ f ] = l = b ( g ) ; l . hash = a + d. toString ( ) ; d += 1 ; return l } } ( ) } function k ( a ) { return function ( ) { var b = { } ; return function ( d ) { var c , g ; g = b [ d . localName ] ; if ( void 0 === g ) b [ d . localName ] = g = { } ; else if ( c = g [ d . namespaceURI ] , void 0 !== c ) return c ; return g [ d . namespaceURI ] = c = a ( d ) } } ( ) } function c ( a ,
xmldom . RelaxNG = function ( ) { function m ( a ) { return function ( ) { var b ; return function ( ) { void 0 === b && ( b = a ( ) ) ; return b } } ( ) } function n ( a , b ) { return function ( ) { var d= { } , c = 0 ; return function ( g ) { var f = g . hash || g . toString ( ) , l ; l = d [ f ] ; if ( void 0 !== l ) return l ; d [ f ] = l = b ( g ) ; l . hash = a + c. toString ( ) ; c += 1 ; return l } } ( ) } function k ( a ) { return function ( ) { var b = { } ; return function ( d ) { var c , g ; g = b [ d . localName ] ; if ( void 0 === g ) b [ d . localName ] = g = { } ; else if ( c = g [ d . namespaceURI ] , void 0 !== c ) return c ; return g [ d . namespaceURI ] = c = a ( d ) } } ( ) } function c ( a ,
b , d ) { return function ( ) { var c = { } , g = 0 ; return function ( f , l ) { var e = b && b ( f , l ) , h , q ; if ( void 0 !== e ) return e ; e = f . hash || f . toString ( ) ; h = l . hash || l . toString ( ) ; q = c [ e ] ; if ( void 0 === q ) c [ e ] = q = { } ; else if ( e = q [ h ] , void 0 !== e ) return e ; q [ h ] = e = d ( f , l ) ; e . hash = a + g . toString ( ) ; g += 1 ; return e } } ( ) } function a ( b , d ) { "choice" === d . p1 . type ? a ( b , d . p1 ) : b [ d . p1 . hash ] = d . p1 ; "choice" === d . p2 . type ? a ( b , d . p2 ) : b [ d . p2 . hash ] = d . p2 } function h ( a , b ) { return { type : "element" , nc : a , nullable : ! 1 , textDeriv : function ( ) { return r } , startTagOpenDeriv : function ( d ) { return a . contains ( d ) ?
g ( b , v ) : r } , attDeriv : function ( ) { return r } , startTagCloseDeriv : function ( ) { return this } } } function b ( ) { return { type : "list" , nullable : ! 1 , hash : "list" , textDeriv : function ( ) { return v } } } function f ( a , b , c , g ) { if ( b === r ) return r ; if ( g >= c . length ) return b ; 0 === g && ( g = 0 ) ; for ( var l = c . item ( g ) ; l . namespaceURI === d ; ) { g += 1 ; if ( g >= c . length ) return b ; l = c . item ( g ) } return l = f ( a , b . attDeriv ( a , c . item ( g ) ) , c , g + 1 ) } function e ( a , b , d ) { d . e [ 0 ] . a ? ( a . push ( d . e [ 0 ] . text ) , b . push ( d . e [ 0 ] . a . ns ) ) : e ( a , b , d . e [ 0 ] ) ; d . e [ 1 ] . a ? ( a . push ( d . e [ 1 ] . text ) , b . push ( d . e [ 1 ] . a . ns ) ) :
e ( a , b , d . e [ 1 ] ) } var d = "http://www.w3.org/2000/xmlns/" , t , l , p , g , q , s , w , u , A , x , r = { type : "notAllowed" , nullable : ! 1 , hash : "notAllowed" , textDeriv : function ( ) { return r } , startTagOpenDeriv : function ( ) { return r } , attDeriv : function ( ) { return r } , startTagCloseDeriv : function ( ) { return r } , endTagDeriv : function ( ) { return r } } , v = { type : "empty" , nullable : ! 0 , hash : "empty" , textDeriv : function ( ) { return r } , startTagOpenDeriv : function ( ) { return r } , attDeriv : function ( ) { return r } , startTagCloseDeriv : function ( ) { return v } , endTagDeriv : function ( ) { return r } } ,
@ -424,7 +424,7 @@ k.xlinkns="http://www.w3.org/1999/xlink";k.xmlns="http://www.w3.org/XML/1998/nam
// Input 28
runtime . loadClass ( "xmldom.XPath" ) ;
odf . StyleInfo = function ( ) { function m ( a , b ) { for ( var c = p [ a . localName ] , d = c && c [ a . namespaceURI ] , g = d ? d . length : 0 , e , c = 0 ; c < g ; c += 1 ) ( e = a . getAttributeNS ( d [ c ] . ns , d [ c ] . localname ) ) && a . setAttributeNS ( d [ c ] . ns , t [ d [ c ] . ns ] + d [ c ] . localname , b + e ) ; for ( c = a . firstChild ; c ; ) c . nodeType === Node . ELEMENT _NODE && ( d = c , m ( d , b ) ) , c = c . nextSibling } function n ( a , b ) { for ( var c = p [ a . localName ] , d = c && c [ a . namespaceURI ] , g = d ? d . length : 0 , e , c = 0 ; c < g ; c += 1 ) if ( e = a . getAttributeNS ( d [ c ] . ns , d [ c ] . localname ) ) e = e . replace ( b , "" ) , a . setAttributeNS ( d [ c ] . ns , t [ d [ c ] . ns ] + d [ c ] . localname ,
e ) ; for ( c = a . firstChild ; c ; ) c . nodeType === Node . ELEMENT _NODE && ( d = c , n ( d , b ) ) , c = c . nextSibling } function k ( a , b ) { var c = p [ a . localName ] , d = ( c = c && c [ a . namespaceURI ] ) ? c . length : 0 , g , e , h; for ( h = 0 ; h < d ; h += 1 ) if ( g = a . getAttributeNS ( c [ h] . ns , c [ h ] . localname ) ) b = b || { } , e = c [ h ] . keyname , e = b [ e ] = b [ e ] || { } , e [ g ] = 1 ; return b } function c ( a , b ) { var d , g ; k ( a , b ) ; for ( d = a . firstChild ; d ; ) d . nodeType === Node . ELEMENT _NODE && ( g = d , c ( g , b ) ) , d = d . nextSibling } function a ( a , b , c ) { this . key = a ; this . name = b ; this . family = c ; this . requires = { } } function h ( b , c , d ) { var g = b + '"' +
e ) ; for ( c = a . firstChild ; c ; ) c . nodeType === Node . ELEMENT _NODE && ( d = c , n ( d , b ) ) , c = c . nextSibling } function k ( a , b ) { var c = p [ a . localName ] , d = ( c = c && c [ a . namespaceURI ] ) ? c . length : 0 , g , e , f; for ( f = 0 ; f < d ; f += 1 ) if ( g = a . getAttributeNS ( c [ f] . ns , c [ f ] . localname ) ) b = b || { } , e = c [ f ] . keyname , e = b [ e ] = b [ e ] || { } , e [ g ] = 1 ; return b } function c ( a , b ) { var d , g ; k ( a , b ) ; for ( d = a . firstChild ; d ; ) d . nodeType === Node . ELEMENT _NODE && ( g = d , c ( g , b ) ) , d = d . nextSibling } function a ( a , b , c ) { this . key = a ; this . name = b ; this . family = c ; this . requires = { } } function h ( b , c , d ) { var g = b + '"' +
c , e = d [ g ] ; e || ( e = d [ g ] = new a ( g , b , c ) ) ; return e } function b ( a , c , g ) { var e = p [ a . localName ] , f = ( e = e && e [ a . namespaceURI ] ) ? e . length : 0 , l = a . getAttributeNS ( d , "name" ) , k = a . getAttributeNS ( d , "family" ) , m ; l && k && ( c = h ( l , k , g ) ) ; if ( c ) for ( l = 0 ; l < f ; l += 1 ) if ( k = a . getAttributeNS ( e [ l ] . ns , e [ l ] . localname ) ) m = e [ l ] . keyname , k = h ( k , m , g ) , c . requires [ k . key ] = k ; for ( l = a . firstChild ; l ; ) l . nodeType === Node . ELEMENT _NODE && ( a = l , b ( a , c , g ) ) , l = l . nextSibling ; return g } function f ( a , b ) { var c = b [ a . family ] ; c || ( c = b [ a . family ] = { } ) ; c [ a . name ] = 1 ; Object . keys ( a . requires ) . forEach ( function ( c ) { f ( a . requires [ c ] ,
b ) } ) } function e ( a , c ) { var d = b ( a , null , { } ) ; Object . keys ( d ) . forEach ( function ( a ) { a = d [ a ] ; var b = c [ a . family ] ; b && b . hasOwnProperty ( a . name ) && f ( a , c ) } ) } var d = "urn:oasis:names:tc:opendocument:xmlns:style:1.0" , t = { "urn:oasis:names:tc:opendocument:xmlns:chart:1.0" : "chart:" , "urn:oasis:names:tc:opendocument:xmlns:database:1.0" : "db:" , "urn:oasis:names:tc:opendocument:xmlns:dr3d:1.0" : "dr3d:" , "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" : "draw:" , "urn:oasis:names:tc:opendocument:xmlns:xsl-fo-compatible:1.0" : "fo:" , "urn:oasis:names:tc:opendocument:xmlns:form:1.0" : "form:" ,
"urn:oasis:names:tc:opendocument:xmlns:datastyle:1.0" : "number:" , "urn:oasis:names:tc:opendocument:xmlns:office:1.0" : "office:" , "urn:oasis:names:tc:opendocument:xmlns:presentation:1.0" : "presentation:" , "urn:oasis:names:tc:opendocument:xmlns:style:1.0" : "style:" , "urn:oasis:names:tc:opendocument:xmlns:svg-compatible:1.0" : "svg:" , "urn:oasis:names:tc:opendocument:xmlns:table:1.0" : "table:" , "urn:oasis:names:tc:opendocument:xmlns:text:1.0" : "chart:" , "http://www.w3.org/XML/1998/namespace" : "xml:" } , l = { text : [ { ens : d ,
@ -480,9 +480,9 @@ ans:d,a:"data-style-name"},{ens:"urn:oasis:names:tc:opendocument:xmlns:text:1.0"
a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "table-formula" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "time" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "user-defined" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "user-field-get" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "user-field-input" , ans : d , a : "data-style-name" } ,
{ ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "variable-get" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "variable-input" , ans : d , a : "data-style-name" } , { ens : "urn:oasis:names:tc:opendocument:xmlns:text:1.0" , en : "variable-set" , ans : d , a : "data-style-name" } ] , "page-layout" : [ { ens : "urn:oasis:names:tc:opendocument:xmlns:presentation:1.0" , en : "notes" , ans : d , a : "page-layout-name" } , { ens : d , en : "handout-master" , ans : d , a : "page-layout-name" } , { ens : d , en : "master-page" , ans : d ,
a : "page-layout-name" } ] } , p , g = new xmldom . XPath ; this . UsedStyleList = function ( a , b ) { var g = { } ; this . uses = function ( a ) { var b = a . localName , c = a . getAttributeNS ( "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" , "name" ) || a . getAttributeNS ( d , "name" ) ; a = "style" === b ? a . getAttributeNS ( d , "family" ) : "urn:oasis:names:tc:opendocument:xmlns:datastyle:1.0" === a . namespaceURI ? "data" : b ; return ( a = g [ a ] ) ? 0 < a [ c ] : ! 1 } ; c ( a , g ) ; b && e ( b , g ) } ; this . hasDerivedStyles = function ( a , b , c ) { var d = b ( "style" ) , e = c . getAttributeNS ( d , "name" ) ; c = c . getAttributeNS ( d ,
"family" ) ; return g . getODFElementsWithXPath ( a , "//style:*[@style:parent-style-name='" + e + "'][@style:family='" + c + "']" , b ) . length ? ! 0 : ! 1 } ; this . prefixStyleNames = function ( a , b , c ) { var g ; if ( a ) { for ( g = a . firstChild ; g ; ) { if ( g . nodeType === Node . ELEMENT _NODE ) { var e = g , h= b , f = e . getAttributeNS ( "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" , "name" ) , l = void 0 ; f ? l = "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" : ( f = e . getAttributeNS ( d , "name" ) ) && ( l = d ) ; l && e . setAttributeNS ( l , t [ l ] + "name" , h+ f ) } g = g . nextSibling } m ( a , b ) ; c && m ( c ,
b ) } } ; this . removePrefixFromStyleNames = function ( a , b , c ) { var g = RegExp ( "^" + b ) ; if ( a ) { for ( b = a . firstChild ; b ; ) { if ( b . nodeType === Node . ELEMENT _NODE ) { var e = b , h= g , f = e . getAttributeNS ( "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" , "name" ) , l = void 0 ; f ? l = "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" : ( f = e . getAttributeNS ( d , "name" ) ) && ( l = d ) ; l && ( f= f . replace ( h , "" ) , e . setAttributeNS ( l , t [ l ] + "name" , f ) ) } b = b . nextSibling } n ( a , g ) ; c && n ( c , g ) } } ; this . determineStylesForNode = k ; p = function ( a ) { var b , c , d , g , e , h= { } , f ; for ( b in a ) if ( a . hasOwnProperty ( b ) ) for ( g =
a [ b ] , d = g . length , c = 0 ; c < d ; c += 1 ) e = g [ c ] , f= h [ e . en ] = h [ e . en ] || { } , f = f [ e . ens ] = f [ e . ens ] || [ ] , f . push ( { ns : e . ans , localname : e . a , keyname : b } ) ; return h } ( l ) } ;
"family" ) ; return g . getODFElementsWithXPath ( a , "//style:*[@style:parent-style-name='" + e + "'][@style:family='" + c + "']" , b ) . length ? ! 0 : ! 1 } ; this . prefixStyleNames = function ( a , b , c ) { var g ; if ( a ) { for ( g = a . firstChild ; g ; ) { if ( g . nodeType === Node . ELEMENT _NODE ) { var e = g , f= b , h = e . getAttributeNS ( "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" , "name" ) , l = void 0 ; h ? l = "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" : ( h = e . getAttributeNS ( d , "name" ) ) && ( l = d ) ; l && e . setAttributeNS ( l , t [ l ] + "name" , f+ h ) } g = g . nextSibling } m ( a , b ) ; c && m ( c ,
b ) } } ; this . removePrefixFromStyleNames = function ( a , b , c ) { var g = RegExp ( "^" + b ) ; if ( a ) { for ( b = a . firstChild ; b ; ) { if ( b . nodeType === Node . ELEMENT _NODE ) { var e = b , f= g , h = e . getAttributeNS ( "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" , "name" ) , l = void 0 ; h ? l = "urn:oasis:names:tc:opendocument:xmlns:drawing:1.0" : ( h = e . getAttributeNS ( d , "name" ) ) && ( l = d ) ; l && ( h= h . replace ( f , "" ) , e . setAttributeNS ( l , t [ l ] + "name" , h ) ) } b = b . nextSibling } n ( a , g ) ; c && n ( c , g ) } } ; this . determineStylesForNode = k ; p = function ( a ) { var b , c , d , g , e , f= { } , h ; for ( b in a ) if ( a . hasOwnProperty ( b ) ) for ( g =
a [ b ] , d = g . length , c = 0 ; c < d ; c += 1 ) e = g [ c ] , h= f [ e . en ] = f [ e . en ] || { } , h = h [ e . ens ] = h [ e . ens ] || [ ] , h . push ( { ns : e . ans , localname : e . a , keyname : b } ) ; return f } ( l ) } ;
// Input 29
/ *
@ -527,7 +527,7 @@ odf.OdfUtils=function(){function m(a){var b=a&&a.localName;return("p"===b||"h"==
h ; this . lastChild = b ; this . previousNode = f ; this . nextNode = e ; this . scanLeftForNonWhitespace = d ; this . lookLeftForCharacter = function ( b ) { var c ; c = 0 ; b . nodeType === Node . TEXT _NODE && 0 < b . length ? ( c = b . data , c = k ( c . substr ( c . length - 1 , 1 ) ) ? 1 === c . length ? d ( f ( b ) ) ? 2 : 0 : k ( c . substr ( c . length - 2 , 1 ) ) ? 0 : 2 : 1 ) : a ( b ) && ( c = 1 ) ; return c } ; this . lookRightForCharacter = function ( b ) { var c = ! 1 ; b && b . nodeType === Node . TEXT _NODE && 0 < b . length ? c = ! k ( b . data . substr ( 0 , 1 ) ) : a ( b ) && ( c = ! 0 ) ; return c } ; this . scanLeftForAnyCharacter = function ( c ) { var d = ! 1 ; for ( c = c && b ( c ) ; c ; ) { if ( c . nodeType ===
Node . TEXT _NODE && 0 < c . length && ! k ( c . data ) ) { d = ! 0 ; break } if ( a ( c ) ) { d = ! 0 ; break } c = f ( c ) } return d } ; this . scanRightForAnyCharacter = t ; this . isTrailingWhitespace = l ; this . isSignificantWhitespace = p ; this . getFirstNonWhitespaceChild = function ( a ) { for ( a = a && a . firstChild ; a && a . nodeType === Node . TEXT _NODE && A . test ( a . nodeValue ) ; ) a = a . nextSibling ; return a } ; this . parseLength = g ; this . parseFoFontSize = function ( a ) { var b ; b = ( b = g ( a ) ) && ( 0 >= b . value || "%" === b . unit ) ? null : b ; return b || q ( a ) } ; this . parseFoLineHeight = function ( a ) { var b ; b = ( b = g ( a ) ) && ( 0 > b . value ||
"%" === b . unit ) ? null : b ; return b || q ( a ) } ; this . getImpactedParagraphs = function ( a ) { var b = a . commonAncestorContainer , c = [ ] ; for ( b . nodeType === Node . ELEMENT _NODE && ( c = x . getElementsByTagNameNS ( b , w , "p" ) . concat ( x . getElementsByTagNameNS ( b , w , "h" ) ) ) ; b && ! m ( b ) ; ) b = b . parentNode ; b && c . push ( b ) ; return c . filter ( function ( b ) { return x . rangeIntersectsNode ( a , b ) } ) } ; this . getTextNodes = function ( a , b ) { var c = a . startContainer . ownerDocument . createRange ( ) , d ; d = x . getNodesInRange ( a , function ( d ) { c . selectNodeContents ( d ) ; if ( d . nodeType === Node . TEXT _NODE ) { if ( b &&
x . rangesIntersect ( a , c ) || x . containsRange ( a , c ) ) return Boolean ( n ( d ) && ( ! k ( d . textContent ) || p ( d , 0 ) ) ) ? NodeFilter . FILTER _ACCEPT : NodeFilter . FILTER _REJECT } else if ( x . rangesIntersect ( a , c ) && s ( d ) ) return NodeFilter . FILTER _SKIP ; return NodeFilter . FILTER _REJECT } ) ; c . detach ( ) ; return d } ; this . getTextElements = function ( b , d ) { var g = b . startContainer . ownerDocument . createRange ( ) , e ; e = x . getNodesInRange ( b , function ( e ) { var h = e . nodeType ; g . selectNodeContents ( e ) ; if ( h === Node . TEXT _NODE ) { if ( x . containsRange ( b , g ) && ( d || Boolean ( n ( e ) && ( ! k ( e . textContent ) ||
x . rangesIntersect ( a , c ) || x . containsRange ( a , c ) ) return Boolean ( n ( d ) && ( ! k ( d . textContent ) || p ( d , 0 ) ) ) ? NodeFilter . FILTER _ACCEPT : NodeFilter . FILTER _REJECT } else if ( x . rangesIntersect ( a , c ) && s ( d ) ) return NodeFilter . FILTER _SKIP ; return NodeFilter . FILTER _REJECT } ) ; c . detach ( ) ; return d } ; this . getTextElements = function ( b , d ) { var g = b . startContainer . ownerDocument . createRange ( ) , e ; e = x . getNodesInRange ( b , function ( e ) { var f = e . nodeType ; g . selectNodeContents ( e ) ; if ( f === Node . TEXT _NODE ) { if ( x . containsRange ( b , g ) && ( d || Boolean ( n ( e ) && ( ! k ( e . textContent ) ||
p ( e , 0 ) ) ) ) ) return NodeFilter . FILTER _ACCEPT } else if ( a ( e ) ) { if ( x . containsRange ( b , g ) ) return NodeFilter . FILTER _ACCEPT } else if ( s ( e ) || c ( e ) ) return NodeFilter . FILTER _SKIP ; return NodeFilter . FILTER _REJECT } ) ; g . detach ( ) ; return e } ; this . getParagraphElements = function ( a ) { var b = a . startContainer . ownerDocument . createRange ( ) , d ; d = x . getNodesInRange ( a , function ( d ) { b . selectNodeContents ( d ) ; if ( m ( d ) ) { if ( x . rangesIntersect ( a , b ) ) return NodeFilter . FILTER _ACCEPT } else if ( s ( d ) || c ( d ) ) return NodeFilter . FILTER _SKIP ; return NodeFilter . FILTER _REJECT } ) ;
b . detach ( ) ; return d } } ;
// Input 30
@ -1411,8 +1411,8 @@ memberid:k,timestamp:c,styleName:a,setProperties:h}}};
@ source : http : //www.webodf.org/
@ source : http : //gitorious.org/webodf/webodf/
* /
ops . OpRemoveParagraphStyle = function ( ) { function m ( c ) { var b = [ ] ; c && [ "style:parent-style-name" , "style:next-style-name" ] . forEach ( function ( f ) { c [ f ] === a && b . push ( f ) } ) ; return b } var n = this , k , c , a ; this . init = function ( h ) { k = h . memberid ; c = h . timestamp ; a = h . styleName } ; this . transform = function ( c, b ) { var f = c . spec ( ) , e , d ; e = [ n ] ; switch ( f . optype ) { case "RemoveParagraphStyle" : f . styleName === a && ( e = [ ] ) ; break ; case "AddParagraphStyle" : case "UpdateParagraphStyle" : d = m ( f . setProperties ) ; 0 < d . length && ( e = new ops . OpUpdateParagraphStyle , e . init ( { styleName: f . styleName ,
removedProperties : { attributes : d . join ( "," ) } } ) , e = [ e , n ] ) ; break ; case "SetParagraphStyle" : f . styleName === a && ( f . styleName = "" , e = new ops . OpSetParagraphStyle , e . init ( f ) , e = [ e , n ] ) } return e } ; this . execute = function ( c ) { var b = c . getParagraphStyleElement ( a ) ; if ( ! b ) return ! 1 ; b . parentNode . removeChild ( b ) ; c . getOdfCanvas ( ) . refreshCSS ( ) ; c . emit ( ops . OdtDocument . signalStyleDeleted , a ) ; return ! 0 } ; this . spec = function ( ) { return { optype : "RemoveParagraphStyle" , memberid : k , timestamp : c , styleName : a } } } ;
ops . OpRemoveParagraphStyle = function ( ) { function m ( c ) { var b = [ ] ; c && [ "style:parent-style-name" , "style:next-style-name" ] . forEach ( function ( f ) { c [ f ] === a && b . push ( f ) } ) ; return b } var n = this , k , c , a ; this . init = function ( h ) { k = h . memberid ; c = h . timestamp ; a = h . styleName } ; this . transform = function ( h, b ) { var f = h . spec ( ) , e , d ; e = [ n ] ; switch ( f . optype ) { case "RemoveParagraphStyle" : f . styleName === a && ( e = [ ] ) ; break ; case "AddParagraphStyle" : case "UpdateParagraphStyle" : d = m ( f . setProperties ) ; 0 < d . length && ( e = new ops . OpUpdateParagraphStyle , e . init ( { memberid: k ,
timestamp : c , styleName : f . styleName , removedProperties : { attributes : d . join ( "," ) } } ) , e = [ e , n ] ) ; break ; case "SetParagraphStyle" : f . styleName === a && ( f . styleName = "" , e = new ops . OpSetParagraphStyle , e . init ( f ) , e = [ e , n ] ) } return e } ; this . execute = function ( c ) { var b = c . getParagraphStyleElement ( a ) ; if ( ! b ) return ! 1 ; b . parentNode . removeChild ( b ) ; c . getOdfCanvas ( ) . refreshCSS ( ) ; c . emit ( ops . OdtDocument . signalStyleDeleted , a ) ; return ! 0 } ; this . spec = function ( ) { return { optype : "RemoveParagraphStyle" , memberid : k , timestamp : c , styleName : a } } } ;
// Input 53
/ *
Friedrich W. H. Kossebau
11 years ago