2020-07-08 13:12:57 +00:00
/*! pdfmake v0.1.66, @license MIT, @link http://pdfmake.org */
! function ( t , e ) { if ( "object" == typeof exports && "object" == typeof module ) module . exports = e ( ) ; else if ( "function" == typeof define && define . amd ) define ( [ ] , e ) ; else { var n = e ( ) ; for ( var r in n ) ( "object" == typeof exports ? exports : t ) [ r ] = n [ r ] } } ( "undefined" != typeof self ? self : this , function ( ) { return r = { } , i . m = n = [ function ( t , e , n ) { "use strict" ; function o ( t ) { return Array . isArray ( t ) } t . exports = { isString : function ( t ) { return "string" == typeof t || t instanceof String } , isNumber : function ( t ) { return "number" == typeof t || t instanceof Number } , isBoolean : function ( t ) { return "boolean" == typeof t } , isArray : o , isFunction : function ( t ) { return "function" == typeof t } , isObject : function ( t ) { return null !== t && "object" == typeof t } , isNull : function ( t ) { return null === t } , isUndefined : function ( t ) { return void 0 === t } , pack : function ( ) { for ( var t = { } , e = 0 , n = arguments . length ; e < n ; e ++ ) { var r = arguments [ e ] ; if ( r ) for ( var i in r ) r . hasOwnProperty ( i ) && ( t [ i ] = r [ i ] ) } return t } , fontStringify : function ( t , e ) { return "font" === t ? "font" : e } , offsetVector : function ( t , e , n ) { switch ( t . type ) { case "ellipse" : case "rect" : t . x += e , t . y += n ; break ; case "line" : t . x1 += e , t . x2 += e , t . y1 += n , t . y2 += n ; break ; case "polyline" : for ( var r = 0 , i = t . points . length ; r < i ; r ++ ) t . points [ r ] . x += e , t . points [ r ] . y += n } } , getNodeId : function t ( e ) { if ( e . id ) return e . id ; if ( o ( e . text ) ) for ( var n = 0 , r = e . text . length ; n < r ; n ++ ) { var i = t ( e . text [ n ] ) ; if ( i ) return i } return null } } } , function ( t , e , n ) { var c = n ( 3 ) , h = n ( 53 ) . f , f = n ( 18 ) , d = n ( 24 ) , p = n ( 137 ) , g = n ( 200 ) , y = n ( 142 ) ; t . exports = function ( t , e ) { var n , r , i , o , a = t . target , s = t . global , l = t . stat , u = s ? c : l ? c [ a ] || p ( a , { } ) : ( c [ a ] || { } ) . prototype ; if ( u ) for ( n in e ) { if ( i = e [ n ] , r = t . noTargetGet ? ( o = h ( u , n ) ) && o . value : u [ n ] , ! y ( s ? n : a + ( l ? "." : "#" ) + n , t . forced ) && void 0 !== r ) { if ( typeof i == typeof r ) continue ; g ( i , r ) } ( t . sham || r && r . sham ) && f ( i , "sham" , ! 0 ) , d ( u , n , i , t ) } } } , function ( t , e , n ) { var r ; t . exports = ( r = function ( c ) { var n = Object . create || function ( t ) { var e ; return r . prototype = t , e = new r , r . prototype = null , e } ; function r ( ) { } var t = { } , e = t . lib = { } , i = e . Base = { extend : function ( t ) { var e = n ( this ) ; return t && e . mixIn ( t ) , e . hasOwnProperty ( "init" ) && this . init !== e . init || ( e . init = function ( ) { e . $super . init . apply ( this , arguments ) } ) , ( e . init . prototype = e ) . $super = this , e } , create : function ( ) { var t = this . extend ( ) ; return t . init . apply ( t , arguments ) , t } , init : function ( ) { } , mixIn : function ( t ) { for ( var e in t ) t . hasOwnProperty ( e ) && ( this [ e ] = t [ e ] ) ; t . hasOwnProperty ( "toString" ) && ( this . toString = t . toString ) } , clone : function ( ) { return this . init . prototype . extend ( this ) } } , h = e . WordArray = i . extend ( { init : function ( t , e ) { t = this . words = t || [ ] , this . sigBytes = null != e ? e : 4 * t . length } , toString : function ( t ) { return ( t || a ) . stringify ( this ) } , concat : function ( t ) { var e = this . words , n = t . words , r = this . sigBytes , i = t . sigBytes ; if ( this . clamp ( ) , r % 4 ) for ( var o = 0 ; o < i ; o ++ ) { var a = n [ o >>> 2 ] >>> 24 - o % 4 * 8 & 255 ; e [ r + o >>> 2 ] |= a << 24 - ( r + o ) % 4 * 8 } else for ( o = 0 ; o < i ; o += 4 ) e [ r + o >>> 2 ] = n [ o >>> 2 ] ; return this . sigBytes += i , this } , clamp : function ( ) { var t = this . words , e = this . sigBytes ; t [ e >>> 2 ] &= 4294967295 << 32 - e % 4 * 8 , t . length = c . ceil ( e / 4 ) } , clone : function ( ) { var t = i . clone . call ( this ) ; return t . words = this . words . slice ( 0 ) , t } , random : function ( t ) { for ( var e = [ ] , n = 0 ; n < t ; n += 4 ) { var r = function ( e ) { var e = e , n = 987654321 , r = 4294967295 ; return function ( ) { var t = ( ( n = 36969 * ( 65535 & n ) + ( n >> 16 ) & r ) << 16 ) + ( e = 18e3 * ( 65535 & e ) + ( e >> 16 ) & r ) & r ; return t /= 4294967296 , ( t += . 5 ) * ( . 5 < c . random ( ) ? 1 : - 1 ) } } ( 4294967296 * ( i || c . random ( ) ) ) , i = 987654071 * r ( ) ; e . push ( 4294967296 * r ( ) | 0 ) } return new h . init ( e , t ) } } ) , o = t . enc = { } , a = o . Hex = { stringify : function ( t ) { for ( var e = t . words , n = t . sigBytes , r = [ ] , i = 0 ; i < n ; i ++ ) { var o = e [ i >>> 2 ] >>> 24 - i % 4 * 8 & 255 ; r . push ( ( o >>> 4 ) . toString ( 16 ) ) , r . push ( ( 15 & o ) . toString ( 16 ) ) } return r . join ( "" ) } , parse : function ( t ) { for ( var e = t . length , n = [ ] , r = 0 ; r < e ; r += 2 ) n [ r >>> 3 ] |= parseInt ( t . substr ( r , 2 ) , 16 ) << 24 - r % 8 * 4 ; return new h . init ( n , e / 2 ) } } , s = o . Latin1 = { stringify : function ( t ) { for ( var e = t . words , n = t . sigBytes , r = [ ] , i = 0 ; i < n ; i ++ ) { var o = e [ i >>> 2 ] >>> 24 - i % 4 * 8 & 255 ; r . push ( String . fromCharCode ( o ) ) } return r . join ( "" ) } , parse : function ( t ) { for ( var e = t . length , n = [ ] , r = 0 ; r < e ; r ++ ) n [ r >>> 2 ] |= ( 255 & t . charCodeAt ( r ) ) << 24 - r % 4 * 8 ; return new h . init ( n , e ) } } , l = o . Utf8 = { stringify : function ( t ) { try { return decodeURIComponent ( escape ( s . stringify ( t ) ) ) } catch ( t ) { throw new Error ( "Malformed UTF-8 data" ) } } , parse : function ( t ) { return s . parse ( unescape ( encodeURIComponent ( t ) ) ) } } , u = e . Buffe
2019-08-28 10:59:33 +00:00
/ * !
* The buffer module from node . js , for the browser .
*
2020-04-01 22:52:43 +00:00
* @ author Feross Aboukhadijeh < http : //feross.org>
2019-08-28 10:59:33 +00:00
* @ license MIT
* /
2020-07-08 13:12:57 +00:00
var s = M ( 302 ) , o = M ( 303 ) , a = M ( 196 ) ; function n ( ) { return h . TYPED _ARRAY _SUPPORT ? 2147483647 : 1073741823 } function l ( t , e ) { if ( n ( ) < e ) throw new RangeError ( "Invalid typed array length" ) ; return h . TYPED _ARRAY _SUPPORT ? ( t = new Uint8Array ( e ) ) . _ _proto _ _ = h . prototype : ( null === t && ( t = new h ( e ) ) , t . length = e ) , t } function h ( t , e , n ) { if ( ! ( h . TYPED _ARRAY _SUPPORT || this instanceof h ) ) return new h ( t , e , n ) ; if ( "number" != typeof t ) return r ( this , t , e , n ) ; if ( "string" == typeof e ) throw new Error ( "If encoding is specified then the first argument must be a string" ) ; return i ( this , t ) } function r ( t , e , n , r ) { if ( "number" == typeof e ) throw new TypeError ( '"value" argument must not be a number' ) ; return "undefined" != typeof ArrayBuffer && e instanceof ArrayBuffer ? function ( t , e , n , r ) { if ( e . byteLength , n < 0 || e . byteLength < n ) throw new RangeError ( "'offset' is out of bounds" ) ; if ( e . byteLength < n + ( r || 0 ) ) throw new RangeError ( "'length' is out of bounds" ) ; e = void 0 === n && void 0 === r ? new Uint8Array ( e ) : void 0 === r ? new Uint8Array ( e , n ) : new Uint8Array ( e , n , r ) ; h . TYPED _ARRAY _SUPPORT ? ( t = e ) . _ _proto _ _ = h . prototype : t = c ( t , e ) ; return t } ( t , e , n , r ) : "string" == typeof e ? function ( t , e , n ) { "string" == typeof n && "" !== n || ( n = "utf8" ) ; if ( ! h . isEncoding ( n ) ) throw new TypeError ( '"encoding" must be a valid string encoding' ) ; var r = 0 | d ( e , n ) , i = ( t = l ( t , r ) ) . write ( e , n ) ; i !== r && ( t = t . slice ( 0 , i ) ) ; return t } ( t , e , n ) : function ( t , e ) { if ( h . isBuffer ( e ) ) { var n = 0 | f ( e . length ) ; return 0 === ( t = l ( t , n ) ) . length ? t : ( e . copy ( t , 0 , 0 , n ) , t ) } if ( e ) { if ( "undefined" != typeof ArrayBuffer && e . buffer instanceof ArrayBuffer || "length" in e ) return "number" != typeof e . length || function ( t ) { return t != t } ( e . length ) ? l ( t , 0 ) : c ( t , e ) ; if ( "Buffer" === e . type && a ( e . data ) ) return c ( t , e . data ) } throw new TypeError ( "First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object." ) } ( t , e ) } function u ( t ) { if ( "number" != typeof t ) throw new TypeError ( '"size" argument must be a number' ) ; if ( t < 0 ) throw new RangeError ( '"size" argument must not be negative' ) } function i ( t , e ) { if ( u ( e ) , t = l ( t , e < 0 ? 0 : 0 | f ( e ) ) , ! h . TYPED _ARRAY _SUPPORT ) for ( var n = 0 ; n < e ; ++ n ) t [ n ] = 0 ; return t } function c ( t , e ) { var n = e . length < 0 ? 0 : 0 | f ( e . length ) ; t = l ( t , n ) ; for ( var r = 0 ; r < n ; r += 1 ) t [ r ] = 255 & e [ r ] ; return t } function f ( t ) { if ( t >= n ( ) ) throw new RangeError ( "Attempt to allocate Buffer larger than maximum size: 0x" + n ( ) . toString ( 16 ) + " bytes" ) ; return 0 | t } function d ( t , e ) { if ( h . isBuffer ( t ) ) return t . length ; if ( "undefined" != typeof ArrayBuffer && "function" == typeof ArrayBuffer . isView && ( ArrayBuffer . isView ( t ) || t instanceof ArrayBuffer ) ) return t . byteLength ; "string" != typeof t && ( t = "" + t ) ; var n = t . length ; if ( 0 === n ) return 0 ; for ( var r = ! 1 ; ; ) switch ( e ) { case "ascii" : case "latin1" : case "binary" : return n ; case "utf8" : case "utf-8" : case void 0 : return O ( t ) . length ; case "ucs2" : case "ucs-2" : case "utf16le" : case "utf-16le" : return 2 * n ; case "hex" : return n >>> 1 ; case "base64" : return T ( t ) . length ; default : if ( r ) return O ( t ) . length ; e = ( "" + e ) . toLowerCase ( ) , r = ! 0 } } function e ( t , e , n ) { var r , i , o , a = ! 1 ; if ( ( void 0 === e || e < 0 ) && ( e = 0 ) , e > this . length ) return "" ; if ( ( void 0 === n || n > this . length ) && ( n = this . length ) , n <= 0 ) return "" ; if ( ( n >>>= 0 ) <= ( e >>>= 0 ) ) return "" ; for ( t = t || "utf8" ; ; ) switch ( t ) { case "hex" : return function ( t , e , n ) { var r = t . length ; ( ! e || e < 0 ) && ( e = 0 ) ; ( ! n || n < 0 || r < n ) && ( n = r ) ; for ( var i = "" , o = e ; o < n ; ++ o ) i += function ( t ) { return t < 16 ? "0" + t . toString ( 16 ) : t . toString ( 16 ) } ( t [ o ] ) ; return i } ( this , e , n ) ; case "utf8" : case "utf-8" : return b ( this , e , n ) ; case "ascii" : return function ( t , e , n ) { var r = "" ; n = Math . min ( t . length , n ) ; for ( var i = e ; i < n ; ++ i ) r += String . fromCharCode ( 127 & t [ i ] ) ; return r } ( this , e , n ) ; case "latin1" : case "binary" : return function ( t , e , n ) { var r = "" ; n = Math . min ( t . length , n ) ; for ( var i = e ; i < n ; ++ i ) r += String . fromCharCode ( t [ i ] ) ; return r } ( this , e , n ) ; case "base64" : return r = this , o = n , 0 === ( i = e ) && o === r . length ? s . fromByteArray ( r ) : s . fromByteArray ( r . slice ( i , o ) ) ; case "ucs2" : case "ucs-2" : case "utf16le" : case "utf-16le" : return function ( t , e , n ) { for ( var r = t . slice ( e , n ) , i = "" , o = 0 ; o < r . length ; o += 2 ) i += String . fromCharCode ( r [ o ] + 256 * r [ o + 1 ] ) ; return i } ( this , e , n ) ; default : if ( a ) throw new TypeError ( "Unknown encoding: " + t ) ; t = ( t + "" ) . toLowerCase ( ) , a = ! 0 } } function p ( t , e , n ) { var r = t [ e ] ; t [ e ] = t [ n ] , t [ n ] = r } function g ( t , e , n , r , i ) { if ( 0 === t . length ) return - 1 ; if ( "string" == typeof n ? ( r = n , n = 0 ) : 2147483647 < n ? n = 2147483647 : n < - 2147483648 && ( n = - 2147483648 ) , n = + n , i
2019-08-28 10:59:33 +00:00
/ * !
* The buffer module from node . js , for the browser .
*
* @ author Feross Aboukhadijeh < feross @ feross . org > < http : //feross.org>
* @ license MIT
2020-07-08 13:12:57 +00:00
* /function o(t,e){if(t===e)return 0;for(var n=t.length,r=e.length,i=0,o=Math.min(n,r);i<o;++i)if(t[i]!==e[i]){n=t[i],r=e[i];break}return n<r?-1:r<n?1:0}function a(t){return e.Buffer&&"function"==typeof e.Buffer.isBuffer?e.Buffer.isBuffer(t):!(null==t||!t._isBuffer)}var c=_(166),r=Object.prototype.hasOwnProperty,h=Array.prototype.slice,n="foo"===function(){}.name;function s(t){return Object.prototype.toString.call(t)}function l(t){if(!a(t)&&"function"==typeof e.ArrayBuffer){if("function"==typeof ArrayBuffer.isView)return ArrayBuffer.isView(t);if(t)return t instanceof DataView||!!(t.buffer&&t.buffer instanceof ArrayBuffer)}}var u=S.exports=y,i=/ \ s * function \ s + ( [ ^ \ ( \ s ] * ) \ s * / ; f u n c t i o n f ( t ) { i f ( c . i s F u n c t i o n ( t ) ) { i f ( n ) r e t u r n t . n a m e ; v a r e = t . t o S t r i n g ( ) . m a t c h ( i ) ; r e t u r n e & & e [ 1 ] } } f u n c t i o n d ( t , e ) { r e t u r n " s t r i n g " ! = t y p e o f t | | t . l e n g t h < e ? t : t . s l i c e ( 0 , e ) } f u n c t i o n p ( t ) { i f ( n | | ! c . i s F u n c t i o n ( t ) ) r e t u r n c . i n s p e c t ( t ) ; v a r e = f ( t ) ; r e t u r n " [ F u n c t i o n " + ( e ? " : " + e : " " ) + " ] " } f u n c t i o n g ( t , e , n , r , i ) { t h r o w n e w u . A s s e r t i o n E r r o r ( { m e s s a g e : n , a c t u a l : t , e x p e c t e d : e , o p e r a t o r : r , s t a c k S t a r t F u n c t i o n : i } ) } f u n c t i o n y ( t , e ) { t | | g ( t , ! 0 , e , " = = " , u . o k ) } f u n c t i o n v ( t , e , n , r ) { i f ( t = = = e ) r e t u r n ! 0 ; i f ( a ( t ) & & a ( e ) ) r e t u r n 0 = = = o ( t , e ) ; i f ( c . i s D a t e ( t ) & & c . i s D a t e ( e ) ) r e t u r n t . g e t T i m e ( ) = = = e . g e t T i m e ( ) ; i f ( c . i s R e g E x p ( t ) & & c . i s R e g E x p ( e ) ) r e t u r n t . s o u r c e = = = e . s o u r c e & & t . g l o b a l = = = e . g l o b a l & & t . m u l t i l i n e = = = e . m u l t i l i n e & & t . l a s t I n d e x = = = e . l a s t I n d e x & & t . i g n o r e C a s e = = = e . i g n o r e C a s e ; i f ( n u l l ! = = t & & " o b j e c t " = = t y p e o f t | | n u l l ! = = e & & " o b j e c t " = = t y p e o f e ) { i f ( l ( t ) & & l ( e ) & & s ( t ) = = = s ( e ) & & ! ( t i n s t a n c e o f F l o a t 3 2 A r r a y | | t i n s t a n c e o f F l o a t 6 4 A r r a y ) ) r e t u r n 0 = = = o ( n e w U i n t 8 A r r a y ( t . b u f f e r ) , n e w U i n t 8 A r r a y ( e . b u f f e r ) ) ; i f ( a ( t ) ! = = a ( e ) ) r e t u r n ! 1 ; v a r i = ( r = r | | { a c t u a l : [ ] , e x p e c t e d : [ ] } ) . a c t u a l . i n d e x O f ( t ) ; r e t u r n - 1 ! = = i & & i = = = r . e x p e c t e d . i n d e x O f ( e ) | | ( r . a c t u a l . p u s h ( t ) , r . e x p e c t e d . p u s h ( e ) , f u n c t i o n ( t , e , n , r ) { i f ( n u l l = = t | | n u l l = = e ) r e t u r n ! 1 ; i f ( c . i s P r i m i t i v e ( t ) | | c . i s P r i m i t i v e ( e ) ) r e t u r n t = = = e ; i f ( n & & O b j e c t . g e t P r o t o t y p e O f ( t ) ! = = O b j e c t . g e t P r o t o t y p e O f ( e ) ) r e t u r n ! 1 ; v a r i = m ( t ) , o = m ( e ) ; i f ( i & & ! o | | ! i & & o ) r e t u r n ! 1 ; i f ( i ) r e t u r n t = h . c a l l ( t ) , e = h . c a l l ( e ) , v ( t , e , n ) ; v a r a , s , l = x ( t ) , u = x ( e ) ; i f ( l . l e n g t h ! = = u . l e n g t h ) r e t u r n ! 1 ; f o r ( l . s o r t ( ) , u . s o r t ( ) , s = l . l e n g t h - 1 ; 0 < = s ; s - - ) i f ( l [ s ] ! = = u [ s ] ) r e t u r n ! 1 ; f o r ( s = l . l e n g t h - 1 ; 0 < = s ; s - - ) i f ( a = l [ s ] , ! v ( t [ a ] , e [ a ] , n , r ) ) r e t u r n ! 1 ; r e t u r n ! 0 } ( t , e , n , r ) ) } r e t u r n n ? t = = = e : t = = e } f u n c t i o n m ( t ) { r e t u r n " [ o b j e c t A r g u m e n t s ] " = = O b j e c t . p r o t o t y p e . t o S t r i n g . c a l l ( t ) } f u n c t i o n b ( t , e ) { i f ( t & & e ) { i f ( " [ o b j e c t R e g E x p ] " = = O b j e c t . p r o t o t y p e . t o S t r i n g . c a l l ( e ) ) r e t u r n e . t e s t ( t ) ; t r y { i f ( t i n s t a n c e o f e ) r e t u r n 1 } c a t c h ( t ) { } i f ( ! E r r o r . i s P r o t o t y p e O f ( e ) ) r e t u r n ! 0 = = = e . c a l l ( { } , t ) } } f u n c t i o n w ( t , e , n , r ) { v a r i ; i f ( " f u n c t i o n " ! = t y p e o f e ) t h r o w n e w T y p e E r r o r ( ' " b l o c k " a r g u m e n t m u s t b e a f u n c t i o n ' ) ; " s t r i n g " = = t y p e o f n & & ( r = n , n = n u l l ) , i = f u n c t i o n ( t ) { v a r e ; t r y { t ( ) } c a t c h ( t ) { e = t } r e t u r n e } ( e ) , r = ( n & & n . n a m e ? " ( " + n . n a m e + " ) . " : " . " ) + ( r ? " " + r : " . " ) , t & & ! i & & g ( i , n , " M i s s i n g e x p e c t e d e x c e p t i o n " + r ) ; v a r o = " s t r i n g " = = t y p e o f r , a = ! t & & i & & ! n ; i f ( ( ! t & & c . i s E r r o r ( i ) & & o & & b ( i , n ) | | a ) & & g ( i , n , " G o t u n w a n t e d e x c e p t i o n " + r ) , t & & i & & n & & ! b ( i , n ) | | ! t & & i ) t h r o w i } u . A s s e r t i o n E r r o r = f u n c t i o n ( t ) { v a r e ; t h i s . n a m e = " A s s e r t i o n E r r o r " , t h i s . a c t u a l = t . a c t u a l , t h i s . e x p e c t e d = t . e x p e c t e d , t h i s . o p e r a t o r = t . o p e r a t o r , t . m e s s a g e ? ( t h i s . m e s s a g e = t . m e s s a g e , t h i s . g e n e r a t e d M e s s a g e = ! 1 ) : ( t h i s . m e s s a g e = d ( p ( ( e = t h i s ) . a c t u a l ) , 1 2 8 ) + " " + e . o p e r a t o r + " " + d ( p ( e . e x p e c t e d ) , 1 2 8 ) , t h i s . g e n e r a t e d M e s s a g e = ! 0 ) ; v a r n , r , i , o , a , s = t . s t a c k S t a r t F u n c t i o n | | g ; E r r o r . c a p t u r e S t a c k T r a c e ? E r r o r . c a p t u r e S t a c k T r a c e ( t h i s , s ) : ( n = n e w E r r o r ) . s t a c k & & ( a = n . s t a c k , r = f ( s ) , 0 < = ( i = a . i n d e x O f ( " \ n " + r ) ) & & ( o = a . i n d e x O f ( " \ n " , i + 1 ) , a = a . s u b s t r i n g ( o + 1 ) ) , t h i s . s t a c k = a ) } , c . i n h e r i t s ( u . A s s e r t i o n E r r o r , E r r o r ) , u . f a i l = g , u . o k = y , u . e q u a l = f u n c t i o n ( t , e , n ) { t ! = e & & g ( t , e , n , " = = " , u . e q u a l ) } , u . n o t E q u a l = f u n c t i o n ( t , e , n ) { t = = e & & g ( t , e , n , " ! = " , u . n o t E q u a l ) } , u . d e e p E q u a l = f u n c t i o n ( t , e , n ) { v ( t , e , ! 1 ) | | g ( t , e , n , " d e e p E q u a l " , u . d e e p E q u a l ) } , u . d e e p S t r i c t E q u a l = f u n c t i o n ( t , e , n ) { v ( t , e , ! 0 ) | | g ( t , e , n , " d e e p S t r i c t E q u a l " , u . d e e p S t r i c t E q u a l ) } , u . n o t D e e p E q u a l = f u n c t i o n ( t , e , n ) { v ( t , e , ! 1 ) & & g ( t , e , n , " n o t D e e p E q u a l " , u . n o t D e e p E q u a l ) } , u . n o t D e e p S t r i c t E q u a l = f u n c t i o n t ( e , n , r ) { v ( e , n , ! 0 ) & & g ( e , n , r , " n o t D e e p S t r i c t E q u a l " , t ) } , u . s t r i c t E q u a l = f u n c t i o n ( t , e , n ) { t ! = = e & & g ( t , e , n , " = = = " , u . s t r i c t E q u a l ) } , u . n o t S t r i c t E q u a l = f u n c t i o n ( t , e , n ) { t = = = e & & g ( t , e , n , " ! = = " , u . n o t S t r i c t E q u a l ) } , u . t h r
2019-08-28 10:59:33 +00:00
/ *
object - assign
( c ) Sindre Sorhus
@ license MIT
2020-07-08 13:12:57 +00:00
* / v a r l = O b j e c t . g e t O w n P r o p e r t y S y m b o l s , u = O b j e c t . p r o t o t y p e . h a s O w n P r o p e r t y , c = O b j e c t . p r o t o t y p e . p r o p e r t y I s E n u m e r a b l e ; t . e x p o r t s = f u n c t i o n ( ) { t r y { i f ( ! O b j e c t . a s s i g n ) r e t u r n ; v a r t = n e w S t r i n g ( " a b c " ) ; i f ( t [ 5 ] = " d e " , " 5 " = = = O b j e c t . g e t O w n P r o p e r t y N a m e s ( t ) [ 0 ] ) r e t u r n ; f o r ( v a r e = { } , n = 0 ; n < 1 0 ; n + + ) e [ " _ " + S t r i n g . f r o m C h a r C o d e ( n ) ] = n ; i f ( " 0 1 2 3 4 5 6 7 8 9 " ! = = O b j e c t . g e t O w n P r o p e r t y N a m e s ( e ) . m a p ( f u n c t i o n ( t ) { r e t u r n e [ t ] } ) . j o i n ( " " ) ) r e t u r n ; v a r r = { } ; r e t u r n " a b c d e f g h i j k l m n o p q r s t " . s p l i t ( " " ) . f o r E a c h ( f u n c t i o n ( t ) { r [ t ] = t } ) , " a b c d e f g h i j k l m n o p q r s t " ! = = O b j e c t . k e y s ( O b j e c t . a s s i g n ( { } , r ) ) . j o i n ( " " ) ? v o i d 0 : 1 } c a t c h ( t ) { r e t u r n } } ( ) ? O b j e c t . a s s i g n : f u n c t i o n ( t , e ) { f o r ( v a r n , r , i = f u n c t i o n ( t ) { i f ( n u l l = = t ) t h r o w n e w T y p e E r r o r ( " O b j e c t . a s s i g n c a n n o t b e c a l l e d w i t h n u l l o r u n d e f i n e d " ) ; r e t u r n O b j e c t ( t ) } ( t ) , o = 1 ; o < a r g u m e n t s . l e n g t h ; o + + ) { f o r ( v a r a i n n = O b j e c t ( a r g u m e n t s [ o ] ) ) u . c a l l ( n , a ) & & ( i [ a ] = n [ a ] ) ; i f ( l ) { r = l ( n ) ; f o r ( v a r s = 0 ; s < r . l e n g t h ; s + + ) c . c a l l ( n , r [ s ] ) & & ( i [ r [ s ] ] = n [ r [ s ] ] ) } } r e t u r n i } } , f u n c t i o n ( t , e ) { t . e x p o r t s = f u n c t i o n ( t ) { r e t u r n t & & " o b j e c t " = = t y p e o f t & & " f u n c t i o n " = = t y p e o f t . c o p y & & " f u n c t i o n " = = t y p e o f t . f i l l & & " f u n c t i o n " = = t y p e o f t . r e a d U I n t 8 } } , f u n c t i o n ( t , e ) { " f u n c t i o n " = = t y p e o f O b j e c t . c r e a t e ? t . e x p o r t s = f u n c t i o n ( t , e ) { t . s u p e r _ = e , t . p r o t o t y p e = O b j e c t . c r e a t e ( e . p r o t o t y p e , { c o n s t r u c t o r : { v a l u e : t , e n u m e r a b l e : ! 1 , w r i t a b l e : ! 0 , c o n f i g u r a b l e : ! 0 } } ) } : t . e x p o r t s = f u n c t i o n ( t , e ) { t . s u p e r _ = e ; f u n c t i o n n ( ) { } n . p r o t o t y p e = e . p r o t o t y p e , t . p r o t o t y p e = n e w n , t . p r o t o t y p e . c o n s t r u c t o r = t } } , f u n c t i o n ( t , e , n ) { " u s e s t r i c t " ; t . e x p o r t s = f u n c t i o n ( ) { t h i s . i n p u t = n u l l , t h i s . n e x t _ i n = 0 , t h i s . a v a i l _ i n = 0 , t h i s . t o t a l _ i n = 0 , t h i s . o u t p u t = n u l l , t h i s . n e x t _ o u t = 0 , t h i s . a v a i l _ o u t = 0 , t h i s . t o t a l _ o u t = 0 , t h i s . m s g = " " , t h i s . s t a t e = n u l l , t h i s . d a t a _ t y p e = 2 , t h i s . a d l e r = 0 } } , f u n c t i o n ( t , e , n ) { " u s e s t r i c t " ; v a r l , f = n ( 1 2 4 ) , u = n ( 3 5 6 ) , d = n ( 2 4 6 ) , p = n ( 2 4 7 ) , r = n ( 3 5 7 ) , c = 0 , h = 4 , g = 0 , y = - 2 , v = - 1 , m = 4 , i = 2 , b = 8 , w = 9 , o = 2 8 6 , a = 3 0 , s = 1 9 , x = 2 * o + 1 , S = 1 5 , _ = 3 , k = 2 5 8 , A = k + _ + 1 , C = 4 2 , P = 1 1 3 , E = 1 , O = 2 , T = 3 , I = 4 ; f u n c t i o n L ( t , e ) { r e t u r n t . m s g = r [ e ] , e } f u n c t i o n M ( t ) { r e t u r n ( t < < 1 ) - ( 4 < t ? 9 : 0 ) } f u n c t i o n B ( t ) { f o r ( v a r e = t . l e n g t h ; 0 < = - - e ; ) t [ e ] = 0 } f u n c t i o n R ( t ) { v a r e = t . s t a t e , n = e . p e n d i n g ; n > t . a v a i l _ o u t & & ( n = t . a v a i l _ o u t ) , 0 ! = = n & & ( f . a r r a y S e t ( t . o u t p u t , e . p e n d i n g _ b u f , e . p e n d i n g _ o u t , n , t . n e x t _ o u t ) , t . n e x t _ o u t + = n , e . p e n d i n g _ o u t + = n , t . t o t a l _ o u t + = n , t . a v a i l _ o u t - = n , e . p e n d i n g - = n , 0 = = = e . p e n d i n g & & ( e . p e n d i n g _ o u t = 0 ) ) } f u n c t i o n F ( t , e ) { u . _ t r _ f l u s h _ b l o c k ( t , 0 < = t . b l o c k _ s t a r t ? t . b l o c k _ s t a r t : - 1 , t . s t r s t a r t - t . b l o c k _ s t a r t , e ) , t . b l o c k _ s t a r t = t . s t r s t a r t , R ( t . s t r m ) } f u n c t i o n D ( t , e ) { t . p e n d i n g _ b u f [ t . p e n d i n g + + ] = e } f u n c t i o n z ( t , e ) { t . p e n d i n g _ b u f [ t . p e n d i n g + + ] = e > > > 8 & 2 5 5 , t . p e n d i n g _ b u f [ t . p e n d i n g + + ] = 2 5 5 & e } f u n c t i o n N ( t , e ) { v a r n , r , i = t . m a x _ c h a i n _ l e n g t h , o = t . s t r s t a r t , a = t . p r e v _ l e n g t h , s = t . n i c e _ m a t c h , l = t . s t r s t a r t > t . w _ s i z e - A ? t . s t r s t a r t - ( t . w _ s i z e - A ) : 0 , u = t . w i n d o w , c = t . w _ m a s k , h = t . p r e v , f = t . s t r s t a r t + k , d = u [ o + a - 1 ] , p = u [ o + a ] ; t . p r e v _ l e n g t h > = t . g o o d _ m a t c h & & ( i > > = 2 ) , s > t . l o o k a h e a d & & ( s = t . l o o k a h e a d ) ; d o { i f ( u [ ( n = e ) + a ] = = = p & & u [ n + a - 1 ] = = = d & & u [ n ] = = = u [ o ] & & u [ + + n ] = = = u [ o + 1 ] ) { o + = 2 , n + + ; d o { } w h i l e ( u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & u [ + + o ] = = = u [ + + n ] & & o < f ) ; i f ( r = k - ( f - o ) , o = f - k , a < r ) { i f ( t . m a t c h _ s t a r t = e , s < = ( a = r ) ) b r e a k ; d = u [ o + a - 1 ] , p = u [ o + a ] } } } w h i l e ( ( e = h [ e & c ] ) > l & & 0 ! = - - i ) ; r e t u r n a < = t . l o o k a h e a d ? a : t . l o o k a h e a d } f u n c t i o n U ( t ) { v a r e , n , r , i , o , a , s , l , u , c , h = t . w _ s i z e ; d o { i f ( i = t . w i n d o w _ s i z e - t . l o o k a h e a d - t . s t r s t a r t , t . s t r s t a r t > = h + ( h - A ) ) { f o r ( f . a r r a y S e t ( t . w i n d o w , t . w i n d o w , h , h , 0 ) , t . m a t c h _ s t a r t - = h , t . s t r s t a r t - = h , t . b l o c k _ s t a r t - = h , e = n = t . h a s h _ s i z e ; r = t . h e a d [ - - e ] , t . h e a d [ e ] = h < = r ? r - h : 0 , - - n ; ) ; f o r ( e = n = h ; r = t . p r e v [ - - e ] , t . p r e v [ e ] = h < = r ? r - h : 0 , - - n ; ) ; i + = h } i f ( 0 = = = t . s t r m . a v a i l _ i n ) b r e a k ; i f ( a = t . s t r m , s = t . w i n d o w , l = t . s t r s t a r t + t . l o o k a h e a d , u = i , c = v o i d 0 , c = a . a v a i l _ i n , u < c & & ( c = u ) , n = 0 = = = c ? 0 : ( a . a v a i l _ i n - = c , f . a r r a y S e t ( s , a . i n p u t , a . n e x t _ i n , c , l ) , 1 = = = a . s t a t e . w r a p ? a . a d l e r = d ( a . a d l e r , s , c , l ) : 2 = = = a . s t a t e . w r a p & & ( a . a d l e r = p ( a . a d l e r , s , c , l ) ) , a . n e x t _ i n + = c , a . t o t a l _ i n + = c , c ) , t . l o o k a h e a d + = n , t . l o o k a h e a d + t . i n s e r t > = _ ) f o r ( o = t . s t r s t a r t - t . i n s e r t , t . i n s _ h = t . w i n d o w [ o ] , t . i n s _ h = ( t . i n s _ h < < t . h a s h _ s h i f t ^ t . w i n d o w [ o + 1 ] ) & t . h a s h _ m a s k ; t . i n s e r t & & ( t . i n s _ h = ( t . i n s _ h < < t . h a s h _ s h i f t ^ t . w i n d o w [ o + _ - 1 ] ) & t . h a s h _ m a s k , t . p r e v [ o & t . w _ m a s k ] = t . h e a d [ t . i n s _ h ] , t . h e a d [ t . i n s _ h ] = o , o + + , t . i n s e r t - - , ! ( t . l o o k a h e a d + t . i n s e r t < _ ) ) ; ) ; } w h i l e ( t . l o o k a h e a d < A & & 0 ! = = t . s t r m . a v a i l _ i n ) } f u n c t i o n j ( t , e ) { f o r ( v a r n , r ; ; ) { i f ( t . l o o k a h e a d < A ) { i f ( U ( t ) ,
2019-08-28 10:59:33 +00:00
/ * * @ p r e s e r v e
( c ) 2012 by Cédric Mesnil . All rights reserved .
Redistribution and use in source and binary forms , with or without modification , are permitted provided that the following conditions are met :
- Redistributions of source code must retain the above copyright notice , this list of conditions and the following disclaimer .
- Redistributions in binary form must reproduce the above copyright notice , this list of conditions and the following disclaimer in the documentation and / or other materials provided with the distribution .
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES , INCLUDING , BUT NOT LIMITED TO , THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED . IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT , INDIRECT , INCIDENTAL , SPECIAL , EXEMPLARY , OR CONSEQUENTIAL DAMAGES ( INCLUDING , BUT NOT LIMITED TO , PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES ; LOSS OF USE , DATA , OR PROFITS ; OR BUSINESS INTERRUPTION ) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY , WHETHER IN CONTRACT , STRICT LIABILITY , OR TORT ( INCLUDING NEGLIGENCE OR OTHERWISE ) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE , EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE .
* /
2020-07-08 13:12:57 +00:00
function ( ) { var t = a , e = t . lib , n = e . WordArray , r = e . Hasher , i = t . algo , _ = n . create ( [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 7 , 4 , 13 , 1 , 10 , 6 , 15 , 3 , 12 , 0 , 9 , 5 , 2 , 14 , 11 , 8 , 3 , 10 , 14 , 4 , 9 , 15 , 8 , 1 , 2 , 7 , 0 , 6 , 13 , 11 , 5 , 12 , 1 , 9 , 11 , 10 , 0 , 8 , 12 , 4 , 13 , 3 , 7 , 15 , 14 , 5 , 6 , 2 , 4 , 0 , 5 , 9 , 7 , 12 , 2 , 10 , 14 , 1 , 3 , 8 , 11 , 6 , 15 , 13 ] ) , k = n . create ( [ 5 , 14 , 7 , 0 , 9 , 2 , 11 , 4 , 13 , 6 , 15 , 8 , 1 , 10 , 3 , 12 , 6 , 11 , 3 , 7 , 0 , 13 , 5 , 10 , 14 , 15 , 8 , 12 , 4 , 9 , 1 , 2 , 15 , 5 , 1 , 3 , 7 , 14 , 6 , 9 , 11 , 8 , 12 , 2 , 10 , 0 , 4 , 13 , 8 , 6 , 4 , 1 , 3 , 11 , 15 , 0 , 5 , 12 , 2 , 13 , 9 , 7 , 10 , 14 , 12 , 15 , 10 , 4 , 1 , 5 , 8 , 7 , 6 , 2 , 13 , 14 , 0 , 3 , 9 , 11 ] ) , A = n . create ( [ 11 , 14 , 15 , 12 , 5 , 8 , 7 , 9 , 11 , 13 , 14 , 15 , 6 , 7 , 9 , 8 , 7 , 6 , 8 , 13 , 11 , 9 , 7 , 15 , 7 , 12 , 15 , 9 , 11 , 7 , 13 , 12 , 11 , 13 , 6 , 7 , 14 , 9 , 13 , 15 , 14 , 8 , 13 , 6 , 5 , 12 , 7 , 5 , 11 , 12 , 14 , 15 , 14 , 15 , 9 , 8 , 9 , 14 , 5 , 6 , 8 , 6 , 5 , 12 , 9 , 15 , 5 , 11 , 6 , 8 , 13 , 12 , 5 , 12 , 13 , 14 , 11 , 8 , 5 , 6 ] ) , C = n . create ( [ 8 , 9 , 9 , 11 , 13 , 15 , 15 , 5 , 7 , 7 , 8 , 11 , 14 , 14 , 12 , 6 , 9 , 13 , 15 , 7 , 12 , 8 , 9 , 11 , 7 , 7 , 12 , 7 , 6 , 15 , 13 , 11 , 9 , 7 , 15 , 11 , 8 , 6 , 6 , 14 , 12 , 13 , 5 , 14 , 13 , 13 , 7 , 5 , 15 , 5 , 8 , 11 , 14 , 14 , 6 , 14 , 6 , 9 , 12 , 9 , 12 , 5 , 15 , 8 , 8 , 5 , 12 , 9 , 12 , 5 , 14 , 6 , 8 , 13 , 6 , 5 , 15 , 13 , 11 , 11 ] ) , P = n . create ( [ 0 , 1518500249 , 1859775393 , 2400959708 , 2840853838 ] ) , E = n . create ( [ 1352829926 , 1548603684 , 1836072691 , 2053994217 , 0 ] ) , o = i . RIPEMD160 = r . extend ( { _doReset : function ( ) { this . _hash = n . create ( [ 1732584193 , 4023233417 , 2562383102 , 271733878 , 3285377520 ] ) } , _doProcessBlock : function ( t , e ) { for ( var n = 0 ; n < 16 ; n ++ ) { var r = e + n , i = t [ r ] ; t [ r ] = 16711935 & ( i << 8 | i >>> 24 ) | 4278255360 & ( i << 24 | i >>> 8 ) } for ( var o , a , s , l , u , c , h = this . _hash . words , f = P . words , d = E . words , p = _ . words , g = k . words , y = A . words , v = C . words , m = o = h [ 0 ] , b = a = h [ 1 ] , w = s = h [ 2 ] , x = l = h [ 3 ] , S = u = h [ 4 ] , n = 0 ; n < 80 ; n += 1 ) c = o + t [ e + p [ n ] ] | 0 , c += n < 16 ? ( a ^ s ^ l ) + f [ 0 ] : n < 32 ? O ( a , s , l ) + f [ 1 ] : n < 48 ? ( ( a | ~ s ) ^ l ) + f [ 2 ] : n < 64 ? T ( a , s , l ) + f [ 3 ] : ( a ^ ( s | ~ l ) ) + f [ 4 ] , c = ( c = I ( c |= 0 , y [ n ] ) ) + u | 0 , o = u , u = l , l = I ( s , 10 ) , s = a , a = c , c = m + t [ e + g [ n ] ] | 0 , c += n < 16 ? ( b ^ ( w | ~ x ) ) + d [ 0 ] : n < 32 ? T ( b , w , x ) + d [ 1 ] : n < 48 ? ( ( b | ~ w ) ^ x ) + d [ 2 ] : n < 64 ? O ( b , w , x ) + d [ 3 ] : ( b ^ w ^ x ) + d [ 4 ] , c = ( c = I ( c |= 0 , v [ n ] ) ) + S | 0 , m = S , S = x , x = I ( w , 10 ) , w = b , b = c ; c = h [ 1 ] + s + x | 0 , h [ 1 ] = h [ 2 ] + l + S | 0 , h [ 2 ] = h [ 3 ] + u + m | 0 , h [ 3 ] = h [ 4 ] + o + b | 0 , h [ 4 ] = h [ 0 ] + a + w | 0 , h [ 0 ] = c } , _doFinalize : function ( ) { var t = this . _data , e = t . words , n = 8 * this . _nDataBytes , r = 8 * t . sigBytes ; e [ r >>> 5 ] |= 128 << 24 - r % 32 , e [ 14 + ( 64 + r >>> 9 << 4 ) ] = 16711935 & ( n << 8 | n >>> 24 ) | 4278255360 & ( n << 24 | n >>> 8 ) , t . sigBytes = 4 * ( e . length + 1 ) , this . _process ( ) ; for ( var i = this . _hash , o = i . words , a = 0 ; a < 5 ; a ++ ) { var s = o [ a ] ; o [ a ] = 16711935 & ( s << 8 | s >>> 24 ) | 4278255360 & ( s << 24 | s >>> 8 ) } return i } , clone : function ( ) { var t = r . clone . call ( this ) ; return t . _hash = this . _hash . clone ( ) , t } } ) ; function O ( t , e , n ) { return t & e | ~ t & n } function T ( t , e , n ) { return t & n | e & ~ n } function I ( t , e ) { return t << e | t >>> 32 - e } t . RIPEMD160 = r . _createHelper ( o ) , t . HmacRIPEMD160 = r . _createHmacHelper ( o ) } ( Math ) , a . RIPEMD160 ) } , function ( t , e , n ) { var a ; t . exports = ( a = n ( 2 ) , n ( 167 ) , n ( 168 ) , function ( ) { var t = a , e = t . lib , n = e . Base , v = e . WordArray , r = t . algo , i = r . SHA1 , m = r . HMAC , o = r . PBKDF2 = n . extend ( { cfg : n . extend ( { keySize : 4 , hasher : i , iterations : 1 } ) , init : function ( t ) { this . cfg = this . cfg . extend ( t ) } , compute : function ( t , e ) { for ( var n = this . cfg , r = m . create ( n . hasher , t ) , i = v . create ( ) , o = v . create ( [ 1 ] ) , a = i . words , s = o . words , l = n . keySize , u = n . iterations ; a . length < l ; ) { var c = r . update ( e ) . finalize ( o ) ; r . reset ( ) ; for ( var h = c . words , f = h . length , d = c , p = 1 ; p < u ; p ++ ) { d = r . finalize ( d ) , r . reset ( ) ; for ( var g = d . words , y = 0 ; y < f ; y ++ ) h [ y ] ^= g [ y ] } i . concat ( c ) , s [ 0 ] ++ } return i . sigBytes = 4 * l , i } } ) ; t . PBKDF2 = function ( t , e , n ) { return o . create ( n ) . compute ( t , e ) } } ( ) , a . PBKDF2 ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . mode . CFB = function ( ) { var t = r . lib . BlockCipherMode . extend ( ) ; function o ( t , e , n , r ) { var i , o = this . _iv ; o ? ( i = o . slice ( 0 ) , this . _iv = void 0 ) : i = this . _prevBlock , r . encryptBlock ( i , 0 ) ; for ( var a = 0 ; a < n ; a ++ ) t [ e + a ] ^= i [ a ] } return t . Encryptor = t . extend ( { processBlock : function ( t , e ) { var n = this . _cipher , r = n . blockSize ; o . call ( this , t , e , r , n ) , this . _prevBlock = t . slice ( e , e + r ) } } ) , t . Decryptor = t . extend ( { processBlock : function ( t , e ) { var n = this . _cipher , r = n . blockSize , i = t . slice ( e , e + r ) ; o . call ( this , t , e , r , n ) , this . _prevBlock = i } } ) , t } ( ) , r . mode . CFB ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . mode . CTR = function ( ) { var t = r . lib . BlockCipherMode . extend ( ) , e = t . Encryptor = t . extend ( { processBlock : function ( t , e ) { var n = this . _cipher , r = n . blockSize , i = this . _iv , o = this . _counter ; i && ( o = this . _counter = i . slice ( 0 ) , this . _iv = void 0 ) ; var a = o . slice ( 0 ) ; n . encryptBlock ( a , 0 ) , o [ r - 1 ] = o [ r - 1 ] + 1 | 0 ; for ( var s = 0 ; s < r ; s ++ ) t [ e + s ] ^= a [ s ] } } ) ; return t . Decryptor = e , t } ( ) , r . mode . CTR ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n (
2019-08-28 10:59:33 +00:00
/ * * @ p r e s e r v e
* Counter block mode compatible with Dr Brian Gladman fileenc . c
* derived from CryptoJS . mode . CTR
* Jan Hruby jhruby . web @ gmail . com
* /
2020-07-08 13:12:57 +00:00
r . mode . CTRGladman = function ( ) { var t = r . lib . BlockCipherMode . extend ( ) ; function u ( t ) { var e , n , r ; return 255 == ( t >> 24 & 255 ) ? ( n = t >> 8 & 255 , r = 255 & t , 255 == ( e = t >> 16 & 255 ) ? ( e = 0 , 255 === n ? ( n = 0 , 255 === r ? r = 0 : ++ r ) : ++ n ) : ++ e , t = 0 , t += e << 16 , t += n << 8 , t += r ) : t += 1 << 24 , t } var e = t . Encryptor = t . extend ( { processBlock : function ( t , e ) { var n , r = this . _cipher , i = r . blockSize , o = this . _iv , a = this . _counter ; o && ( a = this . _counter = o . slice ( 0 ) , this . _iv = void 0 ) , 0 === ( ( n = a ) [ 0 ] = u ( n [ 0 ] ) ) && ( n [ 1 ] = u ( n [ 1 ] ) ) ; var s = a . slice ( 0 ) ; r . encryptBlock ( s , 0 ) ; for ( var l = 0 ; l < i ; l ++ ) t [ e + l ] ^= s [ l ] } } ) ; return t . Decryptor = e , t } ( ) , r . mode . CTRGladman ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . mode . OFB = function ( ) { var t = r . lib . BlockCipherMode . extend ( ) , e = t . Encryptor = t . extend ( { processBlock : function ( t , e ) { var n = this . _cipher , r = n . blockSize , i = this . _iv , o = this . _keystream ; i && ( o = this . _keystream = i . slice ( 0 ) , this . _iv = void 0 ) , n . encryptBlock ( o , 0 ) ; for ( var a = 0 ; a < r ; a ++ ) t [ e + a ] ^= o [ a ] } } ) ; return t . Decryptor = e , t } ( ) , r . mode . OFB ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . mode . ECB = function ( ) { var t = r . lib . BlockCipherMode . extend ( ) ; return t . Encryptor = t . extend ( { processBlock : function ( t , e ) { this . _cipher . encryptBlock ( t , e ) } } ) , t . Decryptor = t . extend ( { processBlock : function ( t , e ) { this . _cipher . decryptBlock ( t , e ) } } ) , t } ( ) , r . mode . ECB ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . pad . AnsiX923 = { pad : function ( t , e ) { var n = t . sigBytes , r = 4 * e , i = r - n % r , o = n + i - 1 ; t . clamp ( ) , t . words [ o >>> 2 ] |= i << 24 - o % 4 * 8 , t . sigBytes += i } , unpad : function ( t ) { var e = 255 & t . words [ t . sigBytes - 1 >>> 2 ] ; t . sigBytes -= e } } , r . pad . Ansix923 ) } , function ( t , e , n ) { var i ; t . exports = ( i = n ( 2 ) , n ( 12 ) , i . pad . Iso10126 = { pad : function ( t , e ) { var n = 4 * e , r = n - t . sigBytes % n ; t . concat ( i . lib . WordArray . random ( r - 1 ) ) . concat ( i . lib . WordArray . create ( [ r << 24 ] , 1 ) ) } , unpad : function ( t ) { var e = 255 & t . words [ t . sigBytes - 1 >>> 2 ] ; t . sigBytes -= e } } , i . pad . Iso10126 ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . pad . Iso97971 = { pad : function ( t , e ) { t . concat ( r . lib . WordArray . create ( [ 2147483648 ] , 1 ) ) , r . pad . ZeroPadding . pad ( t , e ) } , unpad : function ( t ) { r . pad . ZeroPadding . unpad ( t ) , t . sigBytes -- } } , r . pad . Iso97971 ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . pad . ZeroPadding = { pad : function ( t , e ) { var n = 4 * e ; t . clamp ( ) , t . sigBytes += n - ( t . sigBytes % n || n ) } , unpad : function ( t ) { for ( var e = t . words , n = t . sigBytes - 1 ; ! ( e [ n >>> 2 ] >>> 24 - n % 4 * 8 & 255 ) ; ) n -- ; t . sigBytes = n + 1 } } , r . pad . ZeroPadding ) } , function ( t , e , n ) { var r ; t . exports = ( r = n ( 2 ) , n ( 12 ) , r . pad . NoPadding = { pad : function ( ) { } , unpad : function ( ) { } } , r . pad . NoPadding ) } , function ( t , e , n ) { var i ; t . exports = ( i = n ( 2 ) , n ( 12 ) , function ( ) { var n = i . lib . CipherParams , r = i . enc . Hex ; i . format . Hex = { stringify : function ( t ) { return t . ciphertext . toString ( r ) } , parse : function ( t ) { var e = r . parse ( t ) ; return n . create ( { ciphertext : e } ) } } } ( ) , i . format . Hex ) } , function ( t , e , n ) { var i ; t . exports = ( i = n ( 2 ) , n ( 86 ) , n ( 87 ) , n ( 49 ) , n ( 12 ) , function ( ) { var t = i , e = t . lib . BlockCipher , n = t . algo , u = [ ] , c = [ ] , h = [ ] , f = [ ] , d = [ ] , p = [ ] , g = [ ] , y = [ ] , v = [ ] , m = [ ] ; ! function ( ) { for ( var t = [ ] , e = 0 ; e < 256 ; e ++ ) t [ e ] = e < 128 ? e << 1 : e << 1 ^ 283 ; for ( var n = 0 , r = 0 , e = 0 ; e < 256 ; e ++ ) { var i = ( i = r ^ r << 1 ^ r << 2 ^ r << 3 ^ r << 4 ) >>> 8 ^ 255 & i ^ 99 ; u [ n ] = i ; var o = t [ c [ i ] = n ] , a = t [ o ] , s = t [ a ] , l = 257 * t [ i ] ^ 16843008 * i ; h [ n ] = l << 24 | l >>> 8 , f [ n ] = l << 16 | l >>> 16 , d [ n ] = l << 8 | l >>> 24 , p [ n ] = l , l = 16843009 * s ^ 65537 * a ^ 257 * o ^ 16843008 * n , g [ i ] = l << 24 | l >>> 8 , y [ i ] = l << 16 | l >>> 16 , v [ i ] = l << 8 | l >>> 24 , m [ i ] = l , n ? ( n = o ^ t [ t [ t [ s ^ o ] ] ] , r ^= t [ t [ r ] ] ) : n = r = 1 } } ( ) ; var b = [ 0 , 1 , 2 , 4 , 8 , 16 , 32 , 64 , 128 , 27 , 54 ] , r = n . AES = e . extend ( { _doReset : function ( ) { if ( ! this . _nRounds || this . _keyPriorReset !== this . _key ) { for ( var t = this . _keyPriorReset = this . _key , e = t . words , n = t . sigBytes / 4 , r = 4 * ( 1 + ( this . _nRounds = 6 + n ) ) , i = this . _keySchedule = [ ] , o = 0 ; o < r ; o ++ ) o < n ? i [ o ] = e [ o ] : ( l = i [ o - 1 ] , o % n ? 6 < n && o % n == 4 && ( l = u [ l >>> 24 ] << 24 | u [ l >>> 16 & 255 ] << 16 | u [ l >>> 8 & 255 ] << 8 | u [ 255 & l ] ) : ( l = u [ ( l = l << 8 | l >>> 24 ) >>> 24 ] << 24 | u [ l >>> 16 & 255 ] << 16 | u [ l >>> 8 & 255 ] << 8 | u [ 255 & l ] , l ^= b [ o / n | 0 ] << 24 ) , i [ o ] = i [ o - n ] ^ l ) ; for ( var a = this . _invKeySchedule = [ ] , s = 0 ; s < r ; s ++ ) { var l , o = r - s ; l = s % 4 ? i [ o ] : i [ o - 4 ] , a [ s ] = s < 4 || o <= 4 ? l : g [ u [ l >>> 24 ] ] ^ y [ u [ l >>> 16 & 255 ] ] ^ v [ u [ l >>> 8 & 255 ] ] ^ m [ u [ 255 & l ] ] } } } , encryptBlock : function ( t , e ) { this . _doCryptBlock ( t , e , this . _keySchedule , h , f , d , p , u ) } , decryptBlock : function ( t , e ) { var n = t [ e + 1 ] ; t [ e + 1 ] = t [ e + 3 ] , t [ e + 3 ] = n , this . _doCryptBlock ( t , e , this . _invKeySchedule , g , y , v , m , c ) , n = t [ e + 1 ] , t [ e + 1 ] = t [ e + 3 ] , t [ e + 3 ] = n } , _doCryptBlock : function ( t , e , n , r , i , o , a , s ) { for ( var l = this . _nRounds , u = t [ e ] ^ n [ 0 ] , c =
2019-08-28 10:59:33 +00:00
//# sourceMappingURL=pdfmake.min.js.map