2020-09-19 14:20:30 +00:00
System . register ( [ ] , ( function ( Tn , Un ) { "use strict" ; return { execute : function ( ) { var Tn = "undefined" != typeof globalThis ? globalThis : "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : { } ; function createCommonjsModule ( Tn , Un , Qn ) { return Tn ( Qn = { path : Un , exports : { } , require : function ( Tn , Un ) { return function commonjsRequire ( ) { throw new Error ( "Dynamic requires are not currently supported by @rollup/plugin-commonjs" ) } ( null == Un && Qn . path ) } } , Qn . exports ) , Qn . exports } var check = function ( Tn ) { return Tn && Tn . Math == Math && Tn } , Qn = check ( "object" == typeof globalThis && globalThis ) || check ( "object" == typeof window && window ) || check ( "object" == typeof self && self ) || check ( "object" == typeof Tn && Tn ) || Function ( "return this" ) ( ) , fails = function ( Tn ) { try { return ! ! Tn ( ) } catch ( Tn ) { return ! 0 } } , Dn = ! fails ( ( function ( ) { return 7 != Object . defineProperty ( { } , 1 , { get : function ( ) { return 7 } } ) [ 1 ] } ) ) , Hn = { } . propertyIsEnumerable , Gn = Object . getOwnPropertyDescriptor , Vn = { f : Gn && ! Hn . call ( { 1 : 2 } , 1 ) ? function propertyIsEnumerable ( Tn ) { var Un = Gn ( this , Tn ) ; return ! ! Un && Un . enumerable } : Hn } , createPropertyDescriptor = function ( Tn , Un ) { return { enumerable : ! ( 1 & Tn ) , configurable : ! ( 2 & Tn ) , writable : ! ( 4 & Tn ) , value : Un } } , zn = { } . toString , classofRaw = function ( Tn ) { return zn . call ( Tn ) . slice ( 8 , - 1 ) } , Kn = "" . split , Wn = fails ( ( function ( ) { return ! Object ( "z" ) . propertyIsEnumerable ( 0 ) } ) ) ? function ( Tn ) { return "String" == classofRaw ( Tn ) ? Kn . call ( Tn , "" ) : Object ( Tn ) } : Object , requireObjectCoercible = function ( Tn ) { if ( null == Tn ) throw TypeError ( "Can't call method on " + Tn ) ; return Tn } , toIndexedObject = function ( Tn ) { return Wn ( requireObjectCoercible ( Tn ) ) } , isObject = function ( Tn ) { return "object" == typeof Tn ? null !== Tn : "function" == typeof Tn } , toPrimitive = function ( Tn , Un ) { if ( ! isObject ( Tn ) ) return Tn ; var Qn , Dn ; if ( Un && "function" == typeof ( Qn = Tn . toString ) && ! isObject ( Dn = Qn . call ( Tn ) ) ) return Dn ; if ( "function" == typeof ( Qn = Tn . valueOf ) && ! isObject ( Dn = Qn . call ( Tn ) ) ) return Dn ; if ( ! Un && "function" == typeof ( Qn = Tn . toString ) && ! isObject ( Dn = Qn . call ( Tn ) ) ) return Dn ; throw TypeError ( "Can't convert object to primitive value" ) } , Xn = { } . hasOwnProperty , has = function ( Tn , Un ) { return Xn . call ( Tn , Un ) } , Yn = Qn . document , Jn = isObject ( Yn ) && isObject ( Yn . createElement ) , documentCreateElement = function ( Tn ) { return Jn ? Yn . createElement ( Tn ) : { } } , $n = ! Dn && ! fails ( ( function ( ) { return 7 != Object . defineProperty ( documentCreateElement ( "div" ) , "a" , { get : function ( ) { return 7 } } ) . a } ) ) , Zn = Object . getOwnPropertyDescriptor , er = { f : Dn ? Zn : function getOwnPropertyDescriptor ( Tn , Un ) { if ( Tn = toIndexedObject ( Tn ) , Un = toPrimitive ( Un , ! 0 ) , $n ) try { return Zn ( Tn , Un ) } catch ( Tn ) { } if ( has ( Tn , Un ) ) return createPropertyDescriptor ( ! Vn . f . call ( Tn , Un ) , Tn [ Un ] ) } } , anObject = function ( Tn ) { if ( ! isObject ( Tn ) ) throw TypeError ( String ( Tn ) + " is not an object" ) ; return Tn } , tr = Object . defineProperty , nr = { f : Dn ? tr : function defineProperty ( Tn , Un , Qn ) { if ( anObject ( Tn ) , Un = toPrimitive ( Un , ! 0 ) , anObject ( Qn ) , $n ) try { return tr ( Tn , Un , Qn ) } catch ( Tn ) { } if ( "get" in Qn || "set" in Qn ) throw TypeError ( "Accessors not supported" ) ; return "value" in Qn && ( Tn [ Un ] = Qn . value ) , Tn } } , rr = Dn ? function ( Tn , Un , Qn ) { return nr . f ( Tn , Un , createPropertyDescriptor ( 1 , Qn ) ) } : function ( Tn , Un , Qn ) { return Tn [ Un ] = Qn , Tn } , setGlobal = function ( Tn , Un ) { try { rr ( Qn , Tn , Un ) } catch ( Dn ) { Qn [ Tn ] = Un } return Un } , ir = "__core-js_shared__" , or = Qn [ ir ] || setGlobal ( ir , { } ) , ar = Function . toString ; "function" != typeof or . inspectSource && ( or . inspectSource = function ( Tn ) { return ar . call ( Tn ) } ) ; var sr , lr , cr , ur = or . inspectSource , dr = Qn . WeakMap , hr = "function" == typeof dr && /native code/ . test ( ur ( dr ) ) , pr = createCommonjsModule ( ( function ( Tn ) { ( Tn . exports = function ( Tn , Un ) { return or [ Tn ] || ( or [ Tn ] = void 0 !== Un ? Un : { } ) } ) ( "versions" , [ ] ) . push ( { version : "3.6.5" , mode : "global" , copyright : "© 2020 Denis Pushkarev (zloirock.ru)" } ) } ) ) , Ar = 0 , fr = Math . random ( ) , uid = function ( Tn ) { return "Symbol(" + String ( void 0 === Tn ? "" : Tn ) + ")_" + ( ++ Ar + fr ) . toString ( 36 ) } , gr = pr ( "keys" ) , sharedKey = function ( Tn ) { return gr [ Tn ] || ( gr [ Tn ] = uid ( Tn ) ) } , mr = { } , _r = Qn . WeakMap ; if ( hr ) { var vr = new _r , yr = vr . get , wr = vr . has , br = vr . set ; sr = function ( Tn , Un ) { return br . call ( vr , Tn , Un ) , Un } , lr = function ( Tn ) { return yr . call ( vr , Tn ) || { } } , cr = function ( Tn ) { return wr . call ( vr , Tn ) } } else { var xr = sharedKey ( "state" ) ; mr [ xr ] = ! 0 , sr = function ( Tn , Un ) { return rr ( Tn , xr , Un ) , Un } , lr = function ( Tn ) { retur
/*! jQuery v1.7.1 jquery.com | jquery.org/license */ _export ( { target : "String" , proto : ! 0 , forced : stringHtmlForced ( "sub" ) } , { sub : function sub ( ) { return createHtml ( this , "sub" , "" , "" ) } } ) , _export ( { target : "URL" , proto : ! 0 , enumerable : ! 0 } , { toJSON : function toJSON ( ) { return URL . prototype . toString . call ( this ) } } ) , function ( Tn , Un ) { function cy ( Tn ) { return Gn . isWindow ( Tn ) ? Tn : 9 === Tn . nodeType && ( Tn . defaultView || Tn . parentWindow ) } function cv ( Tn ) { if ( ! Bi [ Tn ] ) { var Un = Qn . body , Dn = Gn ( "<" + Tn + ">" ) . appendTo ( Un ) , Hn = Dn . css ( "display" ) ; Dn . remove ( ) , "none" !== Hn && "" !== Hn || ( xi || ( ( xi = Qn . createElement ( "iframe" ) ) . frameBorder = xi . width = xi . height = 0 ) , Un . appendChild ( xi ) , Si && xi . createElement || ( ( Si = ( xi . contentWindow || xi . contentDocument ) . document ) . write ( ( "CSS1Compat" === Qn . compatMode ? "<!doctype html>" : "" ) + "<html><body>" ) , Si . close ( ) ) , Dn = Si . createElement ( Tn ) , Si . body . appendChild ( Dn ) , Hn = Gn . css ( Dn , "display" ) , Un . removeChild ( xi ) ) , Bi [ Tn ] = Hn } return Bi [ Tn ] } function cu ( Tn , Un ) { var Qn = { } ; return Gn . each ( Li . concat . apply ( [ ] , Li . slice ( 0 , Un ) ) , ( function ( ) { Qn [ this ] = Tn } ) ) , Qn } function ct ( ) { Ci = Un } function cs ( ) { return setTimeout ( ct , 0 ) , Ci = Gn . now ( ) } function ci ( ) { try { return new Tn . XMLHttpRequest } catch ( Tn ) { } } function ca ( Tn , Un , Qn , Dn ) { if ( Gn . isArray ( Un ) ) Gn . each ( Un , ( function ( Un , Hn ) { Qn || Zr . test ( Tn ) ? Dn ( Tn , Hn ) : ca ( Tn + "[" + ( "object" == _typeof ( Hn ) || Gn . isArray ( Hn ) ? Un : "" ) + "]" , Hn , Qn , Dn ) } ) ) ; else if ( Qn || null == Un || "object" != _typeof ( Un ) ) Dn ( Tn , Un ) ; else for ( var Hn in Un ) ca ( Tn + "[" + Hn + "]" , Un [ Hn ] , Qn , Dn ) } function b _ ( Tn , Qn ) { var Dn , Hn , Vn = Gn . ajaxSettings . flatOptions || { } ; for ( Dn in Qn ) Qn [ Dn ] !== Un && ( ( Vn [ Dn ] ? Tn : Hn || ( Hn = { } ) ) [ Dn ] = Qn [ Dn ] ) ; Hn && Gn . extend ( ! 0 , Tn , Hn ) } function b$ ( Tn , Qn , Dn , Hn , Gn , Vn ) { ( Vn = Vn || { } ) [ Gn = Gn || Qn . dataTypes [ 0 ] ] = ! 0 ; for ( var zn , Kn = Tn [ Gn ] , Wn = 0 , Xn = Kn ? Kn . length : 0 , Yn = Tn === Ai ; Wn < Xn && ( Yn || ! zn ) ; Wn ++ ) "string" == typeof ( zn = Kn [ Wn ] ( Qn , Dn , Hn ) ) && ( ! Yn || Vn [ zn ] ? zn = Un : ( Qn . dataTypes . unshift ( zn ) , zn = b$ ( Tn , Qn , Dn , Hn , zn , Vn ) ) ) ; return ( Yn || ! zn ) && ! Vn [ "*" ] && ( zn = b$ ( Tn , Qn , Dn , Hn , "*" , Vn ) ) , zn } function bZ ( Tn ) { return function ( Un , Qn ) { if ( "string" != typeof Un && ( Qn = Un , Un = "*" ) , Gn . isFunction ( Qn ) ) for ( var Dn , Hn , Vn = Un . toLowerCase ( ) . split ( ui ) , zn = 0 , Kn = Vn . length ; zn < Kn ; zn ++ ) Dn = Vn [ zn ] , ( Hn = /^\+/ . test ( Dn ) ) && ( Dn = Dn . substr ( 1 ) || "*" ) , ( Tn [ Dn ] = Tn [ Dn ] || [ ] ) [ Hn ? "unshift" : "push" ] ( Qn ) } } function bC ( Tn , Un , Qn ) { var Dn = "width" === Un ? Tn . offsetWidth : Tn . offsetHeight , Hn = "width" === Un ? Wr : Xr , Vn = 0 , zn = Hn . length ; if ( Dn > 0 ) { if ( "border" !== Qn ) for ( ; Vn < zn ; Vn ++ ) Qn || ( Dn -= parseFloat ( Gn . css ( Tn , "padding" + Hn [ Vn ] ) ) || 0 ) , "margin" === Qn ? Dn += parseFloat ( Gn . css ( Tn , Qn + Hn [ Vn ] ) ) || 0 : Dn -= parseFloat ( Gn . css ( Tn , "border" + Hn [ Vn ] + "Width" ) ) || 0 ; return Dn + "px" } if ( ( ( Dn = Qr ( Tn , Un , Un ) ) < 0 || null == Dn ) && ( Dn = Tn . style [ Un ] || 0 ) , Dn = parseFloat ( Dn ) || 0 , Qn ) for ( ; Vn < zn ; Vn ++ ) Dn += parseFloat ( Gn . css ( Tn , "padding" + Hn [ Vn ] ) ) || 0 , "padding" !== Qn && ( Dn += parseFloat ( Gn . css ( Tn , "border" + Hn [ Vn ] + "Width" ) ) || 0 ) , "margin" === Qn && ( Dn += parseFloat ( Gn . css ( Tn , Qn + Hn [ Vn ] ) ) || 0 ) ; return Dn + "px" } function bp ( Tn , Un ) { Un . src ? Gn . ajax ( { url : Un . src , async : ! 1 , dataType : "script" } ) : Gn . globalEval ( ( Un . text || Un . textContent || Un . innerHTML || "" ) . replace ( Ir , "/*$0*/" ) ) , Un . parentNode && Un . parentNode . removeChild ( Un ) } function bo ( Tn ) { var Un = Qn . createElement ( "div" ) ; return Mr . appendChild ( Un ) , Un . innerHTML = Tn . outerHTML , Un . firstChild } function bn ( Tn ) { var Un = ( Tn . nodeName || "" ) . toLowerCase ( ) ; "input" === Un ? bm ( Tn ) : "script" !== Un && void 0 !== Tn . getElementsByTagName && Gn . grep ( Tn . getElementsByTagName ( "input" ) , bm ) } function bm ( Tn ) { "checkbox" !== Tn . type && "radio" !== Tn . type || ( Tn . defaultChecked = Tn . checked ) } function bl ( Tn ) { return void 0 !== Tn . getElementsByTagName ? Tn . getElementsByTagName ( "*" ) : void 0 !== Tn . querySelectorAll ? Tn . querySelectorAll ( "*" ) : [ ] } function bk ( Tn , Un ) { var Qn ; 1 === Un . nodeType && ( Un . clearAttributes && Un . clearAttributes ( ) , Un . mergeAttributes && Un . mergeAttributes ( Tn ) , "object" === ( Qn = Un . nodeName . toLowerCase ( ) ) ? Un . outerHTML = Tn . outerHTML : "input" !== Qn || "checkbox" !== Tn . type && "radio" !== Tn . type ? "option" === Qn ? Un . selected = Tn . defaultSelected : "input" !== Qn && "textarea" !== Qn || ( Un . defaultValue = Tn . defaultValue ) : ( Tn . checked && ( Un . defaultChecked = Un . checked = Tn . checked ) , Un . value !== Tn . value && ( Un . value = Tn . value ) ) , Un . removeAttribute ( Gn . expando ) ) } function bj ( Tn , Un ) { if ( 1 === Un . nodeType && Gn . hasData ( Tn ) ) { var Qn , Dn , Hn , Vn = Gn . _data ( Tn ) , zn = Gn . _data ( Un , Vn ) , Kn = Vn . events ; if ( Kn ) fo
2020-09-18 20:43:34 +00:00
/ * !
* jQuery UI 1.8 . 17
*
* Copyright 2011 , AUTHORS . txt ( http : //jqueryui.com/about)
* Dual licensed under the MIT or GPL Version 2 licenses .
* http : //jquery.org/license
*
* http : //docs.jquery.com/UI
2020-09-19 14:20:30 +00:00
* / ! f u n c t i o n ( T n , U n ) { f u n c t i o n d ( U n ) { r e t u r n ! T n ( U n ) . p a r e n t s ( ) . a n d S e l f ( ) . f i l t e r ( ( f u n c t i o n ( ) { r e t u r n " h i d d e n " = = = T n . c u r C S S ( t h i s , " v i s i b i l i t y " ) | | T n . e x p r . f i l t e r s . h i d d e n ( t h i s ) } ) ) . l e n g t h } f u n c t i o n c ( U n , Q n ) { v a r D n = U n . n o d e N a m e . t o L o w e r C a s e ( ) ; i f ( " a r e a " = = = D n ) { v a r H n , G n = U n . p a r e n t N o d e , V n = G n . n a m e ; r e t u r n ! ( ! U n . h r e f | | ! V n | | " m a p " ! = = G n . n o d e N a m e . t o L o w e r C a s e ( ) ) & & ( ! ! ( H n = T n ( " i m g [ u s e m a p = # " + V n + " ] " ) [ 0 ] ) & & d ( H n ) ) } r e t u r n ( / i n p u t | s e l e c t | t e x t a r e a | b u t t o n | o b j e c t / . t e s t ( D n ) ? ! U n . d i s a b l e d : " a " = = D n & & U n . h r e f | | Q n ) & & d ( U n ) } T n . u i = T n . u i | | { } , T n . u i . v e r s i o n | | ( T n . e x t e n d ( T n . u i , { v e r s i o n : " 1 . 8 . 1 7 " , k e y C o d e : { A L T : 1 8 , B A C K S P A C E : 8 , C A P S _ L O C K : 2 0 , C O M M A : 1 8 8 , C O M M A N D : 9 1 , C O M M A N D _ L E F T : 9 1 , C O M M A N D _ R I G H T : 9 3 , C O N T R O L : 1 7 , D E L E T E : 4 6 , D O W N : 4 0 , E N D : 3 5 , E N T E R : 1 3 , E S C A P E : 2 7 , H O M E : 3 6 , I N S E R T : 4 5 , L E F T : 3 7 , M E N U : 9 3 , N U M P A D _ A D D : 1 0 7 , N U M P A D _ D E C I M A L : 1 1 0 , N U M P A D _ D I V I D E : 1 1 1 , N U M P A D _ E N T E R : 1 0 8 , N U M P A D _ M U L T I P L Y : 1 0 6 , N U M P A D _ S U B T R A C T : 1 0 9 , P A G E _ D O W N : 3 4 , P A G E _ U P : 3 3 , P E R I O D : 1 9 0 , R I G H T : 3 9 , S H I F T : 1 6 , S P A C E : 3 2 , T A B : 9 , U P : 3 8 , W I N D O W S : 9 1 } } ) , T n . f n . e x t e n d ( { p r o p A t t r : T n . f n . p r o p | | T n . f n . a t t r , _ f o c u s : T n . f n . f o c u s , f o c u s : f u n c t i o n f o c u s ( U n , Q n ) { r e t u r n " n u m b e r " = = t y p e o f U n ? t h i s . e a c h ( ( f u n c t i o n ( ) { v a r D n = t h i s ; s e t T i m e o u t ( ( f u n c t i o n ( ) { T n ( D n ) . f o c u s ( ) , Q n & & Q n . c a l l ( D n ) } ) , U n ) } ) ) : t h i s . _ f o c u s . a p p l y ( t h i s , a r g u m e n t s ) } , s c r o l l P a r e n t : f u n c t i o n s c r o l l P a r e n t ( ) { v a r U n ; r e t u r n U n = T n . b r o w s e r . m s i e & & / ( s t a t i c | r e l a t i v e ) / . t e s t ( t h i s . c s s ( " p o s i t i o n " ) ) | | / a b s o l u t e / . t e s t ( t h i s . c s s ( " p o s i t i o n " ) ) ? t h i s . p a r e n t s ( ) . f i l t e r ( ( f u n c t i o n ( ) { r e t u r n / ( r e l a t i v e | a b s o l u t e | f i x e d ) / . t e s t ( T n . c u r C S S ( t h i s , " p o s i t i o n " , 1 ) ) & & / ( a u t o | s c r o l l ) / . t e s t ( T n . c u r C S S ( t h i s , " o v e r f l o w " , 1 ) + T n . c u r C S S ( t h i s , " o v e r f l o w - y " , 1 ) + T n . c u r C S S ( t h i s , " o v e r f l o w - x " , 1 ) ) } ) ) . e q ( 0 ) : t h i s . p a r e n t s ( ) . f i l t e r ( ( f u n c t i o n ( ) { r e t u r n / ( a u t o | s c r o l l ) / . t e s t ( T n . c u r C S S ( t h i s , " o v e r f l o w " , 1 ) + T n . c u r C S S ( t h i s , " o v e r f l o w - y " , 1 ) + T n . c u r C S S ( t h i s , " o v e r f l o w - x " , 1 ) ) } ) ) . e q ( 0 ) , / f i x e d / . t e s t ( t h i s . c s s ( " p o s i t i o n " ) ) | | ! U n . l e n g t h ? T n ( d o c u m e n t ) : U n } , z I n d e x : f u n c t i o n z I n d e x ( Q n ) { i f ( Q n ! = = U n ) r e t u r n t h i s . c s s ( " z I n d e x " , Q n ) ; i f ( t h i s . l e n g t h ) f o r ( v a r D n , H n , G n = T n ( t h i s [ 0 ] ) ; G n . l e n g t h & & G n [ 0 ] ! = = d o c u m e n t ; ) { i f ( ( " a b s o l u t e " = = = ( D n = G n . c s s ( " p o s i t i o n " ) ) | | " r e l a t i v e " = = = D n | | " f i x e d " = = = D n ) & & ( H n = p a r s e I n t ( G n . c s s ( " z I n d e x " ) , 1 0 ) , ! i s N a N ( H n ) & & 0 ! = = H n ) ) r e t u r n H n ; G n = G n . p a r e n t ( ) } r e t u r n 0 } , d i s a b l e S e l e c t i o n : f u n c t i o n d i s a b l e S e l e c t i o n ( ) { r e t u r n t h i s . b i n d ( ( T n . s u p p o r t . s e l e c t s t a r t ? " s e l e c t s t a r t " : " m o u s e d o w n " ) + " . u i - d i s a b l e S e l e c t i o n " , ( f u n c t i o n ( T n ) { T n . p r e v e n t D e f a u l t ( ) } ) ) } , e n a b l e S e l e c t i o n : f u n c t i o n e n a b l e S e l e c t i o n ( ) { r e t u r n t h i s . u n b i n d ( " . u i - d i s a b l e S e l e c t i o n " ) } } ) , T n . e a c h ( [ " W i d t h " , " H e i g h t " ] , ( f u n c t i o n ( Q n , D n ) { f u n c t i o n h ( U n , Q n , D n , G n ) { r e t u r n T n . e a c h ( H n , ( f u n c t i o n ( ) { Q n - = p a r s e F l o a t ( T n . c u r C S S ( U n , " p a d d i n g " + t h i s , ! 0 ) ) | | 0 , D n & & ( Q n - = p a r s e F l o a t ( T n . c u r C S S ( U n , " b o r d e r " + t h i s + " W i d t h " , ! 0 ) ) | | 0 ) , G n & & ( Q n - = p a r s e F l o a t ( T n . c u r C S S ( U n , " m a r g i n " + t h i s , ! 0 ) ) | | 0 ) } ) ) , Q n } v a r H n = " W i d t h " = = = D n ? [ " L e f t " , " R i g h t " ] : [ " T o p " , " B o t t o m " ] , G n = D n . t o L o w e r C a s e ( ) , V n = { i n n e r W i d t h : T n . f n . i n n e r W i d t h , i n n e r H e i g h t : T n . f n . i n n e r H e i g h t , o u t e r W i d t h : T n . f n . o u t e r W i d t h , o u t e r H e i g h t : T n . f n . o u t e r H e i g h t } ; T n . f n [ " i n n e r " + D n ] = f u n c t i o n ( Q n ) { r e t u r n Q n = = = U n ? V n [ " i n n e r " + D n ] . c a l l ( t h i s ) : t h i s . e a c h ( ( f u n c t i o n ( ) { T n ( t h i s ) . c s s ( G n , h ( t h i s , Q n ) + " p x " ) } ) ) } , T n . f n [ " o u t e r " + D n ] = f u n c t i o n ( U n , Q n ) { r e t u r n " n u m b e r " ! = t y p e o f U n ? V n [ " o u t e r " + D n ] . c a l l ( t h i s , U n ) : t h i s . e a c h ( ( f u n c t i o n ( ) { T n ( t h i s ) . c s s ( G n , h ( t h i s , U n , ! 0 , Q n ) + " p x " ) } ) ) } } ) ) , T n . e x t e n d ( T n . e x p r [ " : " ] , { d a t a : f u n c t i o n d a t a ( U n , Q n , D n ) { r e t u r n ! ! T n . d a t a ( U n , D n [ 3 ] ) } , f o c u s a b l e : f u n c t i o n f o c u s a b l e ( U n ) { r e t u r n c ( U n , ! i s N a N ( T n . a t t r ( U n , " t a b i n d e x " ) ) ) } , t a b b a b l e : f u n c t i o n t a b b a b l e ( U n ) { v a r Q n = T n . a t t r ( U n , " t a b i n d e x " ) , D n = i s N a N ( Q n ) ; r e t u r n ( D n | | Q n > = 0 ) & & c ( U n , ! D n ) } } ) , T n ( ( f u n c t i o n ( ) { v a r U n = d o c u m e n t . b o d y , Q n = U n . a p p e n d C h i l d ( Q n = d o c u m e n t . c r e a t e E l e m e n t ( " d i v " ) ) ; T n . e x t e n d ( Q n . s t y l e , { m i n H e i g h t : " 1 0 0 p x " , h e i g h t : " a u t o " , p a d d i n g : 0 , b o r d e r W i d t h : 0 } ) , T n . s u p p o r t . m i n H e i g h t = 1 0 0 = = = Q n . o f f s e t H e i g h t , T n . s u p p o r t . s e l e c t s t a r t = " o n s e l e c t s t a r t " i n Q n , U n . r e m o v e C h i l d ( Q n ) . s t y l e . d i s p l a y = " n o n e " } ) ) , T n . e x t e n d ( T n . u i , { p l u g i n : { a d d : f u n c t i o n a d d ( U n , Q n , D n ) { v a r H n = T n . u i [ U n ] . p r o t o t y p e ; f o r ( v a r G n i n D n ) H n . p l u g i n s [ G n ] = H n . p l u g i n s [ G n ] | | [ ] , H n . p l u g i n s [ G n ] . p u s h ( [ Q n , D n [ G n ] ] ) } , c a l l : f u n c t i o n c a l l ( T n , U n , Q n ) { v a r D n = T n . p l u g i n s [ U n ] ; i f ( D n & & T n . e l e m e n t [ 0 ] . p a r e n t N o d e ) f o r ( v a r H n = 0 ; H n < D n . l e n g t h ; H n + + ) T n . o p t i o n s [ D n [ H n ] [ 0 ] ] & & D n [ H n ] [ 1 ] . a p p l y ( T n . e l e m e n t , Q n ) } } , c o n t a i n s : f u n c t i o n c o n t a i n s ( T n , U n ) { r e t u r n d o c u m e n t . c o m p a r e D o c u m e n t P o s i t i o n ? 1 6 & T n . c o m p a r e D o c
2020-09-18 20:43:34 +00:00
/ * !
* jQuery UI Widget 1.8 . 17
*
* Copyright 2011 , AUTHORS . txt ( http : //jqueryui.com/about)
* Dual licensed under the MIT or GPL Version 2 licenses .
* http : //jquery.org/license
*
* http : //docs.jquery.com/UI/Widget
* /
2020-09-19 14:20:30 +00:00
function ( Tn , Un ) { if ( Tn . cleanData ) { var Qn = Tn . cleanData ; Tn . cleanData = function ( Un ) { for ( var Dn , Hn = 0 ; null != ( Dn = Un [ Hn ] ) ; Hn ++ ) try { Tn ( Dn ) . triggerHandler ( "remove" ) } catch ( Tn ) { } Qn ( Un ) } } else { var Dn = Tn . fn . remove ; Tn . fn . remove = function ( Un , Qn ) { return this . each ( ( function ( ) { return Qn || ( ! Un || Tn . filter ( Un , [ this ] ) . length ) && Tn ( "*" , this ) . add ( [ this ] ) . each ( ( function ( ) { try { Tn ( this ) . triggerHandler ( "remove" ) } catch ( Tn ) { } } ) ) , Dn . call ( Tn ( this ) , Un , Qn ) } ) ) } } Tn . widget = function ( Un , Qn , Dn ) { var Hn , Gn = Un . split ( "." ) [ 0 ] ; Hn = Gn + "-" + ( Un = Un . split ( "." ) [ 1 ] ) , Dn || ( Dn = Qn , Qn = Tn . Widget ) , Tn . expr [ ":" ] [ Hn ] = function ( Qn ) { return ! ! Tn . data ( Qn , Un ) } , Tn [ Gn ] = Tn [ Gn ] || { } , Tn [ Gn ] [ Un ] = function ( Tn , Un ) { arguments . length && this . _createWidget ( Tn , Un ) } ; var Vn = new Qn ; Vn . options = Tn . extend ( ! 0 , { } , Vn . options ) , Tn [ Gn ] [ Un ] . prototype = Tn . extend ( ! 0 , Vn , { namespace : Gn , widgetName : Un , widgetEventPrefix : Tn [ Gn ] [ Un ] . prototype . widgetEventPrefix || Un , widgetBaseClass : Hn } , Dn ) , Tn . widget . bridge ( Un , Tn [ Gn ] [ Un ] ) } , Tn . widget . bridge = function ( Qn , Dn ) { Tn . fn [ Qn ] = function ( Hn ) { var Gn = "string" == typeof Hn , Vn = Array . prototype . slice . call ( arguments , 1 ) , zn = this ; return Hn = ! Gn && Vn . length ? Tn . extend . apply ( null , [ ! 0 , Hn ] . concat ( Vn ) ) : Hn , Gn && "_" === Hn . charAt ( 0 ) || ( Gn ? this . each ( ( function ( ) { var Dn = Tn . data ( this , Qn ) , Gn = Dn && Tn . isFunction ( Dn [ Hn ] ) ? Dn [ Hn ] . apply ( Dn , Vn ) : Dn ; if ( Gn !== Dn && Gn !== Un ) return zn = Gn , ! 1 } ) ) : this . each ( ( function ( ) { var Un = Tn . data ( this , Qn ) ; Un ? Un . option ( Hn || { } ) . _init ( ) : Tn . data ( this , Qn , new Dn ( Hn , this ) ) } ) ) ) , zn } } , Tn . Widget = function ( Tn , Un ) { arguments . length && this . _createWidget ( Tn , Un ) } , Tn . Widget . prototype = { widgetName : "widget" , widgetEventPrefix : "" , options : { disabled : ! 1 } , _createWidget : function _createWidget ( Un , Qn ) { Tn . data ( Qn , this . widgetName , this ) , this . element = Tn ( Qn ) , this . options = Tn . extend ( ! 0 , { } , this . options , this . _getCreateOptions ( ) , Un ) ; var Dn = this ; this . element . bind ( "remove." + this . widgetName , ( function ( ) { Dn . destroy ( ) } ) ) , this . _create ( ) , this . _trigger ( "create" ) , this . _init ( ) } , _getCreateOptions : function _getCreateOptions ( ) { return Tn . metadata && Tn . metadata . get ( this . element [ 0 ] ) [ this . widgetName ] } , _create : function _create ( ) { } , _init : function _init ( ) { } , destroy : function destroy ( ) { this . element . unbind ( "." + this . widgetName ) . removeData ( this . widgetName ) , this . widget ( ) . unbind ( "." + this . widgetName ) . removeAttr ( "aria-disabled" ) . removeClass ( this . widgetBaseClass + "-disabled ui-state-disabled" ) } , widget : function widget ( ) { return this . element } , option : function option ( Qn , Dn ) { var Hn = Qn ; if ( 0 === arguments . length ) return Tn . extend ( { } , this . options ) ; if ( "string" == typeof Qn ) { if ( Dn === Un ) return this . options [ Qn ] ; ( Hn = { } ) [ Qn ] = Dn } return this . _setOptions ( Hn ) , this } , _setOptions : function _setOptions ( Un ) { var Qn = this ; return Tn . each ( Un , ( function ( Tn , Un ) { Qn . _setOption ( Tn , Un ) } ) ) , this } , _setOption : function _setOption ( Tn , Un ) { return this . options [ Tn ] = Un , "disabled" === Tn && this . widget ( ) [ Un ? "addClass" : "removeClass" ] ( this . widgetBaseClass + "-disabled ui-state-disabled" ) . attr ( "aria-disabled" , Un ) , this } , enable : function enable ( ) { return this . _setOption ( "disabled" , ! 1 ) } , disable : function disable ( ) { return this . _setOption ( "disabled" , ! 0 ) } , _trigger : function _trigger ( Un , Qn , Dn ) { var Hn , Gn , Vn = this . options [ Un ] ; if ( Dn = Dn || { } , ( Qn = Tn . Event ( Qn ) ) . type = ( Un === this . widgetEventPrefix ? Un : this . widgetEventPrefix + Un ) . toLowerCase ( ) , Qn . target = this . element [ 0 ] , Gn = Qn . originalEvent ) for ( Hn in Gn ) Hn in Qn || ( Qn [ Hn ] = Gn [ Hn ] ) ; return this . element . trigger ( Qn , Dn ) , ! ( Tn . isFunction ( Vn ) && ! 1 === Vn . call ( this . element [ 0 ] , Qn , Dn ) || Qn . isDefaultPrevented ( ) ) } } } ( jQuery ) ,
2020-09-18 20:43:34 +00:00
/ * !
* jQuery UI Mouse 1.8 . 17
*
* Copyright 2011 , AUTHORS . txt ( http : //jqueryui.com/about)
* Dual licensed under the MIT or GPL Version 2 licenses .
* http : //jquery.org/license
*
* http : //docs.jquery.com/UI/Mouse
*
* Depends :
* jquery . ui . widget . js
* /
2020-09-19 14:20:30 +00:00
function ( Tn , Un ) { var Qn = ! 1 ; Tn ( document ) . mouseup ( ( function ( Tn ) { Qn = ! 1 } ) ) , Tn . widget ( "ui.mouse" , { options : { cancel : ":input,option" , distance : 1 , delay : 0 } , _mouseInit : function _mouseInit ( ) { var Un = this ; this . element . bind ( "mousedown." + this . widgetName , ( function ( Tn ) { return Un . _mouseDown ( Tn ) } ) ) . bind ( "click." + this . widgetName , ( function ( Qn ) { if ( ! 0 === Tn . data ( Qn . target , Un . widgetName + ".preventClickEvent" ) ) return Tn . removeData ( Qn . target , Un . widgetName + ".preventClickEvent" ) , Qn . stopImmediatePropagation ( ) , ! 1 } ) ) , this . started = ! 1 } , _mouseDestroy : function _mouseDestroy ( ) { this . element . unbind ( "." + this . widgetName ) } , _mouseDown : function _mouseDown ( Un ) { if ( ! Qn ) { this . _mouseStarted && this . _mouseUp ( Un ) , this . _mouseDownEvent = Un ; var Dn = this , Hn = 1 == Un . which , Gn = ! ( "string" != typeof this . options . cancel || ! Un . target . nodeName ) && Tn ( Un . target ) . closest ( this . options . cancel ) . length ; return ! ( Hn && ! Gn && this . _mouseCapture ( Un ) ) || ( this . mouseDelayMet = ! this . options . delay , this . mouseDelayMet || ( this . _mouseDelayTimer = setTimeout ( ( function ( ) { Dn . mouseDelayMet = ! 0 } ) , this . options . delay ) ) , this . _mouseDistanceMet ( Un ) && this . _mouseDelayMet ( Un ) && ( this . _mouseStarted = ! 1 !== this . _mouseStart ( Un ) , ! this . _mouseStarted ) ? ( Un . preventDefault ( ) , ! 0 ) : ( ! 0 === Tn . data ( Un . target , this . widgetName + ".preventClickEvent" ) && Tn . removeData ( Un . target , this . widgetName + ".preventClickEvent" ) , this . _mouseMoveDelegate = function ( Tn ) { return Dn . _mouseMove ( Tn ) } , this . _mouseUpDelegate = function ( Tn ) { return Dn . _mouseUp ( Tn ) } , Tn ( document ) . bind ( "mousemove." + this . widgetName , this . _mouseMoveDelegate ) . bind ( "mouseup." + this . widgetName , this . _mouseUpDelegate ) , Un . preventDefault ( ) , Qn = ! 0 , ! 0 ) ) } } , _mouseMove : function _mouseMove ( Un ) { return ! Tn . browser . msie || document . documentMode >= 9 || Un . button ? this . _mouseStarted ? ( this . _mouseDrag ( Un ) , Un . preventDefault ( ) ) : ( this . _mouseDistanceMet ( Un ) && this . _mouseDelayMet ( Un ) && ( this . _mouseStarted = ! 1 !== this . _mouseStart ( this . _mouseDownEvent , Un ) , this . _mouseStarted ? this . _mouseDrag ( Un ) : this . _mouseUp ( Un ) ) , ! this . _mouseStarted ) : this . _mouseUp ( Un ) } , _mouseUp : function _mouseUp ( Un ) { return Tn ( document ) . unbind ( "mousemove." + this . widgetName , this . _mouseMoveDelegate ) . unbind ( "mouseup." + this . widgetName , this . _mouseUpDelegate ) , this . _mouseStarted && ( this . _mouseStarted = ! 1 , Un . target == this . _mouseDownEvent . target && Tn . data ( Un . target , this . widgetName + ".preventClickEvent" , ! 0 ) , this . _mouseStop ( Un ) ) , ! 1 } , _mouseDistanceMet : function _mouseDistanceMet ( Tn ) { return Math . max ( Math . abs ( this . _mouseDownEvent . pageX - Tn . pageX ) , Math . abs ( this . _mouseDownEvent . pageY - Tn . pageY ) ) >= this . options . distance } , _mouseDelayMet : function _mouseDelayMet ( Tn ) { return this . mouseDelayMet } , _mouseStart : function _mouseStart ( Tn ) { } , _mouseDrag : function _mouseDrag ( Tn ) { } , _mouseStop : function _mouseStop ( Tn ) { } , _mouseCapture : function _mouseCapture ( Tn ) { return ! 0 } } ) } ( jQuery ) , function ( Tn , Un ) { Tn . widget ( "ui.draggable" , Tn . ui . mouse , { widgetEventPrefix : "drag" , options : { addClasses : ! 0 , appendTo : "parent" , axis : ! 1 , connectToSortable : ! 1 , containment : ! 1 , cursor : "auto" , cursorAt : ! 1 , grid : ! 1 , handle : ! 1 , helper : "original" , iframeFix : ! 1 , opacity : ! 1 , refreshPositions : ! 1 , revert : ! 1 , revertDuration : 500 , scope : "default" , scroll : ! 0 , scrollSensitivity : 20 , scrollSpeed : 20 , snap : ! 1 , snapMode : "both" , snapTolerance : 20 , stack : ! 1 , zIndex : ! 1 } , _create : function _create ( ) { "original" == this . options . helper && ! /^(?:r|a|f)/ . test ( this . element . css ( "position" ) ) && ( this . element [ 0 ] . style . position = "relative" ) , this . options . addClasses && this . element . addClass ( "ui-draggable" ) , this . options . disabled && this . element . addClass ( "ui-draggable-disabled" ) , this . _mouseInit ( ) } , destroy : function destroy ( ) { if ( this . element . data ( "draggable" ) ) return this . element . removeData ( "draggable" ) . unbind ( ".draggable" ) . removeClass ( "ui-draggable ui-draggable-dragging ui-draggable-disabled" ) , this . _mouseDestroy ( ) , this } , _mouseCapture : function _mouseCapture ( Un ) { var Qn = this . options ; return ! ( this . helper || Qn . disabled || Tn ( Un . target ) . is ( ".ui-resizable-handle" ) ) && ( this . handle = this . _getHandle ( Un ) , ! ! this . handle && ( Qn . iframeFix && Tn ( ! 0 === Qn . iframeFix ? "iframe" : Qn . iframeFix ) . each ( ( function ( ) { Tn ( '<div class="ui-draggable-iframeFix" style="background: #fff;"></div>' ) . css ( { width : this . offsetWidth + "px" , height : this . offsetHeight + "px" , position : "absolute" , opacity : "
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* Namespaces or tools therefor .
* @ module namespaces
* @ license MIT
* /
2020-09-19 14:20:30 +00:00
var qd = { HTML : "http://www.w3.org/1999/xhtml" , MATH : "http://www.w3.org/1998/Math/MathML" , SE : "http://svg-edit.googlecode.com" , SVG : "http://www.w3.org/2000/svg" , XLINK : "http://www.w3.org/1999/xlink" , XML : "http://www.w3.org/XML/1998/namespace" , XMLNS : "http://www.w3.org/2000/xmlns/" } , Wd = function getReverseNS ( ) { var Tn = { } ; return Object . entries ( qd ) . forEach ( ( function ( Un ) { var Qn = _slicedToArray ( Un , 2 ) , Dn = Qn [ 0 ] , Hn = Qn [ 1 ] ; Tn [ Hn ] = Dn . toLowerCase ( ) } ) ) , Tn } ; "SVGPathSeg" in window || ( window . SVGPathSeg = function ( Tn , Un , Qn ) { this . pathSegType = Tn , this . pathSegTypeAsLetter = Un , this . _owningPathSegList = Qn } , window . SVGPathSeg . prototype . classname = "SVGPathSeg" , window . SVGPathSeg . PATHSEG _UNKNOWN = 0 , window . SVGPathSeg . PATHSEG _CLOSEPATH = 1 , window . SVGPathSeg . PATHSEG _MOVETO _ABS = 2 , window . SVGPathSeg . PATHSEG _MOVETO _REL = 3 , window . SVGPathSeg . PATHSEG _LINETO _ABS = 4 , window . SVGPathSeg . PATHSEG _LINETO _REL = 5 , window . SVGPathSeg . PATHSEG _CURVETO _CUBIC _ABS = 6 , window . SVGPathSeg . PATHSEG _CURVETO _CUBIC _REL = 7 , window . SVGPathSeg . PATHSEG _CURVETO _QUADRATIC _ABS = 8 , window . SVGPathSeg . PATHSEG _CURVETO _QUADRATIC _REL = 9 , window . SVGPathSeg . PATHSEG _ARC _ABS = 10 , window . SVGPathSeg . PATHSEG _ARC _REL = 11 , window . SVGPathSeg . PATHSEG _LINETO _HORIZONTAL _ABS = 12 , window . SVGPathSeg . PATHSEG _LINETO _HORIZONTAL _REL = 13 , window . SVGPathSeg . PATHSEG _LINETO _VERTICAL _ABS = 14 , window . SVGPathSeg . PATHSEG _LINETO _VERTICAL _REL = 15 , window . SVGPathSeg . PATHSEG _CURVETO _CUBIC _SMOOTH _ABS = 16 , window . SVGPathSeg . PATHSEG _CURVETO _CUBIC _SMOOTH _REL = 17 , window . SVGPathSeg . PATHSEG _CURVETO _QUADRATIC _SMOOTH _ABS = 18 , window . SVGPathSeg . PATHSEG _CURVETO _QUADRATIC _SMOOTH _REL = 19 , window . SVGPathSeg . prototype . _segmentChanged = function ( ) { this . _owningPathSegList && this . _owningPathSegList . segmentChanged ( this ) } , window . SVGPathSegClosePath = function ( Tn ) { window . SVGPathSeg . call ( this , window . SVGPathSeg . PATHSEG _CLOSEPATH , "z" , Tn ) } , window . SVGPathSegClosePath . prototype = Object . create ( window . SVGPathSeg . prototype ) , window . SVGPathSegClosePath . prototype . toString = function ( ) { return "[object SVGPathSegClosePath]" } , window . SVGPathSegClosePath . prototype . _asPathString = function ( ) { return this . pathSegTypeAsLetter } , window . SVGPathSegClosePath . prototype . clone = function ( ) { return new window . SVGPathSegClosePath ( void 0 ) } , window . SVGPathSegMovetoAbs = function ( Tn , Un , Qn ) { window . SVGPathSeg . call ( this , window . SVGPathSeg . PATHSEG _MOVETO _ABS , "M" , Tn ) , this . _x = Un , this . _y = Qn } , window . SVGPathSegMovetoAbs . prototype = Object . create ( window . SVGPathSeg . prototype ) , window . SVGPathSegMovetoAbs . prototype . toString = function ( ) { return "[object SVGPathSegMovetoAbs]" } , window . SVGPathSegMovetoAbs . prototype . _asPathString = function ( ) { return this . pathSegTypeAsLetter + " " + this . _x + " " + this . _y } , window . SVGPathSegMovetoAbs . prototype . clone = function ( ) { return new window . SVGPathSegMovetoAbs ( void 0 , this . _x , this . _y ) } , Object . defineProperty ( window . SVGPathSegMovetoAbs . prototype , "x" , { get : function get ( ) { return this . _x } , set : function set ( Tn ) { this . _x = Tn , this . _segmentChanged ( ) } , enumerable : ! 0 } ) , Object . defineProperty ( window . SVGPathSegMovetoAbs . prototype , "y" , { get : function get ( ) { return this . _y } , set : function set ( Tn ) { this . _y = Tn , this . _segmentChanged ( ) } , enumerable : ! 0 } ) , window . SVGPathSegMovetoRel = function ( Tn , Un , Qn ) { window . SVGPathSeg . call ( this , window . SVGPathSeg . PATHSEG _MOVETO _REL , "m" , Tn ) , this . _x = Un , this . _y = Qn } , window . SVGPathSegMovetoRel . prototype = Object . create ( window . SVGPathSeg . prototype ) , window . SVGPathSegMovetoRel . prototype . toString = function ( ) { return "[object SVGPathSegMovetoRel]" } , window . SVGPathSegMovetoRel . prototype . _asPathString = function ( ) { return this . pathSegTypeAsLetter + " " + this . _x + " " + this . _y } , window . SVGPathSegMovetoRel . prototype . clone = function ( ) { return new window . SVGPathSegMovetoRel ( void 0 , this . _x , this . _y ) } , Object . defineProperty ( window . SVGPathSegMovetoRel . prototype , "x" , { get : function get ( ) { return this . _x } , set : function set ( Tn ) { this . _x = Tn , this . _segmentChanged ( ) } , enumerable : ! 0 } ) , Object . defineProperty ( window . SVGPathSegMovetoRel . prototype , "y" , { get : function get ( ) { return this . _y } , set : function set ( Tn ) { this . _y = Tn , this . _segmentChanged ( ) } , enumerable : ! 0 } ) , window . SVGPathSegLinetoAbs = function ( Tn , Un , Qn ) { window . SVGPathSeg . call ( this , window . SVGPathSeg . PATHSEG _LINETO _ABS , "L" , Tn ) , this . _x = Un , this . _y = Qn } , window . SV
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* A jQuery module to work with SVG attributes .
* @ module jQueryAttr
* @ license MIT
* /
2020-09-19 14:20:30 +00:00
function jQueryPluginSVG ( Tn ) { var Un = Tn . fn . attr ; return Tn . fn . attr = function ( Tn , Qn ) { var Dn = this . length ; if ( ! Dn ) return Un . call ( this , Tn , Qn ) ; for ( var Hn = 0 ; Hn < Dn ; ++ Hn ) { var Gn = this [ Hn ] ; if ( "http://www.w3.org/2000/svg" !== Gn . namespaceURI ) return Un . call ( this , Tn , Qn ) ; if ( void 0 !== Qn ) Gn . setAttribute ( Tn , Qn ) ; else if ( Array . isArray ( Tn ) ) { for ( var Vn = { } , zn = Tn . length ; zn -- ; ) { var Kn = Tn [ zn ] , Wn = Gn . getAttribute ( Kn ) ; ( Wn || "0" === Wn ) && ( Wn = isNaN ( Wn ) ? Wn : Wn - 0 ) , Vn [ Kn ] = Wn } return Vn } if ( "object" !== _typeof ( Tn ) ) { var Xn = Gn . getAttribute ( Tn ) ; return ( Xn || "0" === Xn ) && ( Xn = isNaN ( Xn ) ? Xn : Xn - 0 ) , Xn } for ( var Yn = 0 , Jn = Object . entries ( Tn ) ; Yn < Jn . length ; Yn ++ ) { var $n = _slicedToArray ( Jn [ Yn ] , 2 ) , Zn = $n [ 0 ] , er = $n [ 1 ] ; Gn . setAttribute ( Zn , er ) } } return this } , Tn } MA ( "toString" , DA , HA ) ; var GA = document . createElementNS ( qd . SVG , "svg" ) ; function transformToString ( Tn ) { var Un = Tn . matrix , Qn = "" ; switch ( Tn . type ) { case 1 : Qn = "matrix(" + [ Un . a , Un . b , Un . c , Un . d , Un . e , Un . f ] . join ( "," ) + ")" ; break ; case 2 : Qn = "translate(" + Un . e + "," + Un . f + ")" ; break ; case 3 : Qn = Un . a === Un . d ? "scale(" + Un . a + ")" : "scale(" + Un . a + "," + Un . d + ")" ; break ; case 4 : var Dn = 0 , Hn = 0 ; if ( 0 !== Tn . angle ) { var Gn = 1 - Un . a ; Hn = ( Gn * Un . f + Un . b * Un . e ) / ( Gn * Gn + Un . b * Un . b ) , Dn = ( Un . e - Un . b * Hn ) / Gn } Qn = "rotate(" + Tn . angle + " " + Dn + "," + Hn + ")" } return Qn } var VA , zA = { } , KA = function ( ) { function SVGTransformList ( Tn ) { _classCallCheck ( this , SVGTransformList ) , this . _elem = Tn || null , this . _xforms = [ ] , this . _update = function ( ) { for ( var Tn = "" , Un = 0 ; Un < this . numberOfItems ; ++ Un ) { Tn += transformToString ( this . _list . getItem ( Un ) ) + " " } this . _elem . setAttribute ( "transform" , Tn ) } , this . _list = this , this . _init = function ( ) { var Tn = this , Un = this . _elem . getAttribute ( "transform" ) ; if ( Un ) for ( var Qn = /\s*((scale|matrix|rotate|translate)\s*\(.*?\))\s*,?\s*/ , Dn = ! 0 ; Dn ; ) Dn = Un . match ( Qn ) , Un = Un . replace ( Qn , "" ) , Dn && Dn [ 1 ] && function ( ) { var Un = Dn [ 1 ] . split ( /\s*\(/ ) , Qn = Un [ 0 ] , Hn = Un [ 1 ] . match ( /\s*(.*?)\s*\)/ ) ; Hn [ 1 ] = Hn [ 1 ] . replace ( /(\d)-/g , "$1 -" ) ; var Gn = Hn [ 1 ] . split ( /[, ]+/ ) , Vn = "abcdef" . split ( "" ) , zn = GA . createSVGMatrix ( ) ; Object . values ( Gn ) . forEach ( ( function ( Tn , Un ) { Gn [ Un ] = Number . parseFloat ( Tn ) , "matrix" === Qn && ( zn [ Vn [ Un ] ] = Gn [ Un ] ) } ) ) ; var Kn = GA . createSVGTransform ( ) , Wn = "set" + Qn . charAt ( 0 ) . toUpperCase ( ) + Qn . slice ( 1 ) , Xn = "matrix" === Qn ? [ zn ] : Gn ; "scale" === Qn && 1 === Xn . length ? Xn . push ( Xn [ 0 ] ) : "translate" === Qn && 1 === Xn . length ? Xn . push ( 0 ) : "rotate" === Qn && 1 === Xn . length && Xn . push ( 0 , 0 ) , Kn [ Wn ] . apply ( Kn , _toConsumableArray ( Xn ) ) , Tn . _list . appendItem ( Kn ) } ( ) } , this . _removeFromOtherLists = function ( Tn ) { Tn && Object . values ( zA ) . some ( ( function ( Un ) { for ( var Qn = 0 , Dn = Un . _xforms . length ; Qn < Dn ; ++ Qn ) if ( Un . _xforms [ Qn ] === Tn ) return Un . removeItem ( Qn ) , ! 0 ; return ! 1 } ) ) } , this . numberOfItems = 0 } return _createClass ( SVGTransformList , [ { key : "clear" , value : function clear ( ) { this . numberOfItems = 0 , this . _xforms = [ ] } } , { key : "initialize" , value : function initialize ( Tn ) { this . numberOfItems = 1 , this . _removeFromOtherLists ( Tn ) , this . _xforms = [ Tn ] } } , { key : "getItem" , value : function getItem ( Tn ) { if ( Tn < this . numberOfItems && Tn >= 0 ) return this . _xforms [ Tn ] ; var Un = new Error ( "DOMException with code=INDEX_SIZE_ERR" ) ; throw Un . code = 1 , Un } } , { key : "insertItemBefore" , value : function insertItemBefore ( Tn , Un ) { var Qn = null ; if ( Un >= 0 ) if ( Un < this . numberOfItems ) { this . _removeFromOtherLists ( Tn ) ; var Dn , Hn = new Array ( this . numberOfItems + 1 ) ; for ( Dn = 0 ; Dn < Un ; ++ Dn ) Hn [ Dn ] = this . _xforms [ Dn ] ; Hn [ Dn ] = Tn ; for ( var Gn = Dn + 1 ; Dn < this . numberOfItems ; ++ Gn , ++ Dn ) Hn [ Gn ] = this . _xforms [ Dn ] ; this . numberOfItems ++ , this . _xforms = Hn , Qn = Tn , this . _list . _update ( ) } else Qn = this . _list . appendItem ( Tn ) ; return Qn } } , { key : "replaceItem" , value : function replaceItem ( Tn , Un ) { var Qn = null ; return Un < this . numberOfItems && Un >= 0 && ( this . _removeFromOtherLists ( Tn ) , this . _xforms [ Un ] = Tn , Qn = Tn , this . _list . _update ( ) ) , Qn } } , { key : "removeItem" , value : function removeItem ( Tn ) { if ( Tn < this . numberOfItems && Tn >= 0 ) { var Un , Qn = this . _xforms [ Tn ] , Dn = new Array ( this . numberOfItems - 1 ) ; for ( Un = 0 ; Un < Tn ; ++ Un ) Dn [ Un ] = this . _xforms [ Un ] ; for ( var Hn = Un ; Hn < this . numberOfItems - 1 ; ++ Hn , ++ Un ) Dn [ Hn ] = this . _xforms [ Un + 1 ] ; return this . numberOfItems -- , this . _xforms = Dn , this . _list . _update ( ) , Qn } var Gn = new Error ( "DOMException with code=INDEX_SIZE_ERR" ) ; throw Gn . code = 1 , Gn } } , { key : "appendItem" , value : function appendItem ( Tn ) { return this . _removeFromOtherLists ( Tn ) , this . _xforms . push ( Tn ) , this . numberOfItems ++ , this . _list . _update ( ) , Tn } } ] )
2020-09-04 20:34:30 +00:00
/ * * @ l i c e n s e
2020-09-08 23:35:47 +00:00
*
* jsPDF - PDF Document creation from JavaScript
2020-09-09 22:54:17 +00:00
* Version 2.1 . 1 Built on 2020 - 09 - 07 T12 : 58 : 19.950 Z
2020-09-08 23:35:47 +00:00
* CommitID 00000000
*
* Copyright ( c ) 2010 - 2020 James Hall < james @ parall . ax > , https : //github.com/MrRio/jsPDF
* 2015 - 2020 yWorks GmbH , http : //www.yworks.com
* 2015 - 2020 Lukas Holländer < lukas . hollaender @ yworks . com > , https : //github.com/HackbrettXXX
* 2016 - 2018 Aras Abbasi < aras . abbasi @ gmail . com >
* 2010 Aaron Spike , https : //github.com/acspike
* 2012 Willow Systems Corporation , willow - systems . com
* 2012 Pablo Hess , https : //github.com/pablohess
* 2012 Florian Jenett , https : //github.com/fjenett
* 2013 Warren Weckesser , https : //github.com/warrenweckesser
* 2013 Youssef Beddad , https : //github.com/lifof
* 2013 Lee Driscoll , https : //github.com/lsdriscoll
* 2013 Stefan Slonevskiy , https : //github.com/stefslon
* 2013 Jeremy Morel , https : //github.com/jmorel
* 2013 Christoph Hartmann , https : //github.com/chris-rock
* 2014 Juan Pablo Gaviria , https : //github.com/juanpgaviria
* 2014 James Makes , https : //github.com/dollaruw
* 2014 Diego Casorran , https : //github.com/diegocr
* 2014 Steven Spungin , https : //github.com/Flamenco
* 2014 Kenneth Glassey , https : //github.com/Gavvers
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
*
* Contributor ( s ) :
* siefkenj , ahwolf , rickygu , Midnith , saintclair , eaparango ,
* kim3er , mfo , alnorth , Flamenco
* /
2020-09-18 20:43:34 +00:00
var gg = function ( ) { return "undefined" != typeof window ? window : void 0 !== sg ? sg : "undefined" != typeof self ? self : this } ( ) ; function e ( ) { gg . console && "function" == typeof gg . console . log && gg . console . log . apply ( gg . console , arguments ) } var mg = { log : e , warn : function warn ( Tn ) { gg . console && ( "function" == typeof gg . console . warn ? gg . console . warn . apply ( gg . console , arguments ) : e . call ( null , arguments ) ) } , error : function error ( Tn ) { gg . console && ( "function" == typeof gg . console . error ? gg . console . error . apply ( gg . console , arguments ) : e ( Tn ) ) } } ;
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* FileSaver . js
* A saveAs ( ) FileSaver implementation .
*
* By Eli Grey , http : //eligrey.com
*
* License : https : //github.com/eligrey/FileSaver.js/blob/master/LICENSE.md (MIT)
* source : http : //purl.eligrey.com/github/FileSaver.js
2020-09-19 14:20:30 +00:00
* /function r(Tn,Un,Qn){var Dn=new XMLHttpRequest;Dn.open("GET",Tn),Dn.responseType="blob",Dn.onload=function(){yg(Dn.response,Un,Qn)},Dn.onerror=function(){mg.error("could not download file")},Dn.send()}function i(Tn){var Un=new XMLHttpRequest;Un.open("HEAD",Tn,!1);try{Un.send()}catch(Tn){}return Un.status>=200&&Un.status<=299}function a(Tn){try{Tn.dispatchEvent(new MouseEvent("click"))}catch(Qn){var Un=document.createEvent("MouseEvents");Un.initMouseEvent("click",!0,!0,window,0,0,0,80,20,!1,!1,!1,!1,0,null),Tn.dispatchEvent(Un)}}var _g,vg,yg=gg.saveAs||("object"!=("undefined"==typeof window?"undefined":_typeof(window))||window!==gg?function(){}:"download"in HTMLAnchorElement.prototype?function(Tn,Un,Qn){var Dn=gg.URL||gg.webkitURL,Hn=document.createElement("a");Un=Un||Tn.name||"download",Hn.download=Un,Hn.rel="noopener","string"==typeof Tn?(Hn.href=Tn,Hn.origin!==location.origin?i(Hn.href)?r(Tn,Un,Qn):a(Hn,Hn.target="_blank"):a(Hn)):(Hn.href=Dn.createObjectURL(Tn),setTimeout((function(){Dn.revokeObjectURL(Hn.href)}),4e4),setTimeout((function(){a(Hn)}),0))}:"msSaveOrOpenBlob"in navigator?function(Tn,Un,Qn){if(Un=Un||Tn.name||"download","string"==typeof Tn)if(i(Tn))r(Tn,Un,Qn);else{var Dn=document.createElement("a");Dn.href=Tn,Dn.target="_blank",setTimeout((function(){a(Dn)}))}else navigator.msSaveOrOpenBlob(function(Tn,Un){return void 0===Un?Un={autoBom:!1}:"object"!=_typeof(Un)&&(mg.warn("Deprecated: Expected third argument to be a object"),Un={autoBom:!Un}),Un.autoBom&&/ ^ \ s * ( ? : text \ / \ S * | application \ / xml | \ S * \ / \ S * \ + xml ) \ s * ; . * charset \ s *= \ s * utf - 8 / i . test ( Tn . type ) ? new Blob ( [ String . fromCharCode ( 65279 ) , Tn ] , { type : Tn . type } ) : Tn } ( Tn , Qn ) , Un ) } : function ( Tn , Un , Qn , Dn ) { if ( ( Dn = Dn || open ( "" , "_blank" ) ) && ( Dn . document . title = Dn . document . body . innerText = "downloading..." ) , "string" == typeof Tn ) return r ( Tn , Un , Qn ) ; var Hn = "application/octet-stream" === Tn . type , Gn = /constructor/i . test ( gg . HTMLElement ) || gg . safari , Vn = /CriOS\/[\d]+/ . test ( navigator . userAgent ) ; if ( ( Vn || Hn && Gn ) && "object" == ( "undefined" == typeof FileReader ? "undefined" : _typeof ( FileReader ) ) ) { var zn = new FileReader ; zn . onloadend = function ( ) { var Tn = zn . result ; Tn = Vn ? Tn : Tn . replace ( /^data:[^;]*;/ , "data:attachment/file;" ) , Dn ? Dn . location . href = Tn : location = Tn , Dn = null } , zn . readAsDataURL ( Tn ) } else { var Kn = gg . URL || gg . webkitURL , Wn = Kn . createObjectURL ( Tn ) ; Dn ? Dn . location = Wn : location . href = Wn , Dn = null , setTimeout ( ( function ( ) { Kn . revokeObjectURL ( Wn ) } ) , 4e4 ) } } ) ;
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* A class to parse color values
* @ author Stoyan Stefanov < sstoo @ gmail . com >
* { @ link http : //www.phpied.com/rgb-color-parser-in-javascript/}
* @ license Use it if you like it
2020-09-19 14:20:30 +00:00
* /function c(Tn){var Un;Tn=Tn||"",this.ok=!1,"#"==Tn.charAt(0)&&(Tn=Tn.substr(1,6)),Tn={aliceblue:"f0f8ff",antiquewhite:"faebd7",aqua:"00ffff",aquamarine:"7fffd4",azure:"f0ffff",beige:"f5f5dc",bisque:"ffe4c4",black:"000000",blanchedalmond:"ffebcd",blue:"0000ff",blueviolet:"8a2be2",brown:"a52a2a",burlywood:"deb887",cadetblue:"5f9ea0",chartreuse:"7fff00",chocolate:"d2691e",coral:"ff7f50",cornflowerblue:"6495ed",cornsilk:"fff8dc",crimson:"dc143c",cyan:"00ffff",darkblue:"00008b",darkcyan:"008b8b",darkgoldenrod:"b8860b",darkgray:"a9a9a9",darkgreen:"006400",darkkhaki:"bdb76b",darkmagenta:"8b008b",darkolivegreen:"556b2f",darkorange:"ff8c00",darkorchid:"9932cc",darkred:"8b0000",darksalmon:"e9967a",darkseagreen:"8fbc8f",darkslateblue:"483d8b",darkslategray:"2f4f4f",darkturquoise:"00ced1",darkviolet:"9400d3",deeppink:"ff1493",deepskyblue:"00bfff",dimgray:"696969",dodgerblue:"1e90ff",feldspar:"d19275",firebrick:"b22222",floralwhite:"fffaf0",forestgreen:"228b22",fuchsia:"ff00ff",gainsboro:"dcdcdc",ghostwhite:"f8f8ff",gold:"ffd700",goldenrod:"daa520",gray:"808080",green:"008000",greenyellow:"adff2f",honeydew:"f0fff0",hotpink:"ff69b4",indianred:"cd5c5c",indigo:"4b0082",ivory:"fffff0",khaki:"f0e68c",lavender:"e6e6fa",lavenderblush:"fff0f5",lawngreen:"7cfc00",lemonchiffon:"fffacd",lightblue:"add8e6",lightcoral:"f08080",lightcyan:"e0ffff",lightgoldenrodyellow:"fafad2",lightgrey:"d3d3d3",lightgreen:"90ee90",lightpink:"ffb6c1",lightsalmon:"ffa07a",lightseagreen:"20b2aa",lightskyblue:"87cefa",lightslateblue:"8470ff",lightslategray:"778899",lightsteelblue:"b0c4de",lightyellow:"ffffe0",lime:"00ff00",limegreen:"32cd32",linen:"faf0e6",magenta:"ff00ff",maroon:"800000",mediumaquamarine:"66cdaa",mediumblue:"0000cd",mediumorchid:"ba55d3",mediumpurple:"9370d8",mediumseagreen:"3cb371",mediumslateblue:"7b68ee",mediumspringgreen:"00fa9a",mediumturquoise:"48d1cc",mediumvioletred:"c71585",midnightblue:"191970",mintcream:"f5fffa",mistyrose:"ffe4e1",moccasin:"ffe4b5",navajowhite:"ffdead",navy:"000080",oldlace:"fdf5e6",olive:"808000",olivedrab:"6b8e23",orange:"ffa500",orangered:"ff4500",orchid:"da70d6",palegoldenrod:"eee8aa",palegreen:"98fb98",paleturquoise:"afeeee",palevioletred:"d87093",papayawhip:"ffefd5",peachpuff:"ffdab9",peru:"cd853f",pink:"ffc0cb",plum:"dda0dd",powderblue:"b0e0e6",purple:"800080",red:"ff0000",rosybrown:"bc8f8f",royalblue:"4169e1",saddlebrown:"8b4513",salmon:"fa8072",sandybrown:"f4a460",seagreen:"2e8b57",seashell:"fff5ee",sienna:"a0522d",silver:"c0c0c0",skyblue:"87ceeb",slateblue:"6a5acd",slategray:"708090",snow:"fffafa",springgreen:"00ff7f",steelblue:"4682b4",tan:"d2b48c",teal:"008080",thistle:"d8bfd8",tomato:"ff6347",turquoise:"40e0d0",violet:"ee82ee",violetred:"d02090",wheat:"f5deb3",white:"ffffff",whitesmoke:"f5f5f5",yellow:"ffff00",yellowgreen:"9acd32"}[Tn=(Tn=Tn.replace(/ /g,"")).toLowerCase()]||Tn;for(var Qn=[{re:/^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/,example:["rgb(123, 234, 45)","rgb(255,234,245)"],process:function process(Tn){return[parseInt(Tn[1]),parseInt(Tn[2]),parseInt(Tn[3])]}},{re:/ ^ ( \ w { 2 } ) ( \ w { 2 } ) ( \ w { 2 } ) $ / , example : [ "#00ff00" , "336699" ] , process : function process ( Tn ) { return [ parseInt ( Tn [ 1 ] , 16 ) , parseInt ( Tn [ 2 ] , 16 ) , parseInt ( Tn [ 3 ] , 16 ) ] } } , { re : /^(\w{1})(\w{1})(\w{1})$/ , example : [ "#fb0" , "f0f" ] , process : function process ( Tn ) { return [ parseInt ( Tn [ 1 ] + Tn [ 1 ] , 16 ) , parseInt ( Tn [ 2 ] + Tn [ 2 ] , 16 ) , parseInt ( Tn [ 3 ] + Tn [ 3 ] , 16 ) ] } } ] , Dn = 0 ; Dn < Qn . length ; Dn ++ ) { var Hn = Qn [ Dn ] . re , Gn = Qn [ Dn ] . process , Vn = Hn . exec ( Tn ) ; Vn && ( Un = Gn ( Vn ) , this . r = Un [ 0 ] , this . g = Un [ 1 ] , this . b = Un [ 2 ] , this . ok = ! 0 ) } this . r = this . r < 0 || isNaN ( this . r ) ? 0 : this . r > 255 ? 255 : this . r , this . g = this . g < 0 || isNaN ( this . g ) ? 0 : this . g > 255 ? 255 : this . g , this . b = this . b < 0 || isNaN ( this . b ) ? 0 : this . b > 255 ? 255 : this . b , this . toRGB = function ( ) { return "rgb(" + this . r + ", " + this . g + ", " + this . b + ")" } , this . toHex = function ( ) { var Tn = this . r . toString ( 16 ) , Un = this . g . toString ( 16 ) , Qn = this . b . toString ( 16 ) ; return 1 == Tn . length && ( Tn = "0" + Tn ) , 1 == Un . length && ( Un = "0" + Un ) , 1 == Qn . length && ( Qn = "0" + Qn ) , "#" + Tn + Un + Qn } } function h ( Tn ) { if ( "object" != _typeof ( Tn ) ) throw new Error ( "Invalid Context passed to initialize PubSub (jsPDF-module)" ) ; var Un = { } ; this . subscribe = function ( Tn , Qn
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2014 Steven Spungin ( TwelveTone LLC ) steven @ twelvetone . tv
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un = function e ( Tn ) { if ( void 0 !== Tn && "" != Tn ) return ! 0 } ; g . API . events . push ( [ "addPage" , function ( Tn ) { this . internal . getPageInfo ( Tn . pageNumber ) . pageContext . annotations = [ ] } ] ) , Tn . events . push ( [ "putPage" , function ( Tn ) { for ( var Qn , Dn , Hn , Gn = this . internal . getCoordinateString , Vn = this . internal . getVerticalCoordinateString , zn = this . internal . getPageInfoByObjId ( Tn . objId ) , Kn = Tn . pageContext . annotations , Wn = ! 1 , Xn = 0 ; Xn < Kn . length && ! Wn ; Xn ++ ) switch ( ( Qn = Kn [ Xn ] ) . type ) { case "link" : ( Un ( Qn . options . url ) || Un ( Qn . options . pageNumber ) ) && ( Wn = ! 0 ) ; break ; case "reference" : case "text" : case "freetext" : Wn = ! 0 } if ( 0 != Wn ) { this . internal . write ( "/Annots [" ) ; for ( var Yn = 0 ; Yn < Kn . length ; Yn ++ ) switch ( ( Qn = Kn [ Yn ] ) . type ) { case "reference" : this . internal . write ( " " + Qn . object . objId + " 0 R " ) ; break ; case "text" : var Jn = this . internal . newAdditionalObject ( ) , $n = this . internal . newAdditionalObject ( ) , Zn = Qn . title || "Note" ; Hn = "<</Type /Annot /Subtype /Text " + ( Dn = "/Rect [" + Gn ( Qn . bounds . x ) + " " + Vn ( Qn . bounds . y + Qn . bounds . h ) + " " + Gn ( Qn . bounds . x + Qn . bounds . w ) + " " + Vn ( Qn . bounds . y ) + "] " ) + "/Contents (" + Qn . contents + ")" , Hn += " /Popup " + $n . objId + " 0 R" , Hn += " /P " + zn . objId + " 0 R" , Hn += " /T (" + Zn + ") >>" , Jn . content = Hn ; var er = Jn . objId + " 0 R" ; Hn = "<</Type /Annot /Subtype /Popup " + ( Dn = "/Rect [" + Gn ( Qn . bounds . x + 30 ) + " " + Vn ( Qn . bounds . y + Qn . bounds . h ) + " " + Gn ( Qn . bounds . x + Qn . bounds . w + 30 ) + " " + Vn ( Qn . bounds . y ) + "] " ) + " /Parent " + er , Qn . open && ( Hn += " /Open true" ) , Hn += " >>" , $n . content = Hn , this . internal . write ( Jn . objId , "0 R" , $n . objId , "0 R" ) ; break ; case "freetext" : Dn = "/Rect [" + Gn ( Qn . bounds . x ) + " " + Vn ( Qn . bounds . y ) + " " + Gn ( Qn . bounds . x + Qn . bounds . w ) + " " + Vn ( Qn . bounds . y + Qn . bounds . h ) + "] " ; var tr = Qn . color || "#000000" ; Hn = "<</Type /Annot /Subtype /FreeText " + Dn + "/Contents (" + Qn . contents + ")" , Hn += " /DS(font: Helvetica,sans-serif 12.0pt; text-align:left; color:#" + tr + ")" , Hn += " /Border [0 0 0]" , Hn += " >>" , this . internal . write ( Hn ) ; break ; case "link" : if ( Qn . options . name ) { var nr = this . annotations . _nameMap [ Qn . options . name ] ; Qn . options . pageNumber = nr . page , Qn . options . top = nr . y } else Qn . options . top || ( Qn . options . top = 0 ) ; if ( Dn = "/Rect [" + Gn ( Qn . x ) + " " + Vn ( Qn . y ) + " " + Gn ( Qn . x + Qn . w ) + " " + Vn ( Qn . y + Qn . h ) + "] " , Hn = "" , Qn . options . url ) Hn = "<</Type /Annot /Subtype /Link " + Dn + "/Border [0 0 0] /A <</S /URI /URI (" + Qn . options . url + ") >>" ; else if ( Qn . options . pageNumber ) switch ( Hn = "<</Type /Annot /Subtype /Link " + Dn + "/Border [0 0 0] /Dest [" + this . internal . getPageInfo ( Qn . options . pageNumber ) . objId + " 0 R" , Qn . options . magFactor = Qn . options . magFactor || "XYZ" , Qn . options . magFactor ) { case "Fit" : Hn += " /Fit]" ; break ; case "FitH" : Hn += " /FitH " + Qn . options . top + "]" ; break ; case "FitV" : Qn . options . left = Qn . options . left || 0 , Hn += " /FitV " + Qn . options . left + "]" ; break ; case "XYZ" : default : var rr = Vn ( Qn . options . top ) ; Qn . options . left = Qn . options . left || 0 , void 0 === Qn . options . zoom && ( Qn . options . zoom = 0 ) , Hn += " /XYZ " + Qn . options . left + " " + rr + " " + Qn . options . zoom + "]" } "" != Hn && ( Hn += " >>" , this . internal . write ( Hn ) ) } this . internal . write ( "]" ) } } ] ) , Tn . createAnnotation = function ( Tn ) { var Un = this . internal . getCurrentPageInfo ( ) ; switch ( Tn . type ) { case "link" : this . link ( Tn . bounds . x , Tn . bounds . y , Tn . bounds . w , Tn . bounds . h , Tn ) ; break ; case "text" : case "freetext" : Un . pageContext . annotations . push ( Tn ) } } , Tn . link = function ( Tn , Un , Qn , Dn , Hn ) { this . internal . getCurrentPageInfo ( ) . pageContext . annotations . push ( { x : Tn , y : Un , w : Qn , h : Dn , options : Hn , type : "link" } ) } , Tn . textWithLink = function ( Tn , Un , Qn , Dn ) { var Hn = this . getTextWidth ( Tn ) , Gn = this . internal . getLineHeight ( ) / this . internal . scaleFactor ; return this . text ( Tn , Un , Qn , Dn ) , Qn += . 2 * Gn , this . link ( Un , Qn - Gn , Hn , Gn , Dn ) , Hn } , Tn . getTextWidth = function ( Tn ) { var Un = this . internal . getFontSize ( ) ; return this . getStringUnitWidth ( Tn ) * Un / this . internal . scaleFactor } } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2017 Aras Abbasi
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un = { 1569 : [ 65152 ] , 1570 : [ 65153 , 65154 ] , 1571 : [ 65155 , 65156 ] , 1572 : [ 65157 , 65158 ] , 1573 : [ 65159 , 65160 ] , 1574 : [ 65161 , 65162 , 65163 , 65164 ] , 1575 : [ 65165 , 65166 ] , 1576 : [ 65167 , 65168 , 65169 , 65170 ] , 1577 : [ 65171 , 65172 ] , 1578 : [ 65173 , 65174 , 65175 , 65176 ] , 1579 : [ 65177 , 65178 , 65179 , 65180 ] , 1580 : [ 65181 , 65182 , 65183 , 65184 ] , 1581 : [ 65185 , 65186 , 65187 , 65188 ] , 1582 : [ 65189 , 65190 , 65191 , 65192 ] , 1583 : [ 65193 , 65194 ] , 1584 : [ 65195 , 65196 ] , 1585 : [ 65197 , 65198 ] , 1586 : [ 65199 , 65200 ] , 1587 : [ 65201 , 65202 , 65203 , 65204 ] , 1588 : [ 65205 , 65206 , 65207 , 65208 ] , 1589 : [ 65209 , 65210 , 65211 , 65212 ] , 1590 : [ 65213 , 65214 , 65215 , 65216 ] , 1591 : [ 65217 , 65218 , 65219 , 65220 ] , 1592 : [ 65221 , 65222 , 65223 , 65224 ] , 1593 : [ 65225 , 65226 , 65227 , 65228 ] , 1594 : [ 65229 , 65230 , 65231 , 65232 ] , 1601 : [ 65233 , 65234 , 65235 , 65236 ] , 1602 : [ 65237 , 65238 , 65239 , 65240 ] , 1603 : [ 65241 , 65242 , 65243 , 65244 ] , 1604 : [ 65245 , 65246 , 65247 , 65248 ] , 1605 : [ 65249 , 65250 , 65251 , 65252 ] , 1606 : [ 65253 , 65254 , 65255 , 65256 ] , 1607 : [ 65257 , 65258 , 65259 , 65260 ] , 1608 : [ 65261 , 65262 ] , 1609 : [ 65263 , 65264 , 64488 , 64489 ] , 1610 : [ 65265 , 65266 , 65267 , 65268 ] , 1649 : [ 64336 , 64337 ] , 1655 : [ 64477 ] , 1657 : [ 64358 , 64359 , 64360 , 64361 ] , 1658 : [ 64350 , 64351 , 64352 , 64353 ] , 1659 : [ 64338 , 64339 , 64340 , 64341 ] , 1662 : [ 64342 , 64343 , 64344 , 64345 ] , 1663 : [ 64354 , 64355 , 64356 , 64357 ] , 1664 : [ 64346 , 64347 , 64348 , 64349 ] , 1667 : [ 64374 , 64375 , 64376 , 64377 ] , 1668 : [ 64370 , 64371 , 64372 , 64373 ] , 1670 : [ 64378 , 64379 , 64380 , 64381 ] , 1671 : [ 64382 , 64383 , 64384 , 64385 ] , 1672 : [ 64392 , 64393 ] , 1676 : [ 64388 , 64389 ] , 1677 : [ 64386 , 64387 ] , 1678 : [ 64390 , 64391 ] , 1681 : [ 64396 , 64397 ] , 1688 : [ 64394 , 64395 ] , 1700 : [ 64362 , 64363 , 64364 , 64365 ] , 1702 : [ 64366 , 64367 , 64368 , 64369 ] , 1705 : [ 64398 , 64399 , 64400 , 64401 ] , 1709 : [ 64467 , 64468 , 64469 , 64470 ] , 1711 : [ 64402 , 64403 , 64404 , 64405 ] , 1713 : [ 64410 , 64411 , 64412 , 64413 ] , 1715 : [ 64406 , 64407 , 64408 , 64409 ] , 1722 : [ 64414 , 64415 ] , 1723 : [ 64416 , 64417 , 64418 , 64419 ] , 1726 : [ 64426 , 64427 , 64428 , 64429 ] , 1728 : [ 64420 , 64421 ] , 1729 : [ 64422 , 64423 , 64424 , 64425 ] , 1733 : [ 64480 , 64481 ] , 1734 : [ 64473 , 64474 ] , 1735 : [ 64471 , 64472 ] , 1736 : [ 64475 , 64476 ] , 1737 : [ 64482 , 64483 ] , 1739 : [ 64478 , 64479 ] , 1740 : [ 64508 , 64509 , 64510 , 64511 ] , 1744 : [ 64484 , 64485 , 64486 , 64487 ] , 1746 : [ 64430 , 64431 ] , 1747 : [ 64432 , 64433 ] } , Qn = { 65247 : { 65154 : 65269 , 65156 : 65271 , 65160 : 65273 , 65166 : 65275 } , 65248 : { 65154 : 65270 , 65156 : 65272 , 65160 : 65274 , 65166 : 65276 } , 65165 : { 65247 : { 65248 : { 65258 : 65010 } } } , 1617 : { 1612 : 64606 , 1613 : 64607 , 1614 : 64608 , 1615 : 64609 , 1616 : 64610 } } , Dn = { 1612 : 64606 , 1613 : 64607 , 1614 : 64608 , 1615 : 64609 , 1616 : 64610 } , Hn = [ 1570 , 1571 , 1573 , 1575 ] ; Tn . _ _arabicParser _ _ = { } ; var Gn = Tn . _ _arabicParser _ _ . isInArabicSubstitutionA = function ( Tn ) { return void 0 !== Un [ Tn . charCodeAt ( 0 ) ] } , Vn = Tn . _ _arabicParser _ _ . isArabicLetter = function ( Tn ) { return "string" == typeof Tn && /^[\u0600-\u06FF\u0750-\u077F\u08A0-\u08FF\uFB50-\uFDFF\uFE70-\uFEFF]+$/ . test ( Tn ) } , zn = Tn . _ _arabicParser _ _ . isArabicEndLetter = function ( Tn ) { return Vn ( Tn ) && Gn ( Tn ) && Un [ Tn . charCodeAt ( 0 ) ] . length <= 2 } , Kn = Tn . _ _arabicParser _ _ . isArabicAlfLetter = function ( Tn ) { return Vn ( Tn ) && Hn . indexOf ( Tn . charCodeAt ( 0 ) ) >= 0 } ; Tn . _ _arabicParser _ _ . arabicLetterHasIsolatedForm = function ( Tn ) { return Vn ( Tn ) && Gn ( Tn ) && Un [ Tn . charCodeAt ( 0 ) ] . length >= 1 } ; var Wn = Tn . _ _arabicParser _ _ . arabicLetterHasFinalForm = function ( Tn ) { return Vn ( Tn ) && Gn ( Tn ) && Un [ Tn . charCodeAt ( 0 ) ] . length >= 2 } ; Tn . _ _arabicParser _ _ . arabicLetterHasInitialForm = function ( Tn ) { return Vn ( Tn ) && Gn ( Tn ) && Un [ Tn . charCodeAt ( 0 ) ] . length >= 3 } ; var Xn = Tn . _ _arabicParser _ _ . arabicLetterHasMedialForm = function ( Tn ) { return Vn ( Tn ) && Gn ( Tn ) && 4 == Un [ Tn . charCodeAt ( 0 ) ] . length } , Yn = Tn . _ _arabicParser _ _ . resolveLigatures = function ( Tn ) { var Un = 0 , Dn = Qn , Hn = "" , Gn = 0 ; for ( Un = 0 ; Un < Tn . length ; Un += 1 ) void 0 !== Dn [ Tn . charCodeAt ( Un ) ] ? ( Gn ++ , "number" == typeof ( Dn = Dn [ Tn . charCodeAt ( Un ) ] ) && ( Hn += String . fromCharCode ( Dn ) , Dn = Qn , Gn = 0 ) , Un === Tn . length - 1 && ( Dn = Qn , Hn += Tn . charAt ( Un - ( Gn - 1 ) ) , Un -= Gn - 1 , Gn = 0 ) ) : ( Dn = Qn , Hn += Tn . charAt ( Un - Gn ) , Un -= Gn , Gn = 0 ) ; return Hn } ; Tn . _ _arabicParser _ _ . isArabicDiacritic = function ( Tn ) { return void 0 !== Tn && void 0 !== Dn [ Tn . charCodeAt ( 0 ) ] } ; var Jn = Tn . _ _arabicParser _ _ . getCorrectForm = function ( Tn , Un , Qn ) { return Vn ( Tn ) ? ! 1 === Gn ( Tn ) ? - 1 : ! Wn ( Tn ) || ! Vn ( Un ) && ! Vn ( Qn ) || ! Vn ( Qn ) && zn ( Un ) || zn ( Tn ) && ! Vn ( Un ) || zn ( Tn ) && Kn ( Un ) || zn ( Tn ) && zn ( Un ) ? 0 : Xn ( Tn ) && Vn ( Un ) && ! zn ( Un ) && Vn ( Qn ) && Wn ( Qn ) ? 3 : zn ( Tn ) || ! Vn ( Qn ) ? 1 : 2 : - 1 } , $n = function d ( Tn ) { var Qn = 0 , Dn = 0 , Hn = 0 , Gn = "" , zn = "" , Kn = "" , Wn = ( Tn = Tn || "" ) . split ( "\\s+" ) , Xn = [ ] ; for ( Qn = 0 ; Qn < Wn . length ; Qn += 1 ) { fo
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2014 Steven Spungin ( TwelveTone LLC ) steven @ twelvetone . tv
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-18 20:43:34 +00:00
function ( Tn ) { var Un = function e ( ) { var Tn = void 0 ; Object . defineProperty ( this , "pdf" , { get : function get ( ) { return Tn } , set : function set ( Un ) { Tn = Un } } ) ; var e = 150 ; Object . defineProperty ( this , "width" , { get : function get ( ) { return e } , set : function set ( Tn ) { e = isNaN ( Tn ) || ! 1 === Number . isInteger ( Tn ) || Tn < 0 ? 150 : Tn , this . getContext ( "2d" ) . pageWrapXEnabled && ( this . getContext ( "2d" ) . pageWrapX = e + 1 ) } } ) ; var Un = 300 ; Object . defineProperty ( this , "height" , { get : function get ( ) { return Un } , set : function set ( Tn ) { Un = isNaN ( Tn ) || ! 1 === Number . isInteger ( Tn ) || Tn < 0 ? 300 : Tn , this . getContext ( "2d" ) . pageWrapYEnabled && ( this . getContext ( "2d" ) . pageWrapY = Un + 1 ) } } ) ; var Qn = [ ] ; Object . defineProperty ( this , "childNodes" , { get : function get ( ) { return Qn } , set : function set ( Tn ) { Qn = Tn } } ) ; var Dn = { } ; Object . defineProperty ( this , "style" , { get : function get ( ) { return Dn } , set : function set ( Tn ) { Dn = Tn } } ) , Object . defineProperty ( this , "parentNode" , { } ) } ; Un . prototype . getContext = function ( Tn , Un ) { var Qn ; if ( "2d" !== ( Tn = Tn || "2d" ) ) return null ; for ( Qn in Un ) this . pdf . context2d . hasOwnProperty ( Qn ) && ( this . pdf . context2d [ Qn ] = Un [ Qn ] ) ; return this . pdf . context2d . _canvas = this , this . pdf . context2d } , Un . prototype . toDataURL = function ( ) { throw new Error ( "toDataURL is not implemented." ) } , Tn . events . push ( [ "initialized" , function ( ) { this . canvas = new Un , this . canvas . pdf = this } ] ) } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* === === === === === === === === === === === === === === === === === === === === === === ==
* Copyright ( c ) 2013 Youssef Beddad , youssef . beddad @ gmail . com
* 2013 Eduardo Menezes de Morais , eduardo . morais @ usp . br
* 2013 Lee Driscoll , https : //github.com/lsdriscoll
* 2014 Juan Pablo Gaviria , https : //github.com/juanpgaviria
* 2014 James Hall , james @ parall . ax
* 2014 Diego Casorran , https : //github.com/diegocr
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un = { left : 0 , top : 0 , bottom : 0 , right : 0 } , Qn = ! 1 , Dn = function r ( ) { void 0 === this . internal . _ _cell _ _ && ( this . internal . _ _cell _ _ = { } , this . internal . _ _cell _ _ . padding = 3 , this . internal . _ _cell _ _ . headerFunction = void 0 , this . internal . _ _cell _ _ . margins = Object . assign ( { } , Un ) , this . internal . _ _cell _ _ . margins . width = this . getPageWidth ( ) , Hn . call ( this ) ) } , Hn = function i ( ) { this . internal . _ _cell _ _ . lastCell = new Gn , this . internal . _ _cell _ _ . pages = 1 } , Gn = function a ( ) { var Tn = arguments [ 0 ] ; Object . defineProperty ( this , "x" , { enumerable : ! 0 , get : function get ( ) { return Tn } , set : function set ( Un ) { Tn = Un } } ) ; var Un = arguments [ 1 ] ; Object . defineProperty ( this , "y" , { enumerable : ! 0 , get : function get ( ) { return Un } , set : function set ( Tn ) { Un = Tn } } ) ; var Qn = arguments [ 2 ] ; Object . defineProperty ( this , "width" , { enumerable : ! 0 , get : function get ( ) { return Qn } , set : function set ( Tn ) { Qn = Tn } } ) ; var Dn = arguments [ 3 ] ; Object . defineProperty ( this , "height" , { enumerable : ! 0 , get : function get ( ) { return Dn } , set : function set ( Tn ) { Dn = Tn } } ) ; var Hn = arguments [ 4 ] ; Object . defineProperty ( this , "text" , { enumerable : ! 0 , get : function get ( ) { return Hn } , set : function set ( Tn ) { Hn = Tn } } ) ; var a = arguments [ 5 ] ; Object . defineProperty ( this , "lineNumber" , { enumerable : ! 0 , get : function get ( ) { return a } , set : function set ( Tn ) { a = Tn } } ) ; var Gn = arguments [ 6 ] ; return Object . defineProperty ( this , "align" , { enumerable : ! 0 , get : function get ( ) { return Gn } , set : function set ( Tn ) { Gn = Tn } } ) , this } ; Gn . prototype . clone = function ( ) { return new Gn ( this . x , this . y , this . width , this . height , this . text , this . lineNumber , this . align ) } , Gn . prototype . toArray = function ( ) { return [ this . x , this . y , this . width , this . height , this . text , this . lineNumber , this . align ] } , Tn . setHeaderFunction = function ( Tn ) { return Dn . call ( this ) , this . internal . _ _cell _ _ . headerFunction = "function" == typeof Tn ? Tn : void 0 , this } , Tn . getTextDimensions = function ( Tn , Un ) { Dn . call ( this ) ; var Qn = ( Un = Un || { } ) . fontSize || this . getFontSize ( ) , Hn = Un . font || this . getFont ( ) , Gn = Un . scaleFactor || this . internal . scaleFactor , Vn = 0 , zn = 0 , Kn = 0 ; if ( ! Array . isArray ( Tn ) && "string" != typeof Tn ) { if ( "number" != typeof Tn ) throw new Error ( "getTextDimensions expects text-parameter to be of type String or type Number or an Array of Strings." ) ; Tn = String ( Tn ) } var Wn = Un . maxWidth ; Wn > 0 ? "string" == typeof Tn ? Tn = this . splitTextToSize ( Tn , Wn ) : "[object Array]" === Object . prototype . toString . call ( Tn ) && ( Tn = this . splitTextToSize ( Tn . join ( " " ) , Wn ) ) : Tn = Array . isArray ( Tn ) ? Tn : [ Tn ] ; for ( var Xn = 0 ; Xn < Tn . length ; Xn ++ ) Vn < ( Kn = this . getStringUnitWidth ( Tn [ Xn ] , { font : Hn } ) * Qn ) && ( Vn = Kn ) ; return 0 !== Vn && ( zn = Tn . length ) , { w : Vn /= Gn , h : Math . max ( ( zn * Qn * this . getLineHeightFactor ( ) - Qn * ( this . getLineHeightFactor ( ) - 1 ) ) / Gn , 0 ) } } , Tn . cellAddPage = function ( ) { Dn . call ( this ) , this . addPage ( ) ; var Tn = this . internal . _ _cell _ _ . margins || Un ; return this . internal . _ _cell _ _ . lastCell = new Gn ( Tn . left , Tn . top , void 0 , void 0 ) , this . internal . _ _cell _ _ . pages += 1 , this } ; var Vn = Tn . cell = function ( ) { var Tn ; Tn = arguments [ 0 ] instanceof Gn ? arguments [ 0 ] : new Gn ( arguments [ 0 ] , arguments [ 1 ] , arguments [ 2 ] , arguments [ 3 ] , arguments [ 4 ] , arguments [ 5 ] ) , Dn . call ( this ) ; var Hn = this . internal . _ _cell _ _ . lastCell , Vn = this . internal . _ _cell _ _ . padding , zn = this . internal . _ _cell _ _ . margins || Un , Kn = this . internal . _ _cell _ _ . tableHeaderRow , Wn = this . internal . _ _cell _ _ . printHeaders ; return void 0 !== Hn . lineNumber && ( Hn . lineNumber === Tn . lineNumber ? ( Tn . x = ( Hn . x || 0 ) + ( Hn . width || 0 ) , Tn . y = Hn . y || 0 ) : Hn . y + Hn . height + Tn . height + zn . bottom > this . getPageHeight ( ) ? ( this . cellAddPage ( ) , Tn . y = zn . top , Wn && Kn && ( this . printHeaderRow ( Tn . lineNumber , ! 0 ) , Tn . y += Kn [ 0 ] . height ) ) : Tn . y = Hn . y + Hn . height || Tn . y ) , void 0 !== Tn . text [ 0 ] && ( this . rect ( Tn . x , Tn . y , Tn . width , Tn . height , ! 0 === Qn ? "FD" : void 0 ) , "right" === Tn . align ? this . text ( Tn . text , Tn . x + Tn . width - Vn , Tn . y + Vn , { align : "right" , baseline : "top" } ) : "center" === Tn . align ? this . text ( Tn . text , Tn . x + Tn . width / 2 , Tn . y + Vn , { align : "center" , baseline : "top" , maxWidth : Tn . width - Vn - Vn } ) : this . text ( Tn . text , Tn . x + Vn , Tn . y + Vn , { align : "left" , baseline : "top" , maxWidth : Tn . width - Vn - Vn } ) ) , this . internal . _ _cell _ _ . lastCell = Tn , this } ; Tn . table = function ( Tn , Qn , Kn , Wn , Xn ) { if ( Dn . call ( this ) , ! Kn ) throw new Error ( "No data for PDF table." ) ; var Yn , Jn , $n , Zn , er = [ ] , tr = [ ] , nr = [ ] , rr = { } , ir = { } , or = [ ] , ar = [ ] , sr = ( Xn = Xn || { } ) . autoSize || ! 1 , lr = ! 1 !== Xn . printHeaders , cr = Xn . css && void 0 !== Xn . css [ "font-size" ] ? 16 * Xn . css [ "font-size" ] :
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
Copyright ( c ) 2013 Gildas Lormeau . All rights reserved .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
Redistribution and use in source and binary forms , with or without
modification , are permitted provided that the following conditions are met :
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
1. Redistributions of source code must retain the above copyright notice ,
this list of conditions and the following disclaimer .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
2. 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 .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
3. The names of the authors may not be used to endorse or promote products
derived from this software without specific prior written permission .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
THIS SOFTWARE IS PROVIDED ` ` AS IS '' AND ANY EXPRESSED 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 JCRAFT ,
INC . OR ANY CONTRIBUTORS TO THIS SOFTWARE 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-09-19 14:20:30 +00:00
var fm = [ 0 , 1 , 2 , 3 , 4 , 4 , 5 , 5 , 6 , 6 , 6 , 6 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 9 , 9 , 9 , 9 , 9 , 9 , 9 , 9 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 10 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 11 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 12 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 13 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 15 , 0 , 0 , 16 , 17 , 18 , 18 , 19 , 19 , 20 , 20 , 20 , 20 , 21 , 21 , 21 , 21 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 25 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 26 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 27 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 28 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 , 29 ] ; function ft ( ) { var Tn = this ; function e ( Tn , Un ) { var Qn = 0 ; do { Qn |= 1 & Tn , Tn >>>= 1 , Qn <<= 1 } while ( -- Un > 0 ) ; return Qn >>> 1 } Tn . build _tree = function ( Un ) { var Qn , Dn , Hn , Gn = Tn . dyn _tree , Vn = Tn . stat _desc . static _tree , zn = Tn . stat _desc . elems , Kn = - 1 ; for ( Un . heap _len = 0 , Un . heap _max = 573 , Qn = 0 ; Qn < zn ; Qn ++ ) 0 !== Gn [ 2 * Qn ] ? ( Un . heap [ ++ Un . heap _len ] = Kn = Qn , Un . depth [ Qn ] = 0 ) : Gn [ 2 * Qn + 1 ] = 0 ; for ( ; Un . heap _len < 2 ; ) Gn [ 2 * ( Hn = Un . heap [ ++ Un . heap _len ] = Kn < 2 ? ++ Kn : 0 ) ] = 1 , Un . depth [ Hn ] = 0 , Un . opt _len -- , Vn && ( Un . static _len -= Vn [ 2 * Hn + 1 ] ) ; for ( Tn . max _code = Kn , Qn = Math . floor ( Un . heap _len / 2 ) ; Qn >= 1 ; Qn -- ) Un . pqdownheap ( Gn , Qn ) ; Hn = zn ; do { Qn = Un . heap [ 1 ] , Un . heap [ 1 ] = Un . heap [ Un . heap _len -- ] , Un . pqdownheap ( Gn , 1 ) , Dn = Un . heap [ 1 ] , Un . heap [ -- Un . heap _max ] = Qn , Un . heap [ -- Un . heap _max ] = Dn , Gn [ 2 * Hn ] = Gn [ 2 * Qn ] + Gn [ 2 * Dn ] , Un . depth [ Hn ] = Math . max ( Un . depth [ Qn ] , Un . depth [ Dn ] ) + 1 , Gn [ 2 * Qn + 1 ] = Gn [ 2 * Dn + 1 ] = Hn , Un . heap [ 1 ] = Hn ++ , Un . pqdownheap ( Gn , 1 ) } while ( Un . heap _len >= 2 ) ; Un . heap [ -- Un . heap _max ] = Un . heap [ 1 ] , function ( Un ) { var Qn , Dn , Hn , Gn , Vn , zn , Kn = Tn . dyn _tree , Wn = Tn . stat _desc . static _tree , Xn = Tn . stat _desc . extra _bits , Yn = Tn . stat _desc . extra _base , Jn = Tn . stat _desc . max _length , $n = 0 ; for ( Gn = 0 ; Gn <= 15 ; Gn ++ ) Un . bl _count [ Gn ] = 0 ; for ( Kn [ 2 * Un . heap [ Un . heap _max ] + 1 ] = 0 , Qn = Un . heap _max + 1 ; Qn < 573 ; Qn ++ ) ( Gn = Kn [ 2 * Kn [ 2 * ( Dn = Un . heap [ Qn ] ) + 1 ] + 1 ] + 1 ) > Jn && ( Gn = Jn , $n ++ ) , Kn [ 2 * Dn + 1 ] = Gn , Dn > Tn . max _code || ( Un . bl _count [ Gn ] ++ , Vn = 0 , Dn >= Yn && ( Vn = Xn [ Dn - Yn ] ) , zn = Kn [ 2 * Dn ] , Un . opt _len += zn * ( Gn + Vn ) , Wn && ( Un . static _len += zn * ( Wn [ 2 * Dn + 1 ] + Vn ) ) ) ; if ( 0 !== $n ) { do { for ( Gn = Jn - 1 ; 0 === Un . bl _count [ Gn ] ; ) Gn -- ; Un . bl _count [ Gn ] -- , Un . bl _count [ Gn + 1 ] += 2 , Un . bl _count [ Jn ] -- , $n -= 2 } while ( $n > 0 ) ; for ( Gn = Jn ; 0 !== Gn ; Gn -- ) for ( Dn = Un . bl _count [ Gn ] ; 0 !== Dn ; ) ( Hn = Un . heap [ -- Qn ] ) > Tn . max _code || ( Kn [ 2 * Hn + 1 ] !== Gn && ( Un . opt _len += ( Gn - Kn [ 2 * Hn + 1 ] ) * Kn [ 2 * Hn ] , Kn [ 2 * Hn + 1 ] = Gn ) , Dn -- ) } } ( Un ) , function ( Tn , Un , Qn ) { var Dn , Hn , Gn , Vn = [ ] , zn = 0 ; for ( Dn = 1 ; Dn <= 15 ; Dn ++ ) Vn [ Dn ] = zn = zn + Qn [ Dn - 1 ] << 1 ; for ( Hn = 0 ; Hn <= Un ; Hn ++ ) 0 !== ( Gn = Tn [ 2 * Hn + 1 ] ) && ( Tn [ 2 * Hn ] = e ( Vn [ Gn ] ++ , Gn ) ) } ( Gn , Tn . max _code , Un . bl _count ) } } function dt ( Tn , Un , Qn , Dn , Hn ) { this . static _tree = Tn , this . extra _bits = Un , this . extra _base = Qn , this . elems = Dn , this . max _length = Hn } function pt ( Tn , Un , Qn , Dn , Hn ) { this . good _length = Tn , this . max _lazy = Un , this . nice _length = Qn , this . max _chain = Dn , this . func = Hn } ft . _length _code = [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 8 , 9 , 9 , 10 , 10 , 11 , 11 , 12 , 12 , 12 , 12 , 13 , 13 , 13 , 13 , 14 , 14 , 14 , 14 , 15 , 15 , 15 , 15 , 16 , 16 , 16 , 16 , 16 , 16 , 16 , 16 , 17 , 17 , 17 , 17 , 17 , 17 , 17 , 17 , 18 , 18 , 18 , 18 , 18 , 18 , 18 , 18 , 19 , 19 , 19 , 19 , 19 , 19 , 19 , 19 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 21 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 22 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 23 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 24 , 25 , 25 , 25 , 25 , 25 , 25 ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* jsPDF filters PlugIn
* Copyright ( c ) 2014 Aras Abbasi
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
2020-09-19 14:20:30 +00:00
* /Lt.prototype={deflateInit:function deflateInit(Tn,Un){return this.dstate=new Nt,Un||(Un=15),this.dstate.deflateInit(this,Tn,Un)},deflate:function deflate(Tn){return this.dstate?this.dstate.deflate(this,Tn):-2},deflateEnd:function deflateEnd(){if(!this.dstate)return-2;var Tn=this.dstate.deflateEnd();return this.dstate=null,Tn},deflateParams:function deflateParams(Tn,Un){return this.dstate?this.dstate.deflateParams(this,Tn,Un):-2},deflateSetDictionary:function deflateSetDictionary(Tn,Un){return this.dstate?this.dstate.deflateSetDictionary(this,Tn,Un):-2},read_buf:function read_buf(Tn,Un,Qn){var Dn=this.avail_in;return Dn>Qn&&(Dn=Qn),0===Dn?0:(this.avail_in-=Dn,Tn.set(this.next_in.subarray(this.next_in_index,this.next_in_index+Dn),Un),this.next_in_index+=Dn,this.total_in+=Dn,Dn)},flush_pending:function flush_pending(){var Tn=this.dstate.pending;Tn>this.avail_out&&(Tn=this.avail_out),0!==Tn&&(this.next_out.set(this.dstate.pending_buf.subarray(this.dstate.pending_out,this.dstate.pending_out+Tn),this.next_out_index),this.next_out_index+=Tn,this.dstate.pending_out+=Tn,this.total_out+=Tn,this.avail_out-=Tn,this.dstate.pending-=Tn,0===this.dstate.pending&&(this.dstate.pending_out=0))}},function(Tn){var Un=function e(Tn){var e,Un,Qn,Dn,Hn,Gn,Vn,zn,Kn,Wn;for(/ [ ^ \ x00 - \ xFF ] / . test ( Tn ) , Un = [ ] , Qn = 0 , Dn = ( Tn += e = "\0\0\0\0" . slice ( Tn . length % 4 || 4 ) ) . length ; Dn > Qn ; Qn += 4 ) 0 !== ( Hn = ( Tn . charCodeAt ( Qn ) << 24 ) + ( Tn . charCodeAt ( Qn + 1 ) << 16 ) + ( Tn . charCodeAt ( Qn + 2 ) << 8 ) + Tn . charCodeAt ( Qn + 3 ) ) ? ( Gn = ( Hn = ( ( Hn = ( ( Hn = ( ( Hn = ( Hn - ( Wn = Hn % 85 ) ) / 85 ) - ( Kn = Hn % 85 ) ) / 85 ) - ( zn = Hn % 85 ) ) / 85 ) - ( Vn = Hn % 85 ) ) / 85 ) % 85 , Un . push ( Gn + 33 , Vn + 33 , zn + 33 , Kn + 33 , Wn + 33 ) ) : Un . push ( 122 ) ; return function ( Tn , Un ) { for ( var Qn = Un ; Qn > 0 ; Qn -- ) Tn . pop ( ) } ( Un , e . length ) , String . fromCharCode . apply ( String , Un ) + "~>" } , Qn = function n ( Tn ) { var Un , n , Qn , Dn , Hn , Gn = String , Vn = "length" , zn = 255 , Kn = "charCodeAt" , Wn = "slice" , Xn = "replace" ; for ( Tn [ Wn ] ( - 2 ) , Tn = Tn [ Wn ] ( 0 , - 2 ) [ Xn ] ( /\s/g , "" ) [ Xn ] ( "z" , "!!!!!" ) , Qn = [ ] , Dn = 0 , Hn = ( Tn += Un = "uuuuu" [ Wn ] ( Tn [ Vn ] % 5 || 5 ) ) [ Vn ] ; Hn > Dn ; Dn += 5 ) n = 52200625 * ( Tn [ Kn ] ( Dn ) - 33 ) + 614125 * ( Tn [ Kn ] ( Dn + 1 ) - 33 ) + 7225 * ( Tn [ Kn ] ( Dn + 2 ) - 33 ) + 85 * ( Tn [ Kn ] ( Dn + 3 ) - 33 ) + ( Tn [ Kn ] ( Dn + 4 ) - 33 ) , Qn . push ( zn & n >> 24 , zn & n >> 16 , zn & n >> 8 , zn & n ) ; return function ( Tn , Un ) { for ( var Qn = Un ; Qn > 0 ; Qn -- ) Tn . pop ( ) } ( Qn , Un [ Vn ] ) , Gn . fromCharCode . apply ( Gn , Qn ) } , Dn = function r ( Tn ) { var Un = new RegExp ( /^([0-9A-Fa-f]{2})+$/ ) ; if ( - 1 !== ( Tn = Tn . replace ( /\s/g , "" ) ) . indexOf ( ">" ) && ( Tn = Tn . substr ( 0 , Tn . indexOf ( ">" ) ) ) , Tn . length % 2 && ( Tn += "0" ) , ! 1 === Un . test ( Tn ) ) return "" ; for ( var Qn = "" , r = 0 ; r < Tn . length ; r += 2 ) Qn += String . fromCharCode ( "0x" + ( Tn [ r ] + Tn [ r + 1 ] ) ) ; return Qn } , Hn = function i ( Un ) { for ( var Qn , Dn , i , Hn , Gn , Vn = [ ] , zn = Un . length ; zn -- ; ) Vn [ zn ] = Un . charCodeAt ( zn ) ; return Qn = Tn . adler32cs . from ( Un ) , i = Un = ( Dn = new xt ( 6 ) ) . append ( new Uint8Array ( Vn ) ) , Hn = Dn . flush ( ) , ( Gn = new Uint8Array ( i . byteLength + Hn . byteLength ) ) . set ( new Uint8Array ( i ) , 0 ) , Gn . set ( new Uint8Array ( Hn ) , i . byteLength ) , Un = Gn , ( Vn = new Uint8Array ( Un . byteLength + 6 ) ) . set ( new Uint8Array ( [ 120 , 156 ] ) ) , Vn . set ( Un , 2 ) , Vn . set ( new Uint8Array ( [ 255 & Qn , Qn >> 8 & 255 , Qn >> 16 & 255 , Qn >> 24 & 255 ] ) , Un . byteLength + 2 ) , Vn . reduce ( ( function ( Tn , Un ) { return Tn + String . fromCharCode ( Un ) } ) , "" ) } ; Tn . processDataByFilters = function ( Tn , Gn ) { var Vn = 0 , zn = Tn || "" , Kn = [ ] ; for ( "string" == typeof ( Gn = Gn || [ ] ) && ( Gn = [ Gn ] ) , Vn = 0 ; Vn < Gn . length ; Vn += 1 ) switch ( Gn [ Vn ] ) { case "ASCII85Decode" : case "/ASCII85Decode" : zn = Qn ( zn ) , Kn . push ( "/ASCII85Encode" ) ; break ; case "ASCII85Encode" : case "/ASCII85Encode" : zn = Un ( zn ) , Kn . push ( "/ASCII85Decode" ) ; break ; case "ASCIIHexDecode" : case "/ASCIIHexDecode" : zn = Dn ( zn ) , Kn . push ( "/ASCIIHexEncode" ) ; break ; case "ASCIIHexEncode" : case "/ASCIIHexEncode" : zn = zn . split ( "" ) . map ( ( function ( Tn ) { return ( "0" + Tn . charCodeAt ( ) . toString ( 16 ) ) . slice ( - 2 ) } ) ) . join ( "" ) + ">" , Kn . push ( "/ASCIIHexDecode" ) ; break ; case "FlateEncode" : case "/FlateEncode" : zn = Hn ( zn ) , Kn . push ( "/FlateDecode" ) ; break ; default : throw new Error ( 'The filter: "' + Gn [ Vn ] + '" is not implemented' ) } return { data : zn , reverseChain : Kn . reverse ( ) . join ( " " ) } } } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* jsPDF fileloading PlugIn
* Copyright ( c ) 2018 Aras Abbasi ( aras . abbasi @ gmail . com )
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-18 20:43:34 +00:00
function ( Tn ) { Tn . loadFile = function ( Tn , Un , Qn ) { return function ( Tn , Un , Qn ) { Un = ! 1 !== Un , Qn = "function" == typeof Qn ? Qn : function ( ) { } ; var Dn = void 0 ; try { Dn = function ( Tn , Un , Qn ) { var Dn = new XMLHttpRequest , Hn = 0 , Gn = function a ( Tn ) { var Un = Tn . length , Qn = [ ] , Dn = String . fromCharCode ; for ( Hn = 0 ; Hn < Un ; Hn += 1 ) Qn . push ( Dn ( 255 & Tn . charCodeAt ( Hn ) ) ) ; return Qn . join ( "" ) } ; if ( Dn . open ( "GET" , Tn , ! Un ) , Dn . overrideMimeType ( "text/plain; charset=x-user-defined" ) , ! 1 === Un && ( Dn . onload = function ( ) { 200 === Dn . status ? Qn ( Gn ( this . responseText ) ) : Qn ( void 0 ) } ) , Dn . send ( null ) , Un && 200 === Dn . status ) return Gn ( Dn . responseText ) } ( Tn , Un , Qn ) } catch ( Tn ) { } return Dn } ( Tn , Un , Qn ) } , Tn . loadImageFile = Tn . loadFile } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2018 Erik Koopmans
* Released under the MIT License .
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { function n ( ) { return ( gg . html2canvas ? Promise . resolve ( gg . html2canvas ) : Promise . resolve ( ) . then ( ( function ( ) { return qS } ) ) ) . catch ( ( function ( Tn ) { return Promise . reject ( new Error ( "Could not load dompurify: " + Tn ) ) } ) ) . then ( ( function ( Tn ) { return Tn . default ? Tn . default : Tn } ) ) } function r ( ) { return ( gg . DOMPurify ? Promise . resolve ( gg . DOMPurify ) : Promise . resolve ( ) . then ( ( function ( ) { return ek } ) ) ) . catch ( ( function ( Tn ) { return Promise . reject ( new Error ( "Could not load dompurify: " + Tn ) ) } ) ) . then ( ( function ( Tn ) { return Tn . default ? Tn . default : Tn } ) ) } var Un = function i ( Tn ) { var Un = _typeof ( Tn ) ; return "undefined" === Un ? "undefined" : "string" === Un || Tn instanceof String ? "string" : "number" === Un || Tn instanceof Number ? "number" : "function" === Un || Tn instanceof Function ? "function" : Tn && Tn . constructor === Array ? "array" : Tn && 1 === Tn . nodeType ? "element" : "object" === Un ? "object" : "unknown" } , Qn = function a ( Tn , Un ) { var Qn = document . createElement ( Tn ) ; for ( var Dn in Un . className && ( Qn . className = Un . className ) , Un . innerHTML && Un . dompurify && ( Qn . innerHTML = Un . dompurify . sanitize ( Un . innerHTML ) ) , Un . style ) Qn . style [ Dn ] = Un . style [ Dn ] ; return Qn } , Dn = function t ( Tn ) { var Un = Object . assign ( t . convert ( Promise . resolve ( ) ) , JSON . parse ( JSON . stringify ( t . template ) ) ) , Qn = t . convert ( Promise . resolve ( ) , Un ) ; return ( Qn = Qn . setProgress ( 1 , t , 1 , [ t ] ) ) . set ( Tn ) } ; ( Dn . prototype = Object . create ( Promise . prototype ) ) . constructor = Dn , Dn . convert = function ( Tn , Un ) { return Tn . _ _proto _ _ = Un || Dn . prototype , Tn } , Dn . template = { prop : { src : null , container : null , overlay : null , canvas : null , img : null , pdf : null , pageSize : null , callback : function callback ( ) { } } , progress : { val : 0 , state : null , n : 0 , stack : [ ] } , opt : { filename : "file.pdf" , margin : [ 0 , 0 , 0 , 0 ] , enableLinks : ! 0 , x : 0 , y : 0 , html2canvas : { } , jsPDF : { } , backgroundColor : "transparent" } } , Dn . prototype . from = function ( Tn , Dn ) { return this . then ( ( function ( ) { switch ( Dn = Dn || function ( Tn ) { switch ( Un ( Tn ) ) { case "string" : return "string" ; case "element" : return "canvas" === Tn . nodeName . toLowerCase ? "canvas" : "element" ; default : return "unknown" } } ( Tn ) ) { case "string" : return this . then ( r ) . then ( ( function ( Un ) { return this . set ( { src : Qn ( "div" , { innerHTML : Tn , dompurify : Un } ) } ) } ) ) ; case "element" : return this . set ( { src : Tn } ) ; case "canvas" : return this . set ( { canvas : Tn } ) ; case "img" : return this . set ( { img : Tn } ) ; default : return this . error ( "Unknown source type." ) } } ) ) } , Dn . prototype . to = function ( Tn ) { switch ( Tn ) { case "container" : return this . toContainer ( ) ; case "canvas" : return this . toCanvas ( ) ; case "img" : return this . toImg ( ) ; case "pdf" : return this . toPdf ( ) ; default : return this . error ( "Invalid target." ) } } , Dn . prototype . toContainer = function ( ) { return this . thenList ( [ function ( ) { return this . prop . src || this . error ( "Cannot duplicate - no source HTML." ) } , function ( ) { return this . prop . pageSize || this . setPageSize ( ) } ] ) . then ( ( function ( ) { var Tn = { position : "relative" , display : "inline-block" , width : Math . max ( this . prop . src . clientWidth , this . prop . src . scrollWidth , this . prop . src . offsetWidth ) + "px" , left : 0 , right : 0 , top : 0 , margin : "auto" , backgroundColor : this . opt . backgroundColor } , Un = function o ( Tn , Un ) { for ( var Qn = 3 === Tn . nodeType ? document . createTextNode ( Tn . nodeValue ) : Tn . cloneNode ( ! 1 ) , Dn = Tn . firstChild ; Dn ; Dn = Dn . nextSibling ) ! 0 !== Un && 1 === Dn . nodeType && "SCRIPT" === Dn . nodeName || Qn . appendChild ( o ( Dn , Un ) ) ; return 1 === Tn . nodeType && ( "CANVAS" === Tn . nodeName ? ( Qn . width = Tn . width , Qn . height = Tn . height , Qn . getContext ( "2d" ) . drawImage ( Tn , 0 , 0 ) ) : "TEXTAREA" !== Tn . nodeName && "SELECT" !== Tn . nodeName || ( Qn . value = Tn . value ) , Qn . addEventListener ( "load" , ( function ( ) { Qn . scrollTop = Tn . scrollTop , Qn . scrollLeft = Tn . scrollLeft } ) , ! 0 ) ) , Qn } ( this . prop . src , this . opt . html2canvas . javascriptEnabled ) ; "BODY" === Un . tagName && ( Tn . height = Math . max ( document . body . scrollHeight , document . body . offsetHeight , document . documentElement . clientHeight , document . documentElement . scrollHeight , document . documentElement . offsetHeight ) + "px" ) , this . prop . overlay = Qn ( "div" , { className : "html2pdf__overlay" , style : { position : "fixed" , overflow : "hidden" , zIndex : 1e3 , left : "-100000px" , right : 0 , bottom : 0 , top : 0 } } ) , this . prop . container = Qn ( "div" , { className : "html2pdf__container" , style : Tn } ) , this . prop . container . appendChild ( Un ) , this . prop . container . firstChild . appendChild ( Qn ( "div" , { style : { clear : "both" , border : "0 none transparent" , margin : 0 , padding : 0 , height : 0 } } ) ) , this . prop . container . sty
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2014 Steven Spungin ( TwelveTone LLC ) steven @ twelvetone . tv
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un ; Tn . events . push ( [ "postPutResources" , function ( ) { var Tn = this , Qn = /^(\d+) 0 obj$/ ; if ( this . outline . root . children . length > 0 ) for ( var Dn = Tn . outline . render ( ) . split ( /\r\n/ ) , Hn = 0 ; Hn < Dn . length ; Hn ++ ) { var Gn = Dn [ Hn ] , Vn = Qn . exec ( Gn ) ; if ( null != Vn ) { var zn = Vn [ 1 ] ; Tn . internal . newObjectDeferredBegin ( zn , ! 1 ) } Tn . internal . write ( Gn ) } if ( this . outline . createNamedDestinations ) { var Kn = this . internal . pages . length , Wn = [ ] ; for ( Hn = 0 ; Hn < Kn ; Hn ++ ) { var Xn = Tn . internal . newObject ( ) ; Wn . push ( Xn ) ; var Yn = Tn . internal . getPageInfo ( Hn + 1 ) ; Tn . internal . write ( "<< /D[" + Yn . objId + " 0 R /XYZ null null null]>> endobj" ) } var Jn = Tn . internal . newObject ( ) ; for ( Tn . internal . write ( "<< /Names [ " ) , Hn = 0 ; Hn < Wn . length ; Hn ++ ) Tn . internal . write ( "(page_" + ( Hn + 1 ) + ")" + Wn [ Hn ] + " 0 R" ) ; Tn . internal . write ( " ] >>" , "endobj" ) , Un = Tn . internal . newObject ( ) , Tn . internal . write ( "<< /Dests " + Jn + " 0 R" ) , Tn . internal . write ( ">>" , "endobj" ) } } ] ) , Tn . events . push ( [ "putCatalog" , function ( ) { this . outline . root . children . length > 0 && ( this . internal . write ( "/Outlines" , this . outline . makeRef ( this . outline . root ) ) , this . outline . createNamedDestinations && this . internal . write ( "/Names " + Un + " 0 R" ) ) } ] ) , Tn . events . push ( [ "initialized" , function ( ) { var Tn = this ; Tn . outline = { createNamedDestinations : ! 1 , root : { children : [ ] } } , Tn . outline . add = function ( Tn , Un , Qn ) { var Dn = { title : Un , options : Qn , children : [ ] } ; return null == Tn && ( Tn = this . root ) , Tn . children . push ( Dn ) , Dn } , Tn . outline . render = function ( ) { return this . ctx = { } , this . ctx . val = "" , this . ctx . pdf = Tn , this . genIds _r ( this . root ) , this . renderRoot ( this . root ) , this . renderItems ( this . root ) , this . ctx . val } , Tn . outline . genIds _r = function ( Un ) { Un . id = Tn . internal . newObjectDeferred ( ) ; for ( var Qn = 0 ; Qn < Un . children . length ; Qn ++ ) this . genIds _r ( Un . children [ Qn ] ) } , Tn . outline . renderRoot = function ( Tn ) { this . objStart ( Tn ) , this . line ( "/Type /Outlines" ) , Tn . children . length > 0 && ( this . line ( "/First " + this . makeRef ( Tn . children [ 0 ] ) ) , this . line ( "/Last " + this . makeRef ( Tn . children [ Tn . children . length - 1 ] ) ) ) , this . line ( "/Count " + this . count _r ( { count : 0 } , Tn ) ) , this . objEnd ( ) } , Tn . outline . renderItems = function ( Un ) { for ( var Qn = this . ctx . pdf . internal . getVerticalCoordinateString , Dn = 0 ; Dn < Un . children . length ; Dn ++ ) { var Hn = Un . children [ Dn ] ; this . objStart ( Hn ) , this . line ( "/Title " + this . makeString ( Hn . title ) ) , this . line ( "/Parent " + this . makeRef ( Un ) ) , Dn > 0 && this . line ( "/Prev " + this . makeRef ( Un . children [ Dn - 1 ] ) ) , Dn < Un . children . length - 1 && this . line ( "/Next " + this . makeRef ( Un . children [ Dn + 1 ] ) ) , Hn . children . length > 0 && ( this . line ( "/First " + this . makeRef ( Hn . children [ 0 ] ) ) , this . line ( "/Last " + this . makeRef ( Hn . children [ Hn . children . length - 1 ] ) ) ) ; var Gn = this . count = this . count _r ( { count : 0 } , Hn ) ; if ( Gn > 0 && this . line ( "/Count " + Gn ) , Hn . options && Hn . options . pageNumber ) { var Vn = Tn . internal . getPageInfo ( Hn . options . pageNumber ) ; this . line ( "/Dest [" + Vn . objId + " 0 R /XYZ 0 " + Qn ( 0 ) + " 0]" ) } this . objEnd ( ) } for ( var zn = 0 ; zn < Un . children . length ; zn ++ ) this . renderItems ( Un . children [ zn ] ) } , Tn . outline . line = function ( Tn ) { this . ctx . val += Tn + "\r\n" } , Tn . outline . makeRef = function ( Tn ) { return Tn . id + " 0 R" } , Tn . outline . makeString = function ( Un ) { return "(" + Tn . internal . pdfEscape ( Un ) + ")" } , Tn . outline . objStart = function ( Tn ) { this . ctx . val += "\r\n" + Tn . id + " 0 obj\r\n<<\r\n" } , Tn . outline . objEnd = function ( ) { this . ctx . val += ">> \r\nendobj\r\n" } , Tn . outline . count _r = function ( Tn , Un ) { for ( var Qn = 0 ; Qn < Un . children . length ; Qn ++ ) Tn . count ++ , this . count _r ( Tn , Un . children [ Qn ] ) ; return Tn . count } } ] ) } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un = [ 192 , 193 , 194 , 195 , 196 , 197 , 198 , 199 ] ; Tn . processJPEG = function ( Tn , Qn , Dn , Hn , Gn , Vn ) { var zn , Kn = this . decode . DCT _DECODE , Wn = null ; if ( "string" == typeof Tn || this . _ _addimage _ _ . isArrayBuffer ( Tn ) || this . _ _addimage _ _ . isArrayBufferView ( Tn ) ) { switch ( Tn = Gn || Tn , Tn = this . _ _addimage _ _ . isArrayBuffer ( Tn ) ? new Uint8Array ( Tn ) : Tn , ( zn = function ( Tn ) { for ( var Qn , Dn = 256 * Tn . charCodeAt ( 4 ) + Tn . charCodeAt ( 5 ) , Hn = Tn . length , Gn = { width : 0 , height : 0 , numcomponents : 1 } , Vn = 4 ; Vn < Hn ; Vn += 2 ) { if ( Vn += Dn , - 1 !== Un . indexOf ( Tn . charCodeAt ( Vn + 1 ) ) ) { Qn = 256 * Tn . charCodeAt ( Vn + 5 ) + Tn . charCodeAt ( Vn + 6 ) , Gn = { width : 256 * Tn . charCodeAt ( Vn + 7 ) + Tn . charCodeAt ( Vn + 8 ) , height : Qn , numcomponents : Tn . charCodeAt ( Vn + 9 ) } ; break } Dn = 256 * Tn . charCodeAt ( Vn + 2 ) + Tn . charCodeAt ( Vn + 3 ) } return Gn } ( Tn = this . _ _addimage _ _ . isArrayBufferView ( Tn ) ? this . _ _addimage _ _ . arrayBufferToBinaryString ( Tn ) : Tn ) ) . numcomponents ) { case 1 : Vn = this . color _spaces . DEVICE _GRAY ; break ; case 4 : Vn = this . color _spaces . DEVICE _CMYK ; break ; case 3 : Vn = this . color _spaces . DEVICE _RGB } Wn = { data : Tn , width : zn . width , height : zn . height , colorSpace : Vn , bitsPerComponent : 8 , filter : Kn , index : Qn , alias : Dn } } return Wn } } ( g . API ) ;
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Extracted from pdf . js
* https : //github.com/andreasgal/pdf.js
*
* Copyright ( c ) 2011 Mozilla Foundation
*
* Contributors : Andreas Gal < gal @ mozilla . com >
* Chris G Jones < cjones @ mozilla . com >
* Shaon Barman < shaon . barman @ gmail . com >
* Vivien Nicolas < 21 @ vingtetun . org >
* Justin D ' Arcangelo < justindarc @ gmail . com >
* Yury Delendik
*
* Permission is hereby granted , free of charge , to any person obtaining a
* copy of this software and associated documentation files ( the "Software" ) ,
* to deal in the Software without restriction , including without limitation
* the rights to use , copy , modify , merge , publish , distribute , sublicense ,
* and / or sell copies of the Software , and to permit persons to whom the
* Software is furnished to do so , subject to the following conditions :
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND , EXPRESS OR
* IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY ,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT . IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM , DAMAGES OR OTHER
* LIABILITY , WHETHER IN AN ACTION OF CONTRACT , TORT OR OTHERWISE , ARISING
* FROM , OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE .
* /
2020-09-19 14:20:30 +00:00
var xm , Sm , km , Cm , Bm , Em = function ( ) { function t ( ) { this . pos = 0 , this . bufferLength = 0 , this . eof = ! 1 , this . buffer = null } return t . prototype = { ensureBuffer : function ensureBuffer ( Tn ) { var Un = this . buffer , Qn = Un ? Un . byteLength : 0 ; if ( Tn < Qn ) return Un ; for ( var Dn = 512 ; Dn < Tn ; ) Dn <<= 1 ; for ( var Hn = new Uint8Array ( Dn ) , Gn = 0 ; Gn < Qn ; ++ Gn ) Hn [ Gn ] = Un [ Gn ] ; return this . buffer = Hn } , getByte : function getByte ( ) { for ( var Tn = this . pos ; this . bufferLength <= Tn ; ) { if ( this . eof ) return null ; this . readBlock ( ) } return this . buffer [ this . pos ++ ] } , getBytes : function getBytes ( Tn ) { var Un = this . pos ; if ( Tn ) { this . ensureBuffer ( Un + Tn ) ; for ( var Qn = Un + Tn ; ! this . eof && this . bufferLength < Qn ; ) this . readBlock ( ) ; var Dn = this . bufferLength ; Qn > Dn && ( Qn = Dn ) } else { for ( ; ! this . eof ; ) this . readBlock ( ) ; Qn = this . bufferLength } return this . pos = Qn , this . buffer . subarray ( Un , Qn ) } , lookChar : function lookChar ( ) { for ( var Tn = this . pos ; this . bufferLength <= Tn ; ) { if ( this . eof ) return null ; this . readBlock ( ) } return String . fromCharCode ( this . buffer [ this . pos ] ) } , getChar : function getChar ( ) { for ( var Tn = this . pos ; this . bufferLength <= Tn ; ) { if ( this . eof ) return null ; this . readBlock ( ) } return String . fromCharCode ( this . buffer [ this . pos ++ ] ) } , makeSubStream : function makeSubStream ( Tn , Un , Qn ) { for ( var Dn = Tn + Un ; this . bufferLength <= Dn && ! this . eof ; ) this . readBlock ( ) ; return new Stream ( this . buffer , Tn , Un , Qn ) } , skip : function skip ( Tn ) { Tn || ( Tn = 1 ) , this . pos += Tn } , reset : function reset ( ) { this . pos = 0 } } , t } ( ) , Nm = ( "undefined" != typeof self && self || "undefined" != typeof window && window || void 0 !== sg && sg || Function ( 'return typeof this === "object" && this.content' ) ( ) || Function ( "return this" ) ( ) ) . FlateStream = function ( ) { if ( "undefined" != typeof Uint32Array ) { var Tn = new Uint32Array ( [ 16 , 17 , 18 , 0 , 8 , 7 , 9 , 6 , 10 , 5 , 11 , 4 , 12 , 3 , 13 , 2 , 14 , 1 , 15 ] ) , Un = new Uint32Array ( [ 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 65547 , 65549 , 65551 , 65553 , 131091 , 131095 , 131099 , 131103 , 196643 , 196651 , 196659 , 196667 , 262211 , 262227 , 262243 , 262259 , 327811 , 327843 , 327875 , 327907 , 258 , 258 , 258 ] ) , Qn = new Uint32Array ( [ 1 , 2 , 3 , 4 , 65541 , 65543 , 131081 , 131085 , 196625 , 196633 , 262177 , 262193 , 327745 , 327777 , 393345 , 393409 , 459009 , 459137 , 524801 , 525057 , 590849 , 591361 , 657409 , 658433 , 724993 , 727041 , 794625 , 798721 , 868353 , 876545 ] ) , Dn = [ new Uint32Array ( [ 459008 , 524368 , 524304 , 524568 , 459024 , 524400 , 524336 , 590016 , 459016 , 524384 , 524320 , 589984 , 524288 , 524416 , 524352 , 590048 , 459012 , 524376 , 524312 , 589968 , 459028 , 524408 , 524344 , 590032 , 459020 , 524392 , 524328 , 59e4 , 524296 , 524424 , 524360 , 590064 , 459010 , 524372 , 524308 , 524572 , 459026 , 524404 , 524340 , 590024 , 459018 , 524388 , 524324 , 589992 , 524292 , 524420 , 524356 , 590056 , 459014 , 524380 , 524316 , 589976 , 459030 , 524412 , 524348 , 590040 , 459022 , 524396 , 524332 , 590008 , 524300 , 524428 , 524364 , 590072 , 459009 , 524370 , 524306 , 524570 , 459025 , 524402 , 524338 , 590020 , 459017 , 524386 , 524322 , 589988 , 524290 , 524418 , 524354 , 590052 , 459013 , 524378 , 524314 , 589972 , 459029 , 524410 , 524346 , 590036 , 459021 , 524394 , 524330 , 590004 , 524298 , 524426 , 524362 , 590068 , 459011 , 524374 , 524310 , 524574 , 459027 , 524406 , 524342 , 590028 , 459019 , 524390 , 524326 , 589996 , 524294 , 524422 , 524358 , 590060 , 459015 , 524382 , 524318 , 589980 , 459031 , 524414 , 524350 , 590044 , 459023 , 524398 , 524334 , 590012 , 524302 , 524430 , 524366 , 590076 , 459008 , 524369 , 524305 , 524569 , 459024 , 524401 , 524337 , 590018 , 459016 , 524385 , 524321 , 589986 , 524289 , 524417 , 524353 , 590050 , 459012 , 524377 , 524313 , 589970 , 459028 , 524409 , 524345 , 590034 , 459020 , 524393 , 524329 , 590002 , 524297 , 524425 , 524361 , 590066 , 459010 , 524373 , 524309 , 524573 , 459026 , 524405 , 524341 , 590026 , 459018 , 524389 , 524325 , 589994 , 524293 , 524421 , 524357 , 590058 , 459014 , 524381 , 524317 , 589978 , 459030 , 524413 , 524349 , 590042 , 459022 , 524397 , 524333 , 590010 , 524301 , 524429 , 524365 , 590074 , 459009 , 524371 , 524307 , 524571 , 459025 , 524403 , 524339 , 590022 , 459017 , 524387 , 524323 , 589990 , 524291 , 524419 , 524355 , 590054 , 459013 , 524379 , 524315 , 589974 , 459029 , 524411 , 524347 , 590038 , 459021 , 524395 , 524331 , 590006 , 524299 , 524427 , 524363 , 590070 , 459011 , 524375 , 524311 , 524575 , 459027 , 524407 , 524343 , 590030 , 459019 , 524391 , 524327 , 589998 , 524295 , 524423 , 524359 , 590062 , 459015 , 524383 , 524319 , 589982 , 459031 , 524415 , 524351 , 590046 , 459023 , 524399 , 524335 , 590014 , 524303 , 524431 , 524367 , 590078 , 459008 , 524368 , 524304 , 524568 , 459024 , 524400 , 524336 , 590017 , 459016 , 524384 , 524320 , 589985 , 524288 , 524416 , 524352 , 590049 , 459012 , 524376 , 524312 , 589969 , 459028 , 524408 , 524344 , 590033 , 459020 , 524392 , 524328 , 590001 , 524296 , 524424 , 524360 , 590065 , 459
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* ( c ) Dean McNamee < dean @ gmail . com > , 2013.
*
* https : //github.com/deanm/omggif
*
* Permission is hereby granted , free of charge , to any person obtaining a copy
* of this software and associated documentation files ( the "Software" ) , to
* deal in the Software without restriction , including without limitation the
* rights to use , copy , modify , merge , publish , distribute , sublicense , and / or
* sell copies of the Software , and to permit persons to whom the Software is
* furnished to do so , subject to the following conditions :
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND , EXPRESS OR
* IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY ,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT . IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM , DAMAGES OR OTHER
* LIABILITY , WHETHER IN AN ACTION OF CONTRACT , TORT OR OTHERWISE , ARISING
* FROM , OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE .
*
* omggif is a JavaScript implementation of a GIF 89 a encoder and decoder ,
* including animation and compression . It does not rely on any specific
* underlying system , so should run in the browser , Node , or Plask .
2020-09-19 14:20:30 +00:00
* / f u n c t i o n j t ( T n ) { v a r U n = 0 ; i f ( 7 1 ! = = T n [ U n + + ] | | 7 3 ! = = T n [ U n + + ] | | 7 0 ! = = T n [ U n + + ] | | 5 6 ! = = T n [ U n + + ] | | 5 6 ! = ( T n [ U n + + ] + 1 & 2 5 3 ) | | 9 7 ! = = T n [ U n + + ] ) t h r o w n e w E r r o r ( " I n v a l i d G I F 8 7 a / 8 9 a h e a d e r . " ) ; v a r Q n = T n [ U n + + ] | T n [ U n + + ] < < 8 , D n = T n [ U n + + ] | T n [ U n + + ] < < 8 , H n = T n [ U n + + ] , G n = H n > > 7 , V n = 1 < < 1 + ( 7 & H n ) ; T n [ U n + + ] , T n [ U n + + ] ; v a r z n = n u l l , K n = n u l l ; G n & & ( z n = U n , K n = V n , U n + = 3 * V n ) ; v a r W n = ! 0 , X n = [ ] , Y n = 0 , J n = n u l l , $ n = 0 , Z n = n u l l ; f o r ( t h i s . w i d t h = Q n , t h i s . h e i g h t = D n ; W n & & U n < T n . l e n g t h ; ) s w i t c h ( T n [ U n + + ] ) { c a s e 3 3 : s w i t c h ( T n [ U n + + ] ) { c a s e 2 5 5 : i f ( 1 1 ! = = T n [ U n ] | | 7 8 = = T n [ U n + 1 ] & & 6 9 = = T n [ U n + 2 ] & & 8 4 = = T n [ U n + 3 ] & & 8 3 = = T n [ U n + 4 ] & & 6 7 = = T n [ U n + 5 ] & & 6 5 = = T n [ U n + 6 ] & & 8 0 = = T n [ U n + 7 ] & & 6 9 = = T n [ U n + 8 ] & & 5 0 = = T n [ U n + 9 ] & & 4 6 = = T n [ U n + 1 0 ] & & 4 8 = = T n [ U n + 1 1 ] & & 3 = = T n [ U n + 1 2 ] & & 1 = = T n [ U n + 1 3 ] & & 0 = = T n [ U n + 1 6 ] ) U n + = 1 4 , Z n = T n [ U n + + ] | T n [ U n + + ] < < 8 , U n + + ; e l s e f o r ( U n + = 1 2 ; ; ) { i f ( ! ( ( h r = T n [ U n + + ] ) > = 0 ) ) t h r o w E r r o r ( " I n v a l i d b l o c k s i z e " ) ; i f ( 0 = = = h r ) b r e a k ; U n + = h r } b r e a k ; c a s e 2 4 9 : i f ( 4 ! = = T n [ U n + + ] | | 0 ! = = T n [ U n + 4 ] ) t h r o w n e w E r r o r ( " I n v a l i d g r a p h i c s e x t e n s i o n b l o c k . " ) ; v a r e r = T n [ U n + + ] ; Y n = T n [ U n + + ] | T n [ U n + + ] < < 8 , J n = T n [ U n + + ] , 0 = = ( 1 & e r ) & & ( J n = n u l l ) , $ n = e r > > 2 & 7 , U n + + ; b r e a k ; c a s e 2 5 4 : f o r ( ; ; ) { i f ( ! ( ( h r = T n [ U n + + ] ) > = 0 ) ) t h r o w E r r o r ( " I n v a l i d b l o c k s i z e " ) ; i f ( 0 = = = h r ) b r e a k ; U n + = h r } b r e a k ; d e f a u l t : t h r o w n e w E r r o r ( " U n k n o w n g r a p h i c c o n t r o l l a b e l : 0 x " + T n [ U n - 1 ] . t o S t r i n g ( 1 6 ) ) } b r e a k ; c a s e 4 4 : v a r t r = T n [ U n + + ] | T n [ U n + + ] < < 8 , n r = T n [ U n + + ] | T n [ U n + + ] < < 8 , r r = T n [ U n + + ] | T n [ U n + + ] < < 8 , i r = T n [ U n + + ] | T n [ U n + + ] < < 8 , o r = T n [ U n + + ] , a r = o r > > 6 & 1 , s r = 1 < < 1 + ( 7 & o r ) , l r = z n , c r = K n , u r = ! 1 ; o r > > 7 & & ( u r = ! 0 , l r = U n , c r = s r , U n + = 3 * s r ) ; v a r d r = U n ; f o r ( U n + + ; ; ) { v a r h r ; i f ( ! ( ( h r = T n [ U n + + ] ) > = 0 ) ) t h r o w E r r o r ( " I n v a l i d b l o c k s i z e " ) ; i f ( 0 = = = h r ) b r e a k ; U n + = h r } X n . p u s h ( { x : t r , y : n r , w i d t h : r r , h e i g h t : i r , h a s _ l o c a l _ p a l e t t e : u r , p a l e t t e _ o f f s e t : l r , p a l e t t e _ s i z e : c r , d a t a _ o f f s e t : d r , d a t a _ l e n g t h : U n - d r , t r a n s p a r e n t _ i n d e x : J n , i n t e r l a c e d : ! ! a r , d e l a y : Y n , d i s p o s a l : $ n } ) ; b r e a k ; c a s e 5 9 : W n = ! 1 ; b r e a k ; d e f a u l t : t h r o w n e w E r r o r ( " U n k n o w n g i f b l o c k : 0 x " + T n [ U n - 1 ] . t o S t r i n g ( 1 6 ) ) } t h i s . n u m F r a m e s = f u n c t i o n ( ) { r e t u r n X n . l e n g t h } , t h i s . l o o p C o u n t = f u n c t i o n ( ) { r e t u r n Z n } , t h i s . f r a m e I n f o = f u n c t i o n ( T n ) { i f ( T n < 0 | | T n > = X n . l e n g t h ) t h r o w n e w E r r o r ( " F r a m e i n d e x o u t o f r a n g e . " ) ; r e t u r n X n [ T n ] } , t h i s . d e c o d e A n d B l i t F r a m e B G R A = f u n c t i o n ( U n , D n ) { v a r H n = t h i s . f r a m e I n f o ( U n ) , G n = H n . w i d t h * H n . h e i g h t , V n = n e w U i n t 8 A r r a y ( G n ) ; B t ( T n , H n . d a t a _ o f f s e t , V n , G n ) ; v a r z n = H n . p a l e t t e _ o f f s e t , K n = H n . t r a n s p a r e n t _ i n d e x ; n u l l = = = K n & & ( K n = 2 5 6 ) ; v a r W n = H n . w i d t h , X n = Q n - W n , Y n = W n , J n = 4 * ( H n . y * Q n + H n . x ) , $ n = 4 * ( ( H n . y + H n . h e i g h t ) * Q n + H n . x ) , Z n = J n , e r = 4 * X n ; ! 0 = = = H n . i n t e r l a c e d & & ( e r + = 4 * Q n * 7 ) ; f o r ( v a r t r = 8 , n r = 0 , r r = V n . l e n g t h ; n r < r r ; + + n r ) { v a r i r = V n [ n r ] ; i f ( 0 = = = Y n & & ( Y n = W n , ( Z n + = e r ) > = $ n & & ( e r = 4 * X n + 4 * Q n * ( t r - 1 ) , Z n = J n + ( W n + X n ) * ( t r < < 1 ) , t r > > = 1 ) ) , i r = = = K n ) Z n + = 4 ; e l s e { v a r o r = T n [ z n + 3 * i r ] , a r = T n [ z n + 3 * i r + 1 ] , s r = T n [ z n + 3 * i r + 2 ] ; D n [ Z n + + ] = s r , D n [ Z n + + ] = a r , D n [ Z n + + ] = o r , D n [ Z n + + ] = 2 5 5 } - - Y n } } , t h i s . d e c o d e A n d B l i t F r a m e R G B A = f u n c t i o n ( U n , D n ) { v a r H n = t h i s . f r a m e I n f o ( U n ) , G n = H n . w i d t h * H n . h e i g h t , V n = n e w U i n t 8 A r r a y ( G n ) ; B t ( T n , H n . d a t a _ o f f s e t , V n , G n ) ; v a r z n = H n . p a l e t t e _ o f f s e t , K n = H n . t r a n s p a r e n t _ i n d e x ; n u l l = = = K n & & ( K n = 2 5 6 ) ; v a r W n = H n . w i d t h , X n = Q n - W n , Y n = W n , J n = 4 * ( H n . y * Q n + H n . x ) , $ n = 4 * ( ( H n . y + H n . h e i g h t ) * Q n + H n . x ) , Z n = J n , e r = 4 * X n ; ! 0 = = = H n . i n t e r l a c e d & & ( e r + = 4 * Q n * 7 ) ; f o r ( v a r t r = 8 , n r = 0 , r r = V n . l e n g t h ; n r < r r ; + + n r ) { v a r i r = V n [ n r ] ; i f ( 0 = = = Y n & & ( Y n = W n , ( Z n + = e r ) > = $ n & & ( e r = 4 * X n + 4 * Q n * ( t r - 1 ) , Z n = J n + ( W n + X n ) * ( t r < < 1 ) , t r > > = 1 ) ) , i r = = = K n ) Z n + = 4 ; e l s e { v a r o r = T n [ z n + 3 * i r ] , a r = T n [ z n + 3 * i r + 1 ] , s r = T n [ z n + 3 * i r + 2 ] ; D n [ Z n + + ] = o r , D n [ Z n + + ] = a r , D n [ Z n + + ] = s r , D n [ Z n + + ] = 2 5 5 } - - Y n } } } f u n c t i o n B t ( T n , U n , Q n , D n ) { f o r ( v a r H n = T n [ U n + + ] , G n = 1 < < H n , V n = G n + 1 , z n = V n + 1 , K n = H n + 1 , W n = ( 1 < < K n ) - 1 , X n = 0 , Y n = 0 , J n = 0 , $ n = T n [ U n + + ] , Z n = n e w I n t 3 2 A r r a y ( 4 0 9 6 ) , e r = n u l l ; ; ) { f o r ( ; X n < 1 6 & & 0 ! = = $ n ; ) Y n | = T n [ U n + + ] < < X n , X n + = 8 , 1 = = = $ n ? $ n = T n [ U n + + ] : - - $ n ; i f ( X n < K n ) b r e a k ; v a r t r = Y n & W n ; i f ( Y n > > = K n , X n - = K n , t r ! = = G n ) { i f ( t r = = = V n ) b r e a k ; f o r ( v a r n r = t r < z n ? t r : e r , r r = 0 , i r = n r ; i r > G n ; ) i r = Z n [ i r ] > > 8 , + + r r ; v a r o r = i r ; i f ( J n + r r + ( n r ! = = t r ? 1 : 0 ) > D n ) r e t u r n v o i d m g . l o g ( " W a r n i n g , g i f s t r e a m l o n g e r t h a n e x p e c t e d . " ) ; Q n [ J n + + ] = o r ; v a r a r = J n + = r r ; f o r ( n r ! = = t r & & ( Q n [ J n + + ] = o r ) , i r = n r ; r r - - ; ) i r = Z n [ i r ] , Q n [ - - a r ] = 2 5 5 & i r , i r > > = 8 ; n u l l ! = = e r & & z n < 4 0 9 6 & & ( Z n [ z n + + ] = e r < < 8 | o r , z n > = W n + 1 & & K n < 1 2 & & ( + + K n , W n = W n < < 1 | 1 ) ) , e r = t r } e l s e z n = V n + 1 , W n = ( 1 < < ( K n = H n + 1 ) ) - 1 , e r = n u l l } r e t u r n J n ! = = D n & & m g . l o g ( " W a r n i n g , g i f s t r e a m s h o r t e r t h a n e x p e c t e d . " ) , Q n
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
Copyright ( c ) 2008 , Adobe Systems Incorporated
All rights reserved .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
Redistribution and use in source and binary forms , with or without
modification , are permitted provided that the following conditions are
met :
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
* 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 .
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission .
2020-08-28 22:07:07 +00:00
2020-09-08 23:35:47 +00:00
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 OWNER 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-09-19 14:20:30 +00:00
* / } f u n c t i o n O t ( T n ) { v a r U n , Q n , D n , H n , G n , V n = M a t h . f l o o r , z n = n e w A r r a y ( 6 4 ) , K n = n e w A r r a y ( 6 4 ) , W n = n e w A r r a y ( 6 4 ) , X n = n e w A r r a y ( 6 4 ) , Y n = n e w A r r a y ( 6 5 5 3 5 ) , J n = n e w A r r a y ( 6 5 5 3 5 ) , $ n = n e w A r r a y ( 6 4 ) , Z n = n e w A r r a y ( 6 4 ) , e r = [ ] , t r = 0 , n r = 7 , r r = n e w A r r a y ( 6 4 ) , i r = n e w A r r a y ( 6 4 ) , o r = n e w A r r a y ( 6 4 ) , a r = n e w A r r a y ( 2 5 6 ) , s r = n e w A r r a y ( 2 0 4 8 ) , l r = [ 0 , 1 , 5 , 6 , 1 4 , 1 5 , 2 7 , 2 8 , 2 , 4 , 7 , 1 3 , 1 6 , 2 6 , 2 9 , 4 2 , 3 , 8 , 1 2 , 1 7 , 2 5 , 3 0 , 4 1 , 4 3 , 9 , 1 1 , 1 8 , 2 4 , 3 1 , 4 0 , 4 4 , 5 3 , 1 0 , 1 9 , 2 3 , 3 2 , 3 9 , 4 5 , 5 2 , 5 4 , 2 0 , 2 2 , 3 3 , 3 8 , 4 6 , 5 1 , 5 5 , 6 0 , 2 1 , 3 4 , 3 7 , 4 7 , 5 0 , 5 6 , 5 9 , 6 1 , 3 5 , 3 6 , 4 8 , 4 9 , 5 7 , 5 8 , 6 2 , 6 3 ] , c r = [ 0 , 0 , 1 , 5 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] , u r = [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , 1 1 ] , d r = [ 0 , 0 , 2 , 1 , 3 , 3 , 2 , 4 , 3 , 5 , 5 , 4 , 4 , 0 , 0 , 1 , 1 2 5 ] , h r = [ 1 , 2 , 3 , 0 , 4 , 1 7 , 5 , 1 8 , 3 3 , 4 9 , 6 5 , 6 , 1 9 , 8 1 , 9 7 , 7 , 3 4 , 1 1 3 , 2 0 , 5 0 , 1 2 9 , 1 4 5 , 1 6 1 , 8 , 3 5 , 6 6 , 1 7 7 , 1 9 3 , 2 1 , 8 2 , 2 0 9 , 2 4 0 , 3 6 , 5 1 , 9 8 , 1 1 4 , 1 3 0 , 9 , 1 0 , 2 2 , 2 3 , 2 4 , 2 5 , 2 6 , 3 7 , 3 8 , 3 9 , 4 0 , 4 1 , 4 2 , 5 2 , 5 3 , 5 4 , 5 5 , 5 6 , 5 7 , 5 8 , 6 7 , 6 8 , 6 9 , 7 0 , 7 1 , 7 2 , 7 3 , 7 4 , 8 3 , 8 4 , 8 5 , 8 6 , 8 7 , 8 8 , 8 9 , 9 0 , 9 9 , 1 0 0 , 1 0 1 , 1 0 2 , 1 0 3 , 1 0 4 , 1 0 5 , 1 0 6 , 1 1 5 , 1 1 6 , 1 1 7 , 1 1 8 , 1 1 9 , 1 2 0 , 1 2 1 , 1 2 2 , 1 3 1 , 1 3 2 , 1 3 3 , 1 3 4 , 1 3 5 , 1 3 6 , 1 3 7 , 1 3 8 , 1 4 6 , 1 4 7 , 1 4 8 , 1 4 9 , 1 5 0 , 1 5 1 , 1 5 2 , 1 5 3 , 1 5 4 , 1 6 2 , 1 6 3 , 1 6 4 , 1 6 5 , 1 6 6 , 1 6 7 , 1 6 8 , 1 6 9 , 1 7 0 , 1 7 8 , 1 7 9 , 1 8 0 , 1 8 1 , 1 8 2 , 1 8 3 , 1 8 4 , 1 8 5 , 1 8 6 , 1 9 4 , 1 9 5 , 1 9 6 , 1 9 7 , 1 9 8 , 1 9 9 , 2 0 0 , 2 0 1 , 2 0 2 , 2 1 0 , 2 1 1 , 2 1 2 , 2 1 3 , 2 1 4 , 2 1 5 , 2 1 6 , 2 1 7 , 2 1 8 , 2 2 5 , 2 2 6 , 2 2 7 , 2 2 8 , 2 2 9 , 2 3 0 , 2 3 1 , 2 3 2 , 2 3 3 , 2 3 4 , 2 4 1 , 2 4 2 , 2 4 3 , 2 4 4 , 2 4 5 , 2 4 6 , 2 4 7 , 2 4 8 , 2 4 9 , 2 5 0 ] , p r = [ 0 , 0 , 3 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 0 , 0 , 0 , 0 ] , A r = [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , 1 1 ] , f r = [ 0 , 0 , 2 , 1 , 2 , 4 , 4 , 3 , 4 , 7 , 5 , 4 , 4 , 0 , 1 , 2 , 1 1 9 ] , g r = [ 0 , 1 , 2 , 3 , 1 7 , 4 , 5 , 3 3 , 4 9 , 6 , 1 8 , 6 5 , 8 1 , 7 , 9 7 , 1 1 3 , 1 9 , 3 4 , 5 0 , 1 2 9 , 8 , 2 0 , 6 6 , 1 4 5 , 1 6 1 , 1 7 7 , 1 9 3 , 9 , 3 5 , 5 1 , 8 2 , 2 4 0 , 2 1 , 9 8 , 1 1 4 , 2 0 9 , 1 0 , 2 2 , 3 6 , 5 2 , 2 2 5 , 3 7 , 2 4 1 , 2 3 , 2 4 , 2 5 , 2 6 , 3 8 , 3 9 , 4 0 , 4 1 , 4 2 , 5 3 , 5 4 , 5 5 , 5 6 , 5 7 , 5 8 , 6 7 , 6 8 , 6 9 , 7 0 , 7 1 , 7 2 , 7 3 , 7 4 , 8 3 , 8 4 , 8 5 , 8 6 , 8 7 , 8 8 , 8 9 , 9 0 , 9 9 , 1 0 0 , 1 0 1 , 1 0 2 , 1 0 3 , 1 0 4 , 1 0 5 , 1 0 6 , 1 1 5 , 1 1 6 , 1 1 7 , 1 1 8 , 1 1 9 , 1 2 0 , 1 2 1 , 1 2 2 , 1 3 0 , 1 3 1 , 1 3 2 , 1 3 3 , 1 3 4 , 1 3 5 , 1 3 6 , 1 3 7 , 1 3 8 , 1 4 6 , 1 4 7 , 1 4 8 , 1 4 9 , 1 5 0 , 1 5 1 , 1 5 2 , 1 5 3 , 1 5 4 , 1 6 2 , 1 6 3 , 1 6 4 , 1 6 5 , 1 6 6 , 1 6 7 , 1 6 8 , 1 6 9 , 1 7 0 , 1 7 8 , 1 7 9 , 1 8 0 , 1 8 1 , 1 8 2 , 1 8 3 , 1 8 4 , 1 8 5 , 1 8 6 , 1 9 4 , 1 9 5 , 1 9 6 , 1 9 7 , 1 9 8 , 1 9 9 , 2 0 0 , 2 0 1 , 2 0 2 , 2 1 0 , 2 1 1 , 2 1 2 , 2 1 3 , 2 1 4 , 2 1 5 , 2 1 6 , 2 1 7 , 2 1 8 , 2 2 6 , 2 2 7 , 2 2 8 , 2 2 9 , 2 3 0 , 2 3 1 , 2 3 2 , 2 3 3 , 2 3 4 , 2 4 2 , 2 4 3 , 2 4 4 , 2 4 5 , 2 4 6 , 2 4 7 , 2 4 8 , 2 4 9 , 2 5 0 ] ; f u n c t i o n j ( T n , U n ) { f o r ( v a r Q n = 0 , D n = 0 , H n = n e w A r r a y , G n = 1 ; G n < = 1 6 ; G n + + ) { f o r ( v a r V n = 1 ; V n < = T n [ G n ] ; V n + + ) H n [ U n [ D n ] ] = [ ] , H n [ U n [ D n ] ] [ 0 ] = Q n , H n [ U n [ D n ] ] [ 1 ] = G n , D n + + , Q n + + ; Q n * = 2 } r e t u r n H n } f u n c t i o n B ( T n ) { f o r ( v a r U n = T n [ 0 ] , Q n = T n [ 1 ] - 1 ; Q n > = 0 ; ) U n & 1 < < Q n & & ( t r | = 1 < < n r ) , Q n - - , - - n r < 0 & & ( 2 5 5 = = t r ? ( O ( 2 5 5 ) , O ( 0 ) ) : O ( t r ) , n r = 7 , t r = 0 ) } f u n c t i o n O ( T n ) { e r . p u s h ( T n ) } f u n c t i o n M ( T n ) { O ( T n > > 8 & 2 5 5 ) , O ( 2 5 5 & T n ) } f u n c t i o n E ( T n , U n , Q n , D n , H n ) { f o r ( v a r G n , V n = H n [ 0 ] , z n = H n [ 2 4 0 ] , K n = f u n c t i o n ( T n , U n ) { v a r Q n , D n , H n , G n , V n , z n , K n , W n , X n , Y n , J n = 0 ; f o r ( X n = 0 ; X n < 8 ; + + X n ) { Q n = T n [ J n ] , D n = T n [ J n + 1 ] , H n = T n [ J n + 2 ] , G n = T n [ J n + 3 ] , V n = T n [ J n + 4 ] , z n = T n [ J n + 5 ] , K n = T n [ J n + 6 ] ; v a r Z n = Q n + ( W n = T n [ J n + 7 ] ) , e r = Q n - W n , t r = D n + K n , n r = D n - K n , r r = H n + z n , i r = H n - z n , o r = G n + V n , a r = G n - V n , s r = Z n + o r , l r = Z n - o r , c r = t r + r r , u r = t r - r r ; T n [ J n ] = s r + c r , T n [ J n + 4 ] = s r - c r ; v a r d r = . 7 0 7 1 0 6 7 8 1 * ( u r + l r ) ; T n [ J n + 2 ] = l r + d r , T n [ J n + 6 ] = l r - d r ; v a r h r = . 3 8 2 6 8 3 4 3 3 * ( ( s r = a r + i r ) - ( u r = n r + e r ) ) , p r = . 5 4 1 1 9 6 1 * s r + h r , A r = 1 . 3 0 6 5 6 2 9 6 5 * u r + h r , f r = . 7 0 7 1 0 6 7 8 1 * ( c r = i r + n r ) , g r = e r + f r , m r = e r - f r ; T n [ J n + 5 ] = m r + p r , T n [ J n + 3 ] = m r - p r , T n [ J n + 1 ] = g r + A r , T n [ J n + 7 ] = g r - A r , J n + = 8 } f o r ( J n = 0 , X n = 0 ; X n < 8 ; + + X n ) { Q n = T n [ J n ] , D n = T n [ J n + 8 ] , H n = T n [ J n + 1 6 ] , G n = T n [ J n + 2 4 ] , V n = T n [ J n + 3 2 ] , z n = T n [ J n + 4 0 ] , K n = T n [ J n + 4 8 ] ; v a r _ r = Q n + ( W n = T n [ J n + 5 6 ] ) , v r = Q n - W n , y r = D n + K n , w r = D n - K n , b r = H n + z n , x r = H n - z n , S r = G n + V n , k r = G n - V n , C r = _ r + S r , B r = _ r - S r , E r = y r + b r , N r = y r - b r ; T n [ J n ] = C r + E r , T n [ J n + 3 2 ] = C r - E r ; v a r L r = . 7 0 7 1 0 6 7 8 1 * ( N r + B r ) ; T n [ J n + 1 6 ] = B r + L r , T n [ J n + 4 8 ] = B r - L r ; v a r T r = . 3 8 2 6 8 3 4 3 3 * ( ( C r = k r + x r ) - ( N r = w r + v r ) ) , P r = . 5 4 1 1 9 6 1 * C r + T r , F r = 1 . 3 0 6 5 6 2 9 6 5 * N r + T r , U r = . 7 0 7 1 0 6 7 8 1 * ( E r = x r + w r ) , I r = v r + U r , R r = v r - U r ; T n [ J n + 4 0 ] = R r + P r , T n [ J n + 2 4 ] = R r - P r , T n [ J n + 8 ] = I r + F r , T n [ J n + 5 6 ] = I r - F r , J n + + } f o r ( X n = 0 ; X n < 6 4 ; + + X n ) Y n = T n [ X n ] * U n [ X n ] , $ n [ X n ] = Y n > 0 ? Y n + . 5 | 0 : Y n - . 5 | 0 ; r e t u r n $ n } ( T n , U n ) , W n = 0 ; W n < 6 4 ; + + W n ) Z n [ l r [ W n ] ] = K n [ W n ] ; v a r X n = Z n [ 0 ] - Q n ; Q n = Z n [ 0 ] , 0 = = X n ? B ( D n [ 0 ] ) : ( B ( D n [ J n [ G n = 3 2 7 6 7 + X n ] ] ) , B ( Y n [ G n ] ) ) ; f o r ( v a r e r = 6 3 ; e r > 0 & & 0 = = Z n [ e r ] ; ) e r - - ; i f ( 0 = = e r ) r e t u r n B ( V n ) , Q n ; f o r ( v a r t r , n r = 1 ; n r < = e r ; ) { f o r ( v a r r r = n r ; 0 = = Z n [ n r ] & & n r < = e r ; ) + + n r ; v a r i r = n r - r r ; i f ( i r > = 1 6 ) { t r = i r > > 4 ; f o r ( v a r o r = 1 ; o r < = t r ; + + o r ) B ( z n ) ; i r & = 1 5 } G n = 3 2 7 6 7 + Z n [ n r ] , B ( H n [ ( i r < < 4 ) + J n [ G n ] ] ) , B ( Y n [ G n ] ) , n r + + } r e t u r n 6 3 ! = e r & & B ( V n ) , Q n } f u n c t i o n q ( T n ) { T n = M a t h . m i n ( M a t h . m a x ( T n , 1 ) , 1 0 0 ) , G n ! = T n & & ( f u n c t i o n ( T n ) { f o r ( v a r U n = [ 1 6 , 1 1 , 1 0 , 1 6 , 2 4 , 4 0 , 5 1 , 6 1 , 1 2 , 1 2 , 1 4 , 1 9 , 2 6 , 5 8 , 6 0 , 5 5 , 1 4 , 1 3 , 1 6 , 2 4 , 4 0 , 5 7 , 6 9 , 5 6 , 1 4 , 1 7 , 2 2 , 2 9 , 5 1 , 8 7 , 8 0 , 6 2 , 1 8 , 2 2 , 3 7 , 5 6 , 6 8 , 1 0 9 , 1 0 3 , 7 7 , 2 4 , 3 5 , 5 5 , 6 4 , 8 1 , 1 0 4 , 1 1 3 , 9 2 , 4 9 , 6 4 , 7 8 , 8 7 , 1 0 3 , 1 2 1 , 1 2 0 , 1 0 1 , 7 2 , 9 2 , 9 5 , 9 8 , 1 1 2 ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2017 Aras Abbasi
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
2020-09-19 14:20:30 +00:00
* / f u n c t i o n M t ( T n , U n ) { i f ( t h i s . p o s = 0 , t h i s . b u f f e r = T n , t h i s . d a t a v = n e w D a t a V i e w ( T n . b u f f e r ) , t h i s . i s _ w i t h _ a l p h a = ! ! U n , t h i s . b o t t o m _ u p = ! 0 , t h i s . f l a g = S t r i n g . f r o m C h a r C o d e ( t h i s . b u f f e r [ 0 ] ) + S t r i n g . f r o m C h a r C o d e ( t h i s . b u f f e r [ 1 ] ) , t h i s . p o s + = 2 , - 1 = = = [ " B M " , " B A " , " C I " , " C P " , " I C " , " P T " ] . i n d e x O f ( t h i s . f l a g ) ) t h r o w n e w E r r o r ( " I n v a l i d B M P F i l e " ) ; t h i s . p a r s e H e a d e r ( ) , t h i s . p a r s e B G R ( ) } f u n c t i o n E t ( T n ) { f u n c t i o n e ( T n ) { i f ( ! T n ) t h r o w E r r o r ( " a s s e r t : P " ) } f u n c t i o n n ( T n , U n , Q n ) { f o r ( v a r D n = 0 ; 4 > D n ; D n + + ) i f ( T n [ U n + D n ] ! = Q n . c h a r C o d e A t ( D n ) ) r e t u r n ! 0 ; r e t u r n ! 1 } f u n c t i o n r ( T n , U n , Q n , D n , H n ) { f o r ( v a r G n = 0 ; G n < H n ; G n + + ) T n [ U n + G n ] = Q n [ D n + G n ] } f u n c t i o n i ( T n , U n , Q n , D n ) { f o r ( v a r H n = 0 ; H n < D n ; H n + + ) T n [ U n + H n ] = Q n } f u n c t i o n a ( T n ) { r e t u r n n e w I n t 3 2 A r r a y ( T n ) } f u n c t i o n o ( T n , U n ) { f o r ( v a r Q n = [ ] , D n = 0 ; D n < T n ; D n + + ) Q n . p u s h ( n e w U n ) ; r e t u r n Q n } f u n c t i o n s ( T n , U n ) { v a r Q n = [ ] ; r e t u r n f u n c t i o n t ( T n , Q n , D n ) { f o r ( v a r H n = D n [ Q n ] , G n = 0 ; G n < H n & & ( T n . p u s h ( D n . l e n g t h > Q n + 1 ? [ ] : n e w U n ) , ! ( D n . l e n g t h < Q n + 1 ) ) ; G n + + ) t ( T n [ G n ] , Q n + 1 , D n ) } ( Q n , 0 , T n ) , Q n } f u n c t i o n u ( T n , U n ) { f o r ( v a r Q n = " " , D n = 0 ; D n < 4 ; D n + + ) Q n + = S t r i n g . f r o m C h a r C o d e ( T n [ U n + + ] ) ; r e t u r n Q n } f u n c t i o n c ( T n , U n ) { r e t u r n ( T n [ U n + 0 ] < < 0 | T n [ U n + 1 ] < < 8 | T n [ U n + 2 ] < < 1 6 ) > > > 0 } f u n c t i o n h ( T n , U n ) { r e t u r n ( T n [ U n + 0 ] < < 0 | T n [ U n + 1 ] < < 8 | T n [ U n + 2 ] < < 1 6 | T n [ U n + 3 ] < < 2 4 ) > > > 0 } n e w ( E t = f u n c t i o n E t ( ) { v a r T n = t h i s ; f u n c t i o n u ( T n , U n ) { f o r ( v a r Q n = 1 < < U n - 1 > > > 0 ; T n & Q n ; ) Q n > > > = 1 ; r e t u r n Q n ? ( T n & Q n - 1 ) + Q n : T n } f u n c t i o n c ( T n , U n , Q n , D n , H n ) { e ( ! ( D n % Q n ) ) ; d o { T n [ U n + ( D n - = Q n ) ] = H n } w h i l e ( 0 < D n ) } f u n c t i o n h ( T n , U n , Q n , D n , H n ) { i f ( e ( 2 3 2 8 > = H n ) , 5 1 2 > = H n ) v a r G n = a ( 5 1 2 ) ; e l s e i f ( n u l l = = ( G n = a ( H n ) ) ) r e t u r n 0 ; r e t u r n f u n c t i o n ( T n , U n , Q n , D n , H n , G n ) { v a r V n , z n , K n = U n , W n = 1 < < Q n , X n = a ( 1 6 ) , Y n = a ( 1 6 ) ; f o r ( e ( 0 ! = H n ) , e ( n u l l ! = D n ) , e ( n u l l ! = T n ) , e ( 0 < Q n ) , z n = 0 ; z n < H n ; + + z n ) { i f ( 1 5 < D n [ z n ] ) r e t u r n 0 ; + + X n [ D n [ z n ] ] } i f ( X n [ 0 ] = = H n ) r e t u r n 0 ; f o r ( Y n [ 1 ] = 0 , V n = 1 ; 1 5 > V n ; + + V n ) { i f ( X n [ V n ] > 1 < < V n ) r e t u r n 0 ; Y n [ V n + 1 ] = Y n [ V n ] + X n [ V n ] } f o r ( z n = 0 ; z n < H n ; + + z n ) V n = D n [ z n ] , 0 < D n [ z n ] & & ( G n [ Y n [ V n ] + + ] = z n ) ; i f ( 1 = = Y n [ 1 5 ] ) r e t u r n ( D n = n e w l ) . g = 0 , D n . v a l u e = G n [ 0 ] , c ( T n , K n , 1 , W n , D n ) , W n ; v a r J n , $ n = - 1 , Z n = W n - 1 , e r = 0 , t r = 1 , n r = 1 , r r = 1 < < Q n ; f o r ( z n = 0 , V n = 1 , H n = 2 ; V n < = Q n ; + + V n , H n < < = 1 ) { i f ( t r + = n r < < = 1 , 0 > ( n r - = X n [ V n ] ) ) r e t u r n 0 ; f o r ( ; 0 < X n [ V n ] ; - - X n [ V n ] ) ( D n = n e w l ) . g = V n , D n . v a l u e = G n [ z n + + ] , c ( T n , K n + e r , H n , r r , D n ) , e r = u ( e r , V n ) } f o r ( V n = Q n + 1 , H n = 2 ; 1 5 > = V n ; + + V n , H n < < = 1 ) { i f ( t r + = n r < < = 1 , 0 > ( n r - = X n [ V n ] ) ) r e t u r n 0 ; f o r ( ; 0 < X n [ V n ] ; - - X n [ V n ] ) { i f ( D n = n e w l , ( e r & Z n ) ! = $ n ) { f o r ( K n + = r r , J n = 1 < < ( $ n = V n ) - Q n ; 1 5 > $ n & & ! ( 0 > = ( J n - = X n [ $ n ] ) ) ; ) + + $ n , J n < < = 1 ; W n + = r r = 1 < < ( J n = $ n - Q n ) , T n [ U n + ( $ n = e r & Z n ) ] . g = J n + Q n , T n [ U n + $ n ] . v a l u e = K n - U n - $ n } D n . g = V n - Q n , D n . v a l u e = G n [ z n + + ] , c ( T n , K n + ( e r > > Q n ) , H n , r r , D n ) , e r = u ( e r , V n ) } } r e t u r n t r ! = 2 * Y n [ 1 5 ] - 1 ? 0 : W n } ( T n , U n , Q n , D n , H n , G n ) } f u n c t i o n l ( ) { t h i s . v a l u e = t h i s . g = 0 } f u n c t i o n f ( ) { t h i s . v a l u e = t h i s . g = 0 } f u n c t i o n d ( ) { t h i s . G = o ( 5 , l ) , t h i s . H = a ( 5 ) , t h i s . j c = t h i s . Q b = t h i s . q b = t h i s . n d = 0 , t h i s . p d = o ( U n , f ) } f u n c t i o n p ( T n , U n , Q n , D n ) { e ( n u l l ! = T n ) , e ( n u l l ! = U n ) , e ( 2 1 4 7 4 8 3 6 4 8 > D n ) , T n . C a = 2 5 4 , T n . I = 0 , T n . b = - 8 , T n . K a = 0 , T n . o a = U n , T n . p a = Q n , T n . J d = U n , T n . Y c = Q n + D n , T n . Z c = 4 < = D n ? Q n + D n - 4 + 1 : Q n , S ( T n ) } f u n c t i o n g ( T n , U n ) { f o r ( v a r Q n = 0 ; 0 < U n - - ; ) Q n | = k ( T n , 1 2 8 ) < < U n ; r e t u r n Q n } f u n c t i o n m ( T n , U n ) { v a r Q n = g ( T n , U n ) ; r e t u r n P ( T n ) ? - Q n : Q n } f u n c t i o n v ( T n , U n , Q n , D n ) { v a r H n , G n = 0 ; f o r ( e ( n u l l ! = T n ) , e ( n u l l ! = U n ) , e ( 4 2 9 4 9 6 7 2 8 8 > D n ) , T n . S b = D n , T n . R a = 0 , T n . u = 0 , T n . h = 0 , 4 < D n & & ( D n = 4 ) , H n = 0 ; H n < D n ; + + H n ) G n + = U n [ Q n + H n ] < < 8 * H n ; T n . R a = G n , T n . b b = D n , T n . o a = U n , T n . p a = Q n } f u n c t i o n b ( T n ) { f o r ( ; 8 < = T n . u & & T n . b b < T n . S b ; ) T n . R a > > > = 8 , T n . R a + = T n . o a [ T n . p a + T n . b b ] < < H n - 8 > > > 0 , + + T n . b b , T n . u - = 8 ; x ( T n ) & & ( T n . h = 1 , T n . u = 0 ) } f u n c t i o n y ( T n , U n ) { i f ( e ( 0 < = U n ) , ! T n . h & & U n < = D n ) { v a r H n = L ( T n ) & Q n [ U n ] ; r e t u r n T n . u + = U n , b ( T n ) , H n } r e t u r n T n . h = 1 , T n . u = 0 } f u n c t i o n w ( ) { t h i s . b = t h i s . C a = t h i s . I = 0 , t h i s . o a = [ ] , t h i s . p a = 0 , t h i s . J d = [ ] , t h i s . Y c = 0 , t h i s . Z c = [ ] , t h i s . K a = 0 } f u n c t i o n N ( ) { t h i s . R a = 0 , t h i s . o a = [ ] , t h i s . h = t h i s . u = t h i s . b b = t h i s . S b = t h i s . p a = 0 } f u n c t i o n L ( T n ) { r e t u r n T n . R a > > > ( T n . u & H n - 1 ) > > > 0 } f u n c t i o n x ( T n ) { r e t u r n e ( T n . b b < = T n . S b ) , T n . h | | T n . b b = = T n . S b & & T n . u > H n } f u n c t i o n A ( T n , U n ) { T n . u = U n , T n . h = x ( T n ) } f u n c t i o n _ ( T n ) { T n . u > = G n & & ( e ( T n . u > = G n ) , b ( T n ) ) } f u n c t i o n S ( T n ) { e ( n u l l ! = T n & & n u l l ! = T n . o a ) , T n . p a < T n . Z c ? ( T n . I = ( T n . o a [ T n . p a + + ] | T n . I < < 8 ) > > > 0 , T n . b + = 8 ) : ( e ( n u l l ! = T n & & n u l l ! = T n . o a ) , T n . p a < T n . Y c ? ( T n . b + = 8 , T n . I = T n . o a [ T n . p a + + ] | T n . I < < 8 ) : T n . K a ? T n . b = 0 : ( T n . I < < = 8 , T n . b + = 8 , T n . K a = 1 ) ) } f u n c t i o n P ( T n ) { r e t u r n g ( T n , 1 ) } f u n c t i o n k ( T n , U n ) { v a r Q n = T n . C a ; 0 > T n . b & & S ( T n ) ; v a r D n = T n . b , H n = Q n * U n > > > 8 , G n = ( T n . I > > > D n > H n ) + 0 ; f o r ( G n ? ( Q n - = H n , T n . I - = H n + 1 < < D n > > > 0 ) : Q n = H n + 1 , D n = Q n , H n = 0 ; 2 5 6 < = D n ; ) H n +
2020-09-04 20:34:30 +00:00
/ * * @ l i c e n s e
2020-09-08 23:35:47 +00:00
* Copyright ( c ) 2017 Dominik Homberger
Permission is hereby granted , free of charge , to any person obtaining a copy of this software and associated documentation files ( the "Software" ) , to deal in the Software without restriction , including without limitation the rights to use , copy , modify , merge , publish , distribute , sublicense , and / or sell copies of the Software , and to permit persons to whom the Software is furnished to do so , subject to the following conditions :
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software .
THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND , EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
https : //webpjs.appspot.com
WebPRiffParser dominikhlbg @ gmail . com
* /
2020-09-19 14:20:30 +00:00
function ( Tn , Un , Qn , Dn ) { for ( var Hn = 0 ; Hn < 4 ; Hn ++ ) if ( Tn [ Un + Hn ] != "RIFF" . charCodeAt ( Hn ) ) return ! 0 ; return ! 1 } ( Tn , Un ) ) { var zn , Kn ; for ( h ( Tn , Un += 4 ) , Un += 8 ; Un < Tn . length ; ) { var Wn = u ( Tn , Un ) , Xn = h ( Tn , Un += 4 ) ; Un += 4 ; var Yn = Xn + ( 1 & Xn ) ; switch ( Wn ) { case "VP8 " : case "VP8L" : void 0 === Qn . frames [ Dn ] && ( Qn . frames [ Dn ] = { } ) , ( Zn = Qn . frames [ Dn ] ) . src _off = Hn ? Vn : Un - 8 , Zn . src _size = Gn + Xn + 8 , Dn ++ , Hn && ( Hn = ! 1 , Gn = 0 , Vn = 0 ) ; break ; case "VP8X" : ( Zn = Qn . header = { } ) . feature _flags = Tn [ Un ] ; var Jn = Un + 4 ; Zn . canvas _width = 1 + c ( Tn , Jn ) , Jn += 3 , Zn . canvas _height = 1 + c ( Tn , Jn ) , Jn += 3 ; break ; case "ALPH" : Hn = ! 0 , Gn = Yn + 8 , Vn = Un - 8 ; break ; case "ANIM" : ( Zn = Qn . header ) . bgcolor = h ( Tn , Un ) , Jn = Un + 4 , Zn . loop _count = ( zn = Tn ) [ ( Kn = Jn ) + 0 ] << 0 | zn [ Kn + 1 ] << 8 , Jn += 2 ; break ; case "ANMF" : var $n , Zn ; ( Zn = Qn . frames [ Dn ] = { } ) . offset _x = 2 * c ( Tn , Un ) , Un += 3 , Zn . offset _y = 2 * c ( Tn , Un ) , Un += 3 , Zn . width = 1 + c ( Tn , Un ) , Un += 3 , Zn . height = 1 + c ( Tn , Un ) , Un += 3 , Zn . duration = c ( Tn , Un ) , Un += 3 , $n = Tn [ Un ++ ] , Zn . dispose = 1 & $n , Zn . blend = $n >> 1 & 1 } "ANMF" != Wn && ( Un += Yn ) } return Qn } } ( Gn , 0 ) ; Vn . response = Gn , Vn . rgbaoutput = ! 0 , Vn . dataurl = ! 1 ; var zn = Vn . header ? Vn . header : null , Kn = Vn . frames ? Vn . frames : null ; if ( zn ) { zn . loop _counter = zn . loop _count , Un = [ zn . canvas _height ] , Qn = [ zn . canvas _width ] ; for ( var Wn = 0 ; Wn < Kn . length && 0 != Kn [ Wn ] . blend ; Wn ++ ) ; } var Xn = Kn [ 0 ] , Yn = Hn . WebPDecodeRGBA ( Gn , Xn . src _off , Xn . src _size , Qn , Un ) ; Xn . rgba = Yn , Xn . imgwidth = Qn [ 0 ] , Xn . imgheight = Un [ 0 ] ; for ( var Jn = 0 ; Jn < Qn [ 0 ] * Un [ 0 ] * 4 ; Jn ++ ) Dn [ Jn ] = Yn [ Jn ] ; return this . width = Qn , this . height = Un , this . data = Dn , this
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
*
* Copyright ( c ) 2014 James Robb , https : //github.com/jamesbrobb
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
2020-09-19 14:20:30 +00:00
* / } ! f u n c t i o n ( T n ) { v a r U n = f u n c t i o n n ( U n , H n , W n , X n ) { v a r Y n = 5 , J n = V n ; s w i t c h ( X n ) { c a s e T n . i m a g e _ c o m p r e s s i o n . F A S T : Y n = 3 , J n = G n ; b r e a k ; c a s e T n . i m a g e _ c o m p r e s s i o n . M E D I U M : Y n = 6 , J n = z n ; b r e a k ; c a s e T n . i m a g e _ c o m p r e s s i o n . S L O W : Y n = 9 , J n = K n } U n = D n ( U n , H n , W n , J n ) ; v a r $ n = n e w U i n t 8 A r r a y ( Q n ( Y n ) ) , Z n = g . A P I . a d l e r 3 2 c s . f r o m B u f f e r ( U n . b u f f e r ) , e r = n e w x t ( Y n ) , t r = e r . a p p e n d ( U n ) , n r = e r . f l u s h ( ) , r r = $ n . l e n g t h + t r . l e n g t h + n r . l e n g t h , i r = n e w U i n t 8 A r r a y ( r r + 4 ) ; r e t u r n i r . s e t ( $ n ) , i r . s e t ( t r , $ n . l e n g t h ) , i r . s e t ( n r , $ n . l e n g t h + t r . l e n g t h ) , i r [ r r + + ] = Z n > > > 2 4 & 2 5 5 , i r [ r r + + ] = Z n > > > 1 6 & 2 5 5 , i r [ r r + + ] = Z n > > > 8 & 2 5 5 , i r [ r r + + ] = 2 5 5 & Z n , T n . _ _ a d d i m a g e _ _ . a r r a y B u f f e r T o B i n a r y S t r i n g ( i r ) } , Q n = f u n c t i o n r ( T n ) { v a r U n = 3 0 7 2 0 ; r e t u r n U n | = M a t h . m i n ( 3 , ( T n - 1 & 2 5 5 ) > > 1 ) < < 6 , U n | = 0 , [ 1 2 0 , 2 5 5 & ( U n + = 3 1 - U n % 3 1 ) ] } , D n = f u n c t i o n i ( T n , U n , Q n , D n ) { f o r ( v a r i , H n , G n , V n = T n . l e n g t h / U n , z n = n e w U i n t 8 A r r a y ( T n . l e n g t h + V n ) , K n = X n ( ) , W n = 0 ; W n < V n ; W n + = 1 ) { i f ( G n = W n * U n , i = T n . s u b a r r a y ( G n , G n + U n ) , D n ) z n . s e t ( D n ( i , Q n , H n ) , G n + W n ) ; e l s e { f o r ( v a r J n , $ n = K n . l e n g t h , Z n = [ ] ; J n < $ n ; J n + = 1 ) Z n [ J n ] = K n [ J n ] ( i , Q n , H n ) ; v a r e r = Y n ( Z n . c o n c a t ( ) ) ; z n . s e t ( Z n [ e r ] , G n + W n ) } H n = i } r e t u r n z n } , H n = f u n c t i o n a ( T n ) { v a r U n = A r r a y . a p p l y ( [ ] , T n ) ; r e t u r n U n . u n s h i f t ( 0 ) , U n } , G n = f u n c t i o n o ( T n , U n ) { v a r Q n , D n = [ ] , H n = T n . l e n g t h ; D n [ 0 ] = 1 ; f o r ( v a r G n = 0 ; G n < H n ; G n + = 1 ) Q n = T n [ G n - U n ] | | 0 , D n [ G n + 1 ] = T n [ G n ] - Q n + 2 5 6 & 2 5 5 ; r e t u r n D n } , V n = f u n c t i o n s ( T n , U n , Q n ) { v a r D n , H n = [ ] , G n = T n . l e n g t h ; H n [ 0 ] = 2 ; f o r ( v a r V n = 0 ; V n < G n ; V n + = 1 ) D n = Q n & & Q n [ V n ] | | 0 , H n [ V n + 1 ] = T n [ V n ] - D n + 2 5 6 & 2 5 5 ; r e t u r n H n } , z n = f u n c t i o n u ( T n , U n , Q n ) { v a r D n , H n , G n = [ ] , V n = T n . l e n g t h ; G n [ 0 ] = 3 ; f o r ( v a r z n = 0 ; z n < V n ; z n + = 1 ) D n = T n [ z n - U n ] | | 0 , H n = Q n & & Q n [ z n ] | | 0 , G n [ z n + 1 ] = T n [ z n ] + 2 5 6 - ( D n + H n > > > 1 ) & 2 5 5 ; r e t u r n G n } , K n = f u n c t i o n c ( T n , U n , Q n ) { v a r D n , H n , G n , V n , z n = [ ] , K n = T n . l e n g t h ; z n [ 0 ] = 4 ; f o r ( v a r c = 0 ; c < K n ; c + = 1 ) D n = T n [ c - U n ] | | 0 , H n = Q n & & Q n [ c ] | | 0 , G n = Q n & & Q n [ c - U n ] | | 0 , V n = W n ( D n , H n , G n ) , z n [ c + 1 ] = T n [ c ] - V n + 2 5 6 & 2 5 5 ; r e t u r n z n } , W n = f u n c t i o n h ( T n , U n , Q n ) { i f ( T n = = = U n & & U n = = = Q n ) r e t u r n T n ; v a r D n = M a t h . a b s ( U n - Q n ) , H n = M a t h . a b s ( T n - Q n ) , G n = M a t h . a b s ( T n + U n - Q n - Q n ) ; r e t u r n D n < = H n & & D n < = G n ? T n : H n < = G n ? U n : Q n } , X n = f u n c t i o n l ( ) { r e t u r n [ H n , G n , V n , z n , K n ] } , Y n = f u n c t i o n f ( T n ) { v a r U n = T n . m a p ( ( f u n c t i o n ( T n ) { r e t u r n T n . r e d u c e ( ( f u n c t i o n ( T n , U n ) { r e t u r n T n + M a t h . a b s ( U n ) } ) , 0 ) } ) ) ; r e t u r n U n . i n d e x O f ( M a t h . m i n . a p p l y ( n u l l , U n ) ) } ; T n . p r o c e s s P N G = f u n c t i o n ( Q n , D n , H n , G n ) { v a r V n , z n , K n , W n , X n , Y n , J n , $ n , Z n , e r , t r , n r , r r , i r , o r , a r = t h i s . d e c o d e . F L A T E _ D E C O D E , s r = " " ; i f ( t h i s . _ _ a d d i m a g e _ _ . i s A r r a y B u f f e r ( Q n ) & & ( Q n = n e w U i n t 8 A r r a y ( Q n ) ) , t h i s . _ _ a d d i m a g e _ _ . i s A r r a y B u f f e r V i e w ( Q n ) ) { i f ( Q n = ( K n = n e w L m ( Q n ) ) . i m g D a t a , z n = K n . b i t s , V n = K n . c o l o r S p a c e , X n = K n . c o l o r s , - 1 ! = = [ 4 , 6 ] . i n d e x O f ( K n . c o l o r T y p e ) ) { i f ( 8 = = = K n . b i t s ) { Z n = ( $ n = 3 2 = = K n . p i x e l B i t l e n g t h ? n e w U i n t 3 2 A r r a y ( K n . d e c o d e P i x e l s ( ) . b u f f e r ) : 1 6 = = K n . p i x e l B i t l e n g t h ? n e w U i n t 1 6 A r r a y ( K n . d e c o d e P i x e l s ( ) . b u f f e r ) : n e w U i n t 8 A r r a y ( K n . d e c o d e P i x e l s ( ) . b u f f e r ) ) . l e n g t h , t r = n e w U i n t 8 A r r a y ( Z n * K n . c o l o r s ) , e r = n e w U i n t 8 A r r a y ( Z n ) ; v a r l r , c r = K n . p i x e l B i t l e n g t h - K n . b i t s ; f o r ( i r = 0 , o r = 0 ; i r < Z n ; i r + + ) { f o r ( r r = $ n [ i r ] , l r = 0 ; l r < c r ; ) t r [ o r + + ] = r r > > > l r & 2 5 5 , l r + = K n . b i t s ; e r [ i r ] = r r > > > l r & 2 5 5 } } i f ( 1 6 = = = K n . b i t s ) { Z n = ( $ n = n e w U i n t 3 2 A r r a y ( K n . d e c o d e P i x e l s ( ) . b u f f e r ) ) . l e n g t h , t r = n e w U i n t 8 A r r a y ( Z n * ( 3 2 / K n . p i x e l B i t l e n g t h ) * K n . c o l o r s ) , e r = n e w U i n t 8 A r r a y ( Z n * ( 3 2 / K n . p i x e l B i t l e n g t h ) ) , n r = K n . c o l o r s > 1 , i r = 0 , o r = 0 ; f o r ( v a r u r = 0 ; i r < Z n ; ) r r = $ n [ i r + + ] , t r [ o r + + ] = r r > > > 0 & 2 5 5 , n r & & ( t r [ o r + + ] = r r > > > 1 6 & 2 5 5 , r r = $ n [ i r + + ] , t r [ o r + + ] = r r > > > 0 & 2 5 5 ) , e r [ u r + + ] = r r > > > 1 6 & 2 5 5 ; z n = 8 } G n ! = = T n . i m a g e _ c o m p r e s s i o n . N O N E ? ( Q n = U n ( t r , K n . w i d t h * K n . c o l o r s , K n . c o l o r s , G n ) , J n = U n ( e r , K n . w i d t h , 1 , G n ) ) : ( Q n = t r , J n = e r , a r = v o i d 0 ) } i f ( 3 = = = K n . c o l o r T y p e & & ( V n = t h i s . c o l o r _ s p a c e s . I N D E X E D , Y n = K n . p a l e t t e , K n . t r a n s p a r e n c y . i n d e x e d ) ) { v a r d r = K n . t r a n s p a r e n c y . i n d e x e d , h r = 0 ; f o r ( i r = 0 , Z n = d r . l e n g t h ; i r < Z n ; + + i r ) h r + = d r [ i r ] ; i f ( ( h r / = 2 5 5 ) = = Z n - 1 & & - 1 ! = = d r . i n d e x O f ( 0 ) ) W n = [ d r . i n d e x O f ( 0 ) ] ; e l s e i f ( h r ! = = Z n ) { f o r ( $ n = K n . d e c o d e P i x e l s ( ) , e r = n e w U i n t 8 A r r a y ( $ n . l e n g t h ) , i r = 0 , Z n = $ n . l e n g t h ; i r < Z n ; i r + + ) e r [ i r ] = d r [ $ n [ i r ] ] ; J n = U n ( e r , K n . w i d t h , 1 ) } } v a r p r = f u n c t i o n ( U n ) { v a r Q n ; s w i t c h ( U n ) { c a s e T n . i m a g e _ c o m p r e s s i o n . F A S T : Q n = 1 1 ; b r e a k ; c a s e T n . i m a g e _ c o m p r e s s i o n . M E D I U M : Q n = 1 3 ; b r e a k ; c a s e T n . i m a g e _ c o m p r e s s i o n . S L O W : Q n = 1 4 ; b r e a k ; d e f a u l t : Q n = 1 2 } r e t u r n Q n } ( G n ) ; r e t u r n a r = = = t h i s . d e c o d e . F L A T E _ D E C O D E & & ( s r = " / P r e d i c t o r " + p r + " " ) , s r + = " / C o l o r s " + X n + " / B i t s P e r C o m p o n e n t " + z n + " / C o l u m n s " + K n . w i d t h , ( t h i s . _ _ a d d i m a g e _ _ . i s A r r a y B u f f e r ( Q n ) | | t h i s . _ _ a d d i m a g e _ _ . i s A r r a y B u f f e r V i e w ( Q n ) ) & & ( Q n = t h i s . _ _ a d d i m a g e _ _ . a r r a y B u f f e r T o B i n a r y S t r i n g ( Q n ) ) , ( J n & & t h i s .
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2018 Aras Abbasi
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { Tn . processBMP = function ( Un , Qn , Dn , Hn ) { var Gn = new Mt ( Un , ! 1 ) , Vn = Gn . width , zn = Gn . height , Kn = { data : Gn . getData ( ) , width : Vn , height : zn } , Wn = new Ot ( 100 ) . encode ( Kn , 100 ) ; return Tn . processJPEG . call ( this , Wn , Qn , Dn , Hn ) } } ( g . API ) , Et . prototype . getData = function ( ) { return this . data } ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2019 Aras Abbasi
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { Tn . processWEBP = function ( Un , Qn , Dn , Hn ) { var Gn = new Et ( Un , ! 1 ) , Vn = Gn . width , zn = Gn . height , Kn = { data : Gn . getData ( ) , width : Vn , height : zn } , Wn = new Ot ( 100 ) . encode ( Kn , 100 ) ; return Tn . processJPEG . call ( this , Wn , Qn , Dn , Hn ) } } ( g . API ) , g . API . setLanguage = function ( Tn ) { return void 0 === this . internal . languageSettings && ( this . internal . languageSettings = { } , this . internal . languageSettings . isSubscribed = ! 1 ) , void 0 !== { af : "Afrikaans" , sq : "Albanian" , ar : "Arabic (Standard)" , "ar-DZ" : "Arabic (Algeria)" , "ar-BH" : "Arabic (Bahrain)" , "ar-EG" : "Arabic (Egypt)" , "ar-IQ" : "Arabic (Iraq)" , "ar-JO" : "Arabic (Jordan)" , "ar-KW" : "Arabic (Kuwait)" , "ar-LB" : "Arabic (Lebanon)" , "ar-LY" : "Arabic (Libya)" , "ar-MA" : "Arabic (Morocco)" , "ar-OM" : "Arabic (Oman)" , "ar-QA" : "Arabic (Qatar)" , "ar-SA" : "Arabic (Saudi Arabia)" , "ar-SY" : "Arabic (Syria)" , "ar-TN" : "Arabic (Tunisia)" , "ar-AE" : "Arabic (U.A.E.)" , "ar-YE" : "Arabic (Yemen)" , an : "Aragonese" , hy : "Armenian" , as : "Assamese" , ast : "Asturian" , az : "Azerbaijani" , eu : "Basque" , be : "Belarusian" , bn : "Bengali" , bs : "Bosnian" , br : "Breton" , bg : "Bulgarian" , my : "Burmese" , ca : "Catalan" , ch : "Chamorro" , ce : "Chechen" , zh : "Chinese" , "zh-HK" : "Chinese (Hong Kong)" , "zh-CN" : "Chinese (PRC)" , "zh-SG" : "Chinese (Singapore)" , "zh-TW" : "Chinese (Taiwan)" , cv : "Chuvash" , co : "Corsican" , cr : "Cree" , hr : "Croatian" , cs : "Czech" , da : "Danish" , nl : "Dutch (Standard)" , "nl-BE" : "Dutch (Belgian)" , en : "English" , "en-AU" : "English (Australia)" , "en-BZ" : "English (Belize)" , "en-CA" : "English (Canada)" , "en-IE" : "English (Ireland)" , "en-JM" : "English (Jamaica)" , "en-NZ" : "English (New Zealand)" , "en-PH" : "English (Philippines)" , "en-ZA" : "English (South Africa)" , "en-TT" : "English (Trinidad & Tobago)" , "en-GB" : "English (United Kingdom)" , "en-US" : "English (United States)" , "en-ZW" : "English (Zimbabwe)" , eo : "Esperanto" , et : "Estonian" , fo : "Faeroese" , fj : "Fijian" , fi : "Finnish" , fr : "French (Standard)" , "fr-BE" : "French (Belgium)" , "fr-CA" : "French (Canada)" , "fr-FR" : "French (France)" , "fr-LU" : "French (Luxembourg)" , "fr-MC" : "French (Monaco)" , "fr-CH" : "French (Switzerland)" , fy : "Frisian" , fur : "Friulian" , gd : "Gaelic (Scots)" , "gd-IE" : "Gaelic (Irish)" , gl : "Galacian" , ka : "Georgian" , de : "German (Standard)" , "de-AT" : "German (Austria)" , "de-DE" : "German (Germany)" , "de-LI" : "German (Liechtenstein)" , "de-LU" : "German (Luxembourg)" , "de-CH" : "German (Switzerland)" , el : "Greek" , gu : "Gujurati" , ht : "Haitian" , he : "Hebrew" , hi : "Hindi" , hu : "Hungarian" , is : "Icelandic" , id : "Indonesian" , iu : "Inuktitut" , ga : "Irish" , it : "Italian (Standard)" , "it-CH" : "Italian (Switzerland)" , ja : "Japanese" , kn : "Kannada" , ks : "Kashmiri" , kk : "Kazakh" , km : "Khmer" , ky : "Kirghiz" , tlh : "Klingon" , ko : "Korean" , "ko-KP" : "Korean (North Korea)" , "ko-KR" : "Korean (South Korea)" , la : "Latin" , lv : "Latvian" , lt : "Lithuanian" , lb : "Luxembourgish" , mk : "FYRO Macedonian" , ms : "Malay" , ml : "Malayalam" , mt : "Maltese" , mi : "Maori" , mr : "Marathi" , mo : "Moldavian" , nv : "Navajo" , ng : "Ndonga" , ne : "Nepali" , no : "Norwegian" , nb : "Norwegian (Bokmal)" , nn : "Norwegian (Nynorsk)" , oc : "Occitan" , or : "Oriya" , om : "Oromo" , fa : "Persian" , "fa-IR" : "Persian/Iran" , pl : "Polish" , pt : "Portuguese" , "pt-BR" : "Portuguese (Brazil)" , pa : "Punjabi" , "pa-IN" : "Punjabi (India)" , "pa-PK" : "Punjabi (Pakistan)" , qu : "Quechua" , rm : "Rhaeto-Romanic" , ro : "Romanian" , "ro-MO" : "Romanian (Moldavia)" , ru : "Russian" , "ru-MO" : "Russian (Moldavia)" , sz : "Sami (Lappish)" , sg : "Sango" , sa : "Sanskrit" , sc : "Sardinian" , sd : "Sindhi" , si : "Singhalese" , sr : "Serbian" , sk : "Slovak" , sl : "Slovenian" , so : "Somani" , sb : "Sorbian" , es : "Spanish" , "es-AR" : "Spanish (Argentina)" , "es-BO" : "Spanish (Bolivia)" , "es-CL" : "Spanish (Chile)" , "es-CO" : "Spanish (Colombia)" , "es-CR" : "Spanish (Costa Rica)" , "es-DO" : "Spanish (Dominican Republic)" , "es-EC" : "Spanish (Ecuador)" , "es-SV" : "Spanish (El Salvador)" , "es-GT" : "Spanish (Guatemala)" , "es-HN" : "Spanish (Honduras)" , "es-MX" : "Spanish (Mexico)" , "es-NI" : "Spanish (Nicaragua)" , "es-PA" : "Spanish (Panama)" , "es-PY" : "Spanish (Paraguay)" , "es-PE" : "Spanish (Peru)" , "es-PR" : "Spanish (Puerto Rico)" , "es-ES" : "Spanish (Spain)" , "es-UY" : "Spanish (Uruguay)" , "es-VE" : "Spanish (Venezuela)" , sx : "Sutu" , sw : "Swahili" , sv : "Swedish" , "sv-FI" : "Swedish (Finland)" , "sv-SV" : "Swedish (Sweden)" , ta : "Tamil" , tt : "Tatar" , te : "Teluga" , th : "Thai" , tig : "Tigre" , ts : "Tsonga" , tn : "Tswana" , tr : "Turkish" , tk : "Turkmen" , uk : "Ukrainian"
2020-09-04 20:34:30 +00:00
/ * * @ l i c e n s e
2020-09-08 23:35:47 +00:00
* MIT license .
* Copyright ( c ) 2012 Willow Systems Corporation , willow - systems . com
* 2014 Diego Casorran , https : //github.com/diegocr
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
* /
2020-09-19 14:20:30 +00:00
xm = g . API , Sm = xm . getCharWidthsArray = function ( Tn , Un ) { var Qn , Dn , Hn = ( Un = Un || { } ) . font || this . internal . getFont ( ) , Gn = Un . fontSize || this . internal . getFontSize ( ) , Vn = Un . charSpace || this . internal . getCharSpace ( ) , zn = Un . widths ? Un . widths : Hn . metadata . Unicode . widths , Kn = zn . fof ? zn . fof : 1 , Wn = Un . kerning ? Un . kerning : Hn . metadata . Unicode . kerning , Xn = Wn . fof ? Wn . fof : 1 , Yn = ! 1 !== Un . doKerning , Jn = 0 , $n = Tn . length , Zn = 0 , er = zn [ 0 ] || Kn , tr = [ ] ; for ( Qn = 0 ; Qn < $n ; Qn ++ ) Dn = Tn . charCodeAt ( Qn ) , "function" == typeof Hn . metadata . widthOfString ? tr . push ( ( Hn . metadata . widthOfGlyph ( Hn . metadata . characterToGlyph ( Dn ) ) + Vn * ( 1e3 / Gn ) || 0 ) / 1e3 ) : ( Jn = Yn && "object" == _typeof ( Wn [ Dn ] ) && ! isNaN ( parseInt ( Wn [ Dn ] [ Zn ] , 10 ) ) ? Wn [ Dn ] [ Zn ] / Xn : 0 , tr . push ( ( zn [ Dn ] || er ) / Kn + Jn ) ) , Zn = Dn ; return tr } , km = xm . getStringUnitWidth = function ( Tn , Un ) { var Qn = ( Un = Un || { } ) . fontSize || this . internal . getFontSize ( ) , Dn = Un . font || this . internal . getFont ( ) , Hn = Un . charSpace || this . internal . getCharSpace ( ) ; return xm . processArabic && ( Tn = xm . processArabic ( Tn ) ) , "function" == typeof Dn . metadata . widthOfString ? Dn . metadata . widthOfString ( Tn , Qn , Hn ) / Qn : Sm . apply ( this , arguments ) . reduce ( ( function ( Tn , Un ) { return Tn + Un } ) , 0 ) } , Cm = function Pt ( Tn , Un , Qn , Dn ) { for ( var Hn = [ ] , Gn = 0 , Vn = Tn . length , zn = 0 ; Gn !== Vn && zn + Un [ Gn ] < Qn ; ) zn += Un [ Gn ] , Gn ++ ; Hn . push ( Tn . slice ( 0 , Gn ) ) ; var Kn = Gn ; for ( zn = 0 ; Gn !== Vn ; ) zn + Un [ Gn ] > Dn && ( Hn . push ( Tn . slice ( Kn , Gn ) ) , zn = 0 , Kn = Gn ) , zn += Un [ Gn ] , Gn ++ ; return Kn !== Gn && Hn . push ( Tn . slice ( Kn , Gn ) ) , Hn } , Bm = function kt ( Tn , Un , Qn ) { Qn || ( Qn = { } ) ; var Dn , Hn , Gn , Vn , zn , Kn , Wn , Xn = [ ] , Yn = [ Xn ] , Jn = Qn . textIndent || 0 , $n = 0 , Zn = 0 , er = Tn . split ( " " ) , tr = Sm . apply ( this , [ " " , Qn ] ) [ 0 ] ; if ( Kn = - 1 === Qn . lineIndent ? er [ 0 ] . length + 2 : Qn . lineIndent || 0 ) { var nr = Array ( Kn ) . join ( " " ) , rr = [ ] ; er . map ( ( function ( Tn ) { ( Tn = Tn . split ( /\s*\n/ ) ) . length > 1 ? rr = rr . concat ( Tn . map ( ( function ( Tn , Un ) { return ( Un && Tn . length ? "\n" : "" ) + Tn } ) ) ) : rr . push ( Tn [ 0 ] ) } ) ) , er = rr , Kn = km . apply ( this , [ nr , Qn ] ) } for ( Gn = 0 , Vn = er . length ; Gn < Vn ; Gn ++ ) { var ir = 0 ; if ( Dn = er [ Gn ] , Kn && "\n" == Dn [ 0 ] && ( Dn = Dn . substr ( 1 ) , ir = 1 ) , Jn + $n + ( Zn = ( Hn = Sm . apply ( this , [ Dn , Qn ] ) ) . reduce ( ( function ( Tn , Un ) { return Tn + Un } ) , 0 ) ) > Un || ir ) { if ( Zn > Un ) { for ( zn = Cm . apply ( this , [ Dn , Hn , Un - ( Jn + $n ) , Un ] ) , Xn . push ( zn . shift ( ) ) , Xn = [ zn . pop ( ) ] ; zn . length ; ) Yn . push ( [ zn . shift ( ) ] ) ; Zn = Hn . slice ( Dn . length - ( Xn [ 0 ] ? Xn [ 0 ] . length : 0 ) ) . reduce ( ( function ( Tn , Un ) { return Tn + Un } ) , 0 ) } else Xn = [ Dn ] ; Yn . push ( Xn ) , Jn = Zn + Kn , $n = tr } else Xn . push ( Dn ) , Jn += $n + Zn , $n = tr } return Wn = Kn ? function ( Tn , Un ) { return ( Un ? nr : "" ) + Tn . join ( " " ) } : function ( Tn ) { return Tn . join ( " " ) } , Yn . map ( Wn ) } , xm . splitTextToSize = function ( Tn , Un , Qn ) { var Dn , Hn = ( Qn = Qn || { } ) . fontSize || this . internal . getFontSize ( ) , Gn = function ( Tn ) { if ( Tn . widths && Tn . kerning ) return { widths : Tn . widths , kerning : Tn . kerning } ; var Un = this . internal . getFont ( Tn . fontName , Tn . fontStyle ) ; return Un . metadata . Unicode ? { widths : Un . metadata . Unicode . widths || { 0 : 1 } , kerning : Un . metadata . Unicode . kerning || { } } : { font : Un . metadata , fontSize : this . internal . getFontSize ( ) , charSpace : this . internal . getCharSpace ( ) } } . call ( this , Qn ) ; Dn = Array . isArray ( Tn ) ? Tn : String ( Tn ) . split ( /\r?\n/ ) ; var Vn = 1 * this . internal . scaleFactor * Un / Hn ; Gn . textIndent = Qn . textIndent ? 1 * Qn . textIndent * this . internal . scaleFactor / Hn : 0 , Gn . lineIndent = Qn . lineIndent ; var zn , Kn , Wn = [ ] ; for ( zn = 0 , Kn = Dn . length ; zn < Kn ; zn ++ ) Wn = Wn . concat ( Bm . apply ( this , [ Dn [ zn ] , Vn , Gn ] ) ) ; return Wn } ,
2020-09-04 20:34:30 +00:00
/ * * @ l i c e n s e
2020-09-08 23:35:47 +00:00
jsPDF standard _fonts _metrics plugin
* Copyright ( c ) 2012 Willow Systems Corporation , willow - systems . com
* MIT license .
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { Tn . _ _fontmetrics _ _ = Tn . _ _fontmetrics _ _ || { } ; for ( var Un = "klmnopqrstuvwxyz" , Qn = { } , Dn = { } , Hn = 0 ; Hn < Un . length ; Hn ++ ) Qn [ Un [ Hn ] ] = "0123456789abcdef" [ Hn ] , Dn [ "0123456789abcdef" [ Hn ] ] = Un [ Hn ] ; var Gn = function a ( Tn ) { return "0x" + parseInt ( Tn , 10 ) . toString ( 16 ) } , Vn = Tn . _ _fontmetrics _ _ . compress = function ( Tn ) { var Un , Qn , Hn , zn , Kn = [ "{" ] ; for ( var Wn in Tn ) { if ( Un = Tn [ Wn ] , isNaN ( parseInt ( Wn , 10 ) ) ? Qn = "'" + Wn + "'" : ( Wn = parseInt ( Wn , 10 ) , Qn = ( Qn = Gn ( Wn ) . slice ( 2 ) ) . slice ( 0 , - 1 ) + Dn [ Qn . slice ( - 1 ) ] ) , "number" == typeof Un ) Un < 0 ? ( Hn = Gn ( Un ) . slice ( 3 ) , zn = "-" ) : ( Hn = Gn ( Un ) . slice ( 2 ) , zn = "" ) , Hn = zn + Hn . slice ( 0 , - 1 ) + Dn [ Hn . slice ( - 1 ) ] ; else { if ( "object" != _typeof ( Un ) ) throw new Error ( "Don't know what to do with value type " + _typeof ( Un ) + "." ) ; Hn = Vn ( Un ) } Kn . push ( Qn + Hn ) } return Kn . push ( "}" ) , Kn . join ( "" ) } , zn = Tn . _ _fontmetrics _ _ . uncompress = function ( Tn ) { if ( "string" != typeof Tn ) throw new Error ( "Invalid argument passed to uncompress." ) ; for ( var Un , Dn , Hn , Gn , Vn = { } , zn = 1 , Kn = Vn , Wn = [ ] , Xn = "" , Yn = "" , Jn = Tn . length - 1 , $n = 1 ; $n < Jn ; $n += 1 ) "'" == ( Gn = Tn [ $n ] ) ? Un ? ( Hn = Un . join ( "" ) , Un = void 0 ) : Un = [ ] : Un ? Un . push ( Gn ) : "{" == Gn ? ( Wn . push ( [ Kn , Hn ] ) , Kn = { } , Hn = void 0 ) : "}" == Gn ? ( ( Dn = Wn . pop ( ) ) [ 0 ] [ Dn [ 1 ] ] = Kn , Hn = void 0 , Kn = Dn [ 0 ] ) : "-" == Gn ? zn = - 1 : void 0 === Hn ? Qn . hasOwnProperty ( Gn ) ? ( Xn += Qn [ Gn ] , Hn = parseInt ( Xn , 16 ) * zn , zn = 1 , Xn = "" ) : Xn += Gn : Qn . hasOwnProperty ( Gn ) ? ( Yn += Qn [ Gn ] , Kn [ Hn ] = parseInt ( Yn , 16 ) * zn , zn = 1 , Hn = void 0 , Yn = "" ) : Yn += Gn ; return Vn } , Kn = { codePages : [ "WinAnsiEncoding" ] , WinAnsiEncoding : zn ( "{19m8n201n9q201o9r201s9l201t9m201u8m201w9n201x9o201y8o202k8q202l8r202m9p202q8p20aw8k203k8t203t8v203u9v2cq8s212m9t15m8w15n9w2dw9s16k8u16l9u17s9z17x8y17y9y}" ) } , Wn = { Unicode : { Courier : Kn , "Courier-Bold" : Kn , "Courier-BoldOblique" : Kn , "Courier-Oblique" : Kn , Helvetica : Kn , "Helvetica-Bold" : Kn , "Helvetica-BoldOblique" : Kn , "Helvetica-Oblique" : Kn , "Times-Roman" : Kn , "Times-Bold" : Kn , "Times-BoldItalic" : Kn , "Times-Italic" : Kn } } , Xn = { Unicode : { "Courier-Oblique" : zn ( "{'widths'{k3w'fof'6o}'kerning'{'fof'-6o}}" ) , "Times-BoldItalic" : zn ( "{'widths'{k3o2q4ycx2r201n3m201o6o201s2l201t2l201u2l201w3m201x3m201y3m2k1t2l2r202m2n2n3m2o3m2p5n202q6o2r1w2s2l2t2l2u3m2v3t2w1t2x2l2y1t2z1w3k3m3l3m3m3m3n3m3o3m3p3m3q3m3r3m3s3m203t2l203u2l3v2l3w3t3x3t3y3t3z3m4k5n4l4m4m4m4n4m4o4s4p4m4q4m4r4s4s4y4t2r4u3m4v4m4w3x4x5t4y4s4z4s5k3x5l4s5m4m5n3r5o3x5p4s5q4m5r5t5s4m5t3x5u3x5v2l5w1w5x2l5y3t5z3m6k2l6l3m6m3m6n2w6o3m6p2w6q2l6r3m6s3r6t1w6u1w6v3m6w1w6x4y6y3r6z3m7k3m7l3m7m2r7n2r7o1w7p3r7q2w7r4m7s3m7t2w7u2r7v2n7w1q7x2n7y3t202l3mcl4mal2ram3man3mao3map3mar3mas2lat4uau1uav3maw3way4uaz2lbk2sbl3t'fof'6obo2lbp3tbq3mbr1tbs2lbu1ybv3mbz3mck4m202k3mcm4mcn4mco4mcp4mcq5ycr4mcs4mct4mcu4mcv4mcw2r2m3rcy2rcz2rdl4sdm4sdn4sdo4sdp4sdq4sds4sdt4sdu4sdv4sdw4sdz3mek3mel3mem3men3meo3mep3meq4ser2wes2wet2weu2wev2wew1wex1wey1wez1wfl3rfm3mfn3mfo3mfp3mfq3mfr3tfs3mft3rfu3rfv3rfw3rfz2w203k6o212m6o2dw2l2cq2l3t3m3u2l17s3x19m3m}'kerning'{cl{4qu5kt5qt5rs17ss5ts}201s{201ss}201t{cks4lscmscnscoscpscls2wu2yu201ts}201x{2wu2yu}2k{201ts}2w{4qx5kx5ou5qx5rs17su5tu}2x{17su5tu5ou}2y{4qx5kx5ou5qx5rs17ss5ts}'fof'-6ofn{17sw5tw5ou5qw5rs}7t{cksclscmscnscoscps4ls}3u{17su5tu5os5qs}3v{17su5tu5os5qs}7p{17su5tu}ck{4qu5kt5qt5rs17ss5ts}4l{4qu5kt5qt5rs17ss5ts}cm{4qu5kt5qt5rs17ss5ts}cn{4qu5kt5qt5rs17ss5ts}co{4qu5kt5qt5rs17ss5ts}cp{4qu5kt5qt5rs17ss5ts}6l{4qu5ou5qw5rt17su5tu}5q{ckuclucmucnucoucpu4lu}5r{ckuclucmucnucoucpu4lu}7q{cksclscmscnscoscps4ls}6p{4qu5ou5qw5rt17sw5tw}ek{4qu5ou5qw5rt17su5tu}el{4qu5ou5qw5rt17su5tu}em{4qu5ou5qw5rt17su5tu}en{4qu5ou5qw5rt17su5tu}eo{4qu5ou5qw5rt17su5tu}ep{4qu5ou5qw5rt17su5tu}es{17ss5ts5qs4qu}et{4qu5ou5qw5rt17sw5tw}eu{4qu5ou5qw5rt17ss5ts}ev{17ss5ts5qs4qu}6z{17sw5tw5ou5qw5rs}fm{17sw5tw5ou5qw5rs}7n{201ts}fo{17sw5tw5ou5qw5rs}fp{17sw5tw5ou5qw5rs}fq{17sw5tw5ou5qw5rs}7r{cksclscmscnscoscps4ls}fs{17sw5tw5ou5qw5rs}ft{17su5tu}fu{17su5tu}fv{17su5tu}fw{17su5tu}fz{cksclscmscnscoscps4ls}}}" ) , "Helvetica-Bold" : zn ( " { 'widths' { k3s2q4scx1w201n3r201o6o201s1w201t1w201u1w201w3m201x3m201y3m2k1w2l2l202m2n2n3r2o3r2p5t202q6o2r1s2s2l2t2l2u2r2v3u2w1w2x2l2y1w2z1w3k3r3l3r3m3r3n3r3o3r3p3r3q3r3r3r3s3r203t2l203u2l3v2l3w3u3x3u3y3u3z3x4k6l4l4s4m4s4n4s4o4s4p4m4q3x4r4y4s4s4t1w4u3r4v4s4w3x4x5n4y4s4z4y5k4m5l4y5m4s5n4m5o3x5p4s5q4m5r5y5s4m5t4m5u3x5v2l5w1w5x2l5y3u5z3r6k2l6l3r6m3x6n3r6o3x6p3r6q2l6r3x6s3x6t1w6u1w6v3r
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-18 20:43:34 +00:00
function ( Tn ) { var Un = function e ( Tn ) { for ( var e = Tn . length , Un = new Uint8Array ( e ) , Qn = 0 ; Qn < e ; Qn ++ ) Un [ Qn ] = Tn . charCodeAt ( Qn ) ; return Un } ; Tn . API . events . push ( [ "addFont" , function ( Qn ) { var Dn = void 0 , Hn = Qn . font , Gn = Qn . instance ; if ( ! Hn . isStandardFont ) { if ( void 0 === Gn ) throw new Error ( "Font does not exist in vFS, import fonts or remove declaration doc.addFont('" + Hn . postScriptName + "')." ) ; if ( "string" != typeof ( Dn = ! 1 === Gn . existsFileInVFS ( Hn . postScriptName ) ? Gn . loadFile ( Hn . postScriptName ) : Gn . getFileFromVFS ( Hn . postScriptName ) ) ) throw new Error ( "Font is not stored as string-data in vFS, import fonts or remove declaration doc.addFont('" + Hn . postScriptName + "')." ) ; ! function ( Qn , Dn ) { Dn = /^\x00\x01\x00\x00/ . test ( Dn ) ? Un ( Dn ) : Un ( _g ( Dn ) ) , Qn . metadata = Tn . API . TTFFont . open ( Dn ) , Qn . metadata . Unicode = Qn . metadata . Unicode || { encoding : { } , kerning : { } , widths : [ ] } , Qn . metadata . glyIdsUsed = [ 0 ] } ( Hn , Dn ) } } ] ) } ( g ) ,
2020-09-04 20:34:30 +00:00
/ * * @ l i c e n s e
2020-09-08 23:35:47 +00:00
* Copyright ( c ) 2012 Willow Systems Corporation , willow - systems . com
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { function r ( ) { return ( gg . canvg ? Promise . resolve ( gg . canvg ) : Promise . resolve ( ) . then ( ( function ( ) { return _b } ) ) ) . catch ( ( function ( Tn ) { return Promise . reject ( new Error ( "Could not load dompurify: " + Tn ) ) } ) ) . then ( ( function ( Tn ) { return Tn . default ? Tn . default : Tn } ) ) } g . API . addSvgAsImage = function ( Tn , Un , Qn , Dn , Hn , Gn , Vn , zn ) { if ( isNaN ( Un ) || isNaN ( Qn ) ) throw mg . error ( "jsPDF.addSvgAsImage: Invalid coordinates" , arguments ) , new Error ( "Invalid coordinates passed to jsPDF.addSvgAsImage" ) ; if ( isNaN ( Dn ) || isNaN ( Hn ) ) throw mg . error ( "jsPDF.addSvgAsImage: Invalid measurements" , arguments ) , new Error ( "Invalid measurements (width and/or height) passed to jsPDF.addSvgAsImage" ) ; var Kn = document . createElement ( "canvas" ) ; Kn . width = Dn , Kn . height = Hn ; var Wn = Kn . getContext ( "2d" ) ; Wn . fillStyle = "#fff" , Wn . fillRect ( 0 , 0 , Kn . width , Kn . height ) ; var Xn = { ignoreMouse : ! 0 , ignoreAnimation : ! 0 , ignoreDimensions : ! 0 } , Yn = this ; return r ( ) . then ( ( function ( Un ) { return Un . Canvg . fromString ( Wn , Tn , Xn ) } ) , ( function ( ) { return Promise . reject ( new Error ( "Could not load canvg." ) ) } ) ) . then ( ( function ( Tn ) { return Tn . render ( Xn ) } ) ) . then ( ( function ( ) { Yn . addImage ( Kn . toDataURL ( "image/jpeg" , 1 ) , Un , Qn , Dn , Hn , Vn , zn ) } ) ) } } ( ) , g . API . putTotalPages = function ( Tn ) { var Un , Qn = 0 ; parseInt ( this . internal . getFont ( ) . id . substr ( 1 ) , 10 ) < 15 ? ( Un = new RegExp ( Tn , "g" ) , Qn = this . internal . getNumberOfPages ( ) ) : ( Un = new RegExp ( this . pdfEscape16 ( Tn , this . internal . getFont ( ) ) , "g" ) , Qn = this . pdfEscape16 ( this . internal . getNumberOfPages ( ) + "" , this . internal . getFont ( ) ) ) ; for ( var Dn = 1 ; Dn <= this . internal . getNumberOfPages ( ) ; Dn ++ ) for ( var Hn = 0 ; Hn < this . internal . pages [ Dn ] . length ; Hn ++ ) this . internal . pages [ Dn ] [ Hn ] = this . internal . pages [ Dn ] [ Hn ] . replace ( Un , Qn ) ; return this } , g . API . viewerPreferences = function ( Tn , Un ) { var Qn ; Tn = Tn || { } , Un = Un || ! 1 ; var Dn , Hn , Gn , Vn = { HideToolbar : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.3 } , HideMenubar : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.3 } , HideWindowUI : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.3 } , FitWindow : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.3 } , CenterWindow : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.3 } , DisplayDocTitle : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.4 } , NonFullScreenPageMode : { defaultValue : "UseNone" , value : "UseNone" , type : "name" , explicitSet : ! 1 , valueSet : [ "UseNone" , "UseOutlines" , "UseThumbs" , "UseOC" ] , pdfVersion : 1.3 } , Direction : { defaultValue : "L2R" , value : "L2R" , type : "name" , explicitSet : ! 1 , valueSet : [ "L2R" , "R2L" ] , pdfVersion : 1.3 } , ViewArea : { defaultValue : "CropBox" , value : "CropBox" , type : "name" , explicitSet : ! 1 , valueSet : [ "MediaBox" , "CropBox" , "TrimBox" , "BleedBox" , "ArtBox" ] , pdfVersion : 1.4 } , ViewClip : { defaultValue : "CropBox" , value : "CropBox" , type : "name" , explicitSet : ! 1 , valueSet : [ "MediaBox" , "CropBox" , "TrimBox" , "BleedBox" , "ArtBox" ] , pdfVersion : 1.4 } , PrintArea : { defaultValue : "CropBox" , value : "CropBox" , type : "name" , explicitSet : ! 1 , valueSet : [ "MediaBox" , "CropBox" , "TrimBox" , "BleedBox" , "ArtBox" ] , pdfVersion : 1.4 } , PrintClip : { defaultValue : "CropBox" , value : "CropBox" , type : "name" , explicitSet : ! 1 , valueSet : [ "MediaBox" , "CropBox" , "TrimBox" , "BleedBox" , "ArtBox" ] , pdfVersion : 1.4 } , PrintScaling : { defaultValue : "AppDefault" , value : "AppDefault" , type : "name" , explicitSet : ! 1 , valueSet : [ "AppDefault" , "None" ] , pdfVersion : 1.6 } , Duplex : { defaultValue : "" , value : "none" , type : "name" , explicitSet : ! 1 , valueSet : [ "Simplex" , "DuplexFlipShortEdge" , "DuplexFlipLongEdge" , "none" ] , pdfVersion : 1.7 } , PickTrayByPDFSize : { defaultValue : ! 1 , value : ! 1 , type : "boolean" , explicitSet : ! 1 , valueSet : [ ! 0 , ! 1 ] , pdfVersion : 1.7 } , PrintPageRange : { defaultValue : "" , value : "" , type : "array" , explicitSet : ! 1 , valueSet : null , pdfVersion : 1.7 } , NumCopies : { defaultValue : 1 , value : 1 , type : "integer" , explicitSet : ! 1 , valueSet : null , pdfVersion : 1.7 } } , zn = Object . keys ( Vn ) , Kn = [ ] , Wn = 0 , Xn = 0 , Yn = 0 ; function f ( Tn , Un ) { var Qn , Dn = ! 1 ; for ( Qn = 0 ; Qn < Tn . length ; Qn += 1 ) Tn [ Qn ] === Un && ( Dn = ! 0 ) ; return Dn } if ( void 0 === this . internal . viewerpreferences && ( this . internal . viewerpreferences = { } , this . internal . viewerpreferences . configuration = JSON . parse ( JSON . stringify ( Vn ) ) , this . int
2020-09-04 20:34:30 +00:00
/ * * = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
2020-09-08 23:35:47 +00:00
* @ license
* jsPDF XMP metadata plugin
* Copyright ( c ) 2016 Jussi Utunen , u - jussi @ suomi24 . fi
*
* Permission is hereby granted , free of charge , to any person obtaining
* a copy of this software and associated documentation files ( the
* "Software" ) , to deal in the Software without restriction , including
* without limitation the rights to use , copy , modify , merge , publish ,
* distribute , sublicense , and / or sell copies of the Software , and to
* permit persons to whom the Software is furnished to do so , subject to
* the following conditions :
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software .
*
* THE SOFTWARE IS PROVIDED "AS IS" , WITHOUT WARRANTY OF ANY KIND ,
* EXPRESS OR IMPLIED , INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY , FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT . IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM , DAMAGES OR OTHER LIABILITY , WHETHER IN AN ACTION
* OF CONTRACT , TORT OR OTHERWISE , ARISING FROM , OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE .
* === === === === === === === === === === === === === === === === === === === === === === ==
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { var Un = function e ( ) { var Tn = '<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><rdf:Description rdf:about="" xmlns:jspdf="' + this . internal . _ _metadata _ _ . namespaceuri + '"><jspdf:metadata>' , e = unescape ( encodeURIComponent ( '<x:xmpmeta xmlns:x="adobe:ns:meta/">' ) ) , Un = unescape ( encodeURIComponent ( Tn ) ) , Qn = unescape ( encodeURIComponent ( this . internal . _ _metadata _ _ . metadata ) ) , Dn = unescape ( encodeURIComponent ( "</jspdf:metadata></rdf:Description></rdf:RDF>" ) ) , Hn = unescape ( encodeURIComponent ( "</x:xmpmeta>" ) ) , Gn = Un . length + Qn . length + Dn . length + e . length + Hn . length ; this . internal . _ _metadata _ _ . metadata _object _number = this . internal . newObject ( ) , this . internal . write ( "<< /Type /Metadata /Subtype /XML /Length " + Gn + " >>" ) , this . internal . write ( "stream" ) , this . internal . write ( e + Un + Qn + Dn + Hn ) , this . internal . write ( "endstream" ) , this . internal . write ( "endobj" ) } , Qn = function n ( ) { this . internal . _ _metadata _ _ . metadata _object _number && this . internal . write ( "/Metadata " + this . internal . _ _metadata _ _ . metadata _object _number + " 0 R" ) } ; Tn . addMetadata = function ( Tn , Dn ) { return void 0 === this . internal . _ _metadata _ _ && ( this . internal . _ _metadata _ _ = { metadata : Tn , namespaceuri : Dn || "http://jspdf.default.namespaceuri/" } , this . internal . events . subscribe ( "putCatalog" , Qn ) , this . internal . events . subscribe ( "postPutResources" , Un ) ) , this } } ( g . API ) , function ( Tn ) { var Un = Tn . API , Qn = Un . pdfEscape16 = function ( Tn , Un ) { for ( var Qn , Dn = Un . metadata . Unicode . widths , Hn = [ "" , "0" , "00" , "000" , "0000" ] , Gn = [ "" ] , Vn = 0 , zn = Tn . length ; Vn < zn ; ++ Vn ) { if ( Qn = Un . metadata . characterToGlyph ( Tn . charCodeAt ( Vn ) ) , Un . metadata . glyIdsUsed . push ( Qn ) , Un . metadata . toUnicode [ Qn ] = Tn . charCodeAt ( Vn ) , - 1 == Dn . indexOf ( Qn ) && ( Dn . push ( Qn ) , Dn . push ( [ parseInt ( Un . metadata . widthOfGlyph ( Qn ) , 10 ) ] ) ) , "0" == Qn ) return Gn . join ( "" ) ; Qn = Qn . toString ( 16 ) , Gn . push ( Hn [ 4 - Qn . length ] , Qn ) } return Gn . join ( "" ) } , Dn = function r ( Tn ) { var Un , Qn , r , Dn , Hn , Gn , Vn ; for ( Hn = "/CIDInit /ProcSet findresource begin\n12 dict begin\nbegincmap\n/CIDSystemInfo <<\n /Registry (Adobe)\n /Ordering (UCS)\n /Supplement 0\n>> def\n/CMapName /Adobe-Identity-UCS def\n/CMapType 2 def\n1 begincodespacerange\n<0000><ffff>\nendcodespacerange" , r = [ ] , Gn = 0 , Vn = ( Qn = Object . keys ( Tn ) . sort ( ( function ( Tn , Un ) { return Tn - Un } ) ) ) . length ; Gn < Vn ; Gn ++ ) Un = Qn [ Gn ] , r . length >= 100 && ( Hn += "\n" + r . length + " beginbfchar\n" + r . join ( "\n" ) + "\nendbfchar" , r = [ ] ) , void 0 !== Tn [ Un ] && null !== Tn [ Un ] && "function" == typeof Tn [ Un ] . toString && ( Dn = ( "0000" + Tn [ Un ] . toString ( 16 ) ) . slice ( - 4 ) , Un = ( "0000" + ( + Un ) . toString ( 16 ) ) . slice ( - 4 ) , r . push ( "<" + Un + "><" + Dn + ">" ) ) ; return r . length && ( Hn += "\n" + r . length + " beginbfchar\n" + r . join ( "\n" ) + "\nendbfchar\n" ) , Hn + "endcmap\nCMapName currentdict /CMap defineresource pop\nend\nend" } ; Un . events . push ( [ "putFont" , function ( Un ) { ! function ( Un ) { var Qn = Un . font , Hn = Un . out , Gn = Un . newObject , Vn = Un . putStream , zn = Un . pdfEscapeWithNeededParanthesis ; if ( Qn . metadata instanceof Tn . API . TTFFont && "Identity-H" === Qn . encoding ) { for ( var Kn = Qn . metadata . Unicode . widths , Wn = Qn . metadata . subset . encode ( Qn . metadata . glyIdsUsed , 1 ) , Xn = "" , Yn = 0 ; Yn < Wn . length ; Yn ++ ) Xn += String . fromCharCode ( Wn [ Yn ] ) ; var Jn = Gn ( ) ; Vn ( { data : Xn , addLength1 : ! 0 } ) , Hn ( "endobj" ) ; var $n = Gn ( ) ; Vn ( { data : Dn ( Qn . metadata . toUnicode ) , addLength1 : ! 0 } ) , Hn ( "endobj" ) ; var Zn = Gn ( ) ; Hn ( "<<" ) , Hn ( "/Type /FontDescriptor" ) , Hn ( "/FontName /" + zn ( Qn . fontName ) ) , Hn ( "/FontFile2 " + Jn + " 0 R" ) , Hn ( "/FontBBox " + Tn . API . PDFObject . convert ( Qn . metadata . bbox ) ) , Hn ( "/Flags " + Qn . metadata . flags ) , Hn ( "/StemV " + Qn . metadata . stemV ) , Hn ( "/ItalicAngle " + Qn . metadata . italicAngle ) , Hn ( "/Ascent " + Qn . metadata . ascender ) , Hn ( "/Descent " + Qn . metadata . decender ) , Hn ( "/CapHeight " + Qn . metadata . capHeight ) , Hn ( ">>" ) , Hn ( "endobj" ) ; var er = Gn ( ) ; Hn ( "<<" ) , Hn ( "/Type /Font" ) , Hn ( "/BaseFont /" + zn ( Qn . fontName ) ) , Hn ( "/FontDescriptor " + Zn + " 0 R" ) , Hn ( "/W " + Tn . API . PDFObject . convert ( Kn ) ) , Hn ( "/CIDToGIDMap /Identity" ) , Hn ( "/DW 1000" ) , Hn ( "/Subtype /CIDFontType2" ) , Hn ( "/CIDSystemInfo" ) , Hn ( "<<" ) , Hn ( "/Supplement 0" ) , Hn ( "/Registry (Adobe)" ) , Hn ( "/Ordering (" + Qn . encoding + ")" ) , Hn ( ">>" ) , Hn ( ">>" ) , Hn ( "endobj" ) , Qn . objectNumber = Gn ( ) , Hn ( "<<" ) , Hn ( "/Type /Font" ) , Hn ( "/Subtype /Type0" ) , Hn ( "/ToUnicode " + $n + " 0 R" ) , Hn ( "/BaseFont /" + zn ( Qn . fontName ) ) , Hn ( "/Encoding /" + Qn . encoding ) , Hn ( "/DescendantFonts [" + er + " 0 R]" ) , Hn ( ">>" ) , Hn ( "endobj" ) , Qn . i
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* jsPDF virtual FileSystem functionality
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-18 20:43:34 +00:00
function ( Tn ) { var Un = function e ( ) { return void 0 === this . internal . vFS && ( this . internal . vFS = { } ) , ! 0 } ; Tn . existsFileInVFS = function ( Tn ) { return Un . call ( this ) , void 0 !== this . internal . vFS [ Tn ] } , Tn . addFileToVFS = function ( Tn , Qn ) { return Un . call ( this ) , this . internal . vFS [ Tn ] = Qn , this } , Tn . getFileFromVFS = function ( Tn ) { return Un . call ( this ) , void 0 !== this . internal . vFS [ Tn ] ? this . internal . vFS [ Tn ] : null } } ( g . API ) ,
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Unicode Bidi Engine based on the work of Alex Shensis ( @ asthensis )
* MIT License
* /
2020-09-19 14:20:30 +00:00
function ( Tn ) { Tn . _ _bidiEngine _ _ = Tn . prototype . _ _bidiEngine _ _ = function ( Tn ) { var Qn , Dn , Hn , Gn , Vn , zn , Kn , Wn = Un , Xn = [ [ 0 , 3 , 0 , 1 , 0 , 0 , 0 ] , [ 0 , 3 , 0 , 1 , 2 , 2 , 0 ] , [ 0 , 3 , 0 , 17 , 2 , 0 , 1 ] , [ 0 , 3 , 5 , 5 , 4 , 1 , 0 ] , [ 0 , 3 , 21 , 21 , 4 , 0 , 1 ] , [ 0 , 3 , 5 , 5 , 4 , 2 , 0 ] ] , Yn = [ [ 2 , 0 , 1 , 1 , 0 , 1 , 0 ] , [ 2 , 0 , 1 , 1 , 0 , 2 , 0 ] , [ 2 , 0 , 2 , 1 , 3 , 2 , 0 ] , [ 2 , 0 , 2 , 33 , 3 , 1 , 1 ] ] , Jn = { L : 0 , R : 1 , EN : 2 , AN : 3 , N : 4 , B : 5 , S : 6 } , $n = { 0 : 0 , 5 : 1 , 6 : 2 , 7 : 3 , 32 : 4 , 251 : 5 , 254 : 6 , 255 : 7 } , Zn = [ "(" , ")" , "(" , "<" , ">" , "<" , "[" , "]" , "[" , "{" , "}" , "{" , "«" , "»" , "«" , "‹ , "› , "‹ , "⁅" , "⁆" , "⁅" , "⁽" , "⁾" , "⁽" , "₍" , "₎" , "₍" , "≤" , "≥" , "≤" , "〈" , "〉" , "〈" , "﹙" , "﹚" , "﹙" , "﹛" , "﹜" , "﹛" , "﹝" , "﹞" , "﹝" , "﹤" , "﹥" , "﹤" ] , er = new RegExp ( /^([1-4|9]|1[0-9]|2[0-9]|3[0168]|4[04589]|5[012]|7[78]|159|16[0-9]|17[0-2]|21[569]|22[03489]|250)$/ ) , tr = ! 1 , nr = 0 ; this . _ _bidiEngine _ _ = { } ; var rr = function b ( Tn ) { var Un = Tn . charCodeAt ( ) , Qn = Un >> 8 , Dn = $n [ Qn ] ; return void 0 !== Dn ? Wn [ 256 * Dn + ( 255 & Un ) ] : 252 === Qn || 253 === Qn ? "AL" : er . test ( Qn ) ? "L" : 8 === Qn ? "R" : "N" } , ir = function y ( Tn ) { for ( var Un , Qn = 0 ; Qn < Tn . length ; Qn ++ ) { if ( "L" === ( Un = rr ( Tn . charAt ( Qn ) ) ) ) return ! 1 ; if ( "R" === Un ) return ! 0 } return ! 1 } , or = function w ( Tn , Un , Vn , zn ) { var Kn , Wn , Xn , Yn , Jn = Un [ zn ] ; switch ( Jn ) { case "L" : case "R" : tr = ! 1 ; break ; case "N" : case "AN" : break ; case "EN" : tr && ( Jn = "AN" ) ; break ; case "AL" : tr = ! 0 , Jn = "R" ; break ; case "WS" : Jn = "N" ; break ; case "CS" : zn < 1 || zn + 1 >= Un . length || "EN" !== ( Kn = Vn [ zn - 1 ] ) && "AN" !== Kn || "EN" !== ( Wn = Un [ zn + 1 ] ) && "AN" !== Wn ? Jn = "N" : tr && ( Wn = "AN" ) , Jn = Wn === Kn ? Wn : "N" ; break ; case "ES" : Jn = "EN" === ( Kn = zn > 0 ? Vn [ zn - 1 ] : "B" ) && zn + 1 < Un . length && "EN" === Un [ zn + 1 ] ? "EN" : "N" ; break ; case "ET" : if ( zn > 0 && "EN" === Vn [ zn - 1 ] ) { Jn = "EN" ; break } if ( tr ) { Jn = "N" ; break } for ( Xn = zn + 1 , Yn = Un . length ; Xn < Yn && "ET" === Un [ Xn ] ; ) Xn ++ ; Jn = Xn < Yn && "EN" === Un [ Xn ] ? "EN" : "N" ; break ; case "NSM" : if ( Hn && ! Gn ) { for ( Yn = Un . length , Xn = zn + 1 ; Xn < Yn && "NSM" === Un [ Xn ] ; ) Xn ++ ; if ( Xn < Yn ) { var $n = Tn [ zn ] , Zn = $n >= 1425 && $n <= 2303 || 64286 === $n ; if ( Kn = Un [ Xn ] , Zn && ( "R" === Kn || "AL" === Kn ) ) { Jn = "R" ; break } } } Jn = zn < 1 || "B" === ( Kn = Un [ zn - 1 ] ) ? "N" : Vn [ zn - 1 ] ; break ; case "B" : tr = ! 1 , Qn = ! 0 , Jn = nr ; break ; case "S" : Dn = ! 0 , Jn = "N" ; break ; case "LRE" : case "RLE" : case "LRO" : case "RLO" : case "PDF" : tr = ! 1 ; break ; case "BN" : Jn = "N" } return Jn } , ar = function N ( Tn , Un , Qn ) { var Dn = Tn . split ( "" ) ; return Qn && sr ( Dn , Qn , { hiLevel : nr } ) , Dn . reverse ( ) , Un && Un . reverse ( ) , Dn . join ( "" ) } , sr = function L ( Tn , Un , Hn ) { var Gn , Vn , zn , Kn , Wn , $n = - 1 , Zn = Tn . length , er = 0 , ir = [ ] , ar = nr ? Yn : Xn , L = [ ] ; for ( tr = ! 1 , Qn = ! 1 , Dn = ! 1 , Vn = 0 ; Vn < Zn ; Vn ++ ) L [ Vn ] = rr ( Tn [ Vn ] ) ; for ( zn = 0 ; zn < Zn ; zn ++ ) { if ( Wn = er , ir [ zn ] = or ( Tn , L , ir , zn ) , Gn = 240 & ( er = ar [ Wn ] [ Jn [ ir [ zn ] ] ] ) , er &= 15 , Un [ zn ] = Kn = ar [ er ] [ 5 ] , Gn > 0 ) if ( 16 === Gn ) { for ( Vn = $n ; Vn < zn ; Vn ++ ) Un [ Vn ] = 1 ; $n = - 1 } else $n = - 1 ; if ( ar [ er ] [ 6 ] ) - 1 === $n && ( $n = zn ) ; else if ( $n > - 1 ) { for ( Vn = $n ; Vn < zn ; Vn ++ ) Un [ Vn ] = Kn ; $n = - 1 } "B" === L [ zn ] && ( Un [ zn ] = 0 ) , Hn . hiLevel |= Kn } Dn && function ( Tn , Un , Qn ) { for ( var Dn = 0 ; Dn < Qn ; Dn ++ ) if ( "S" === Tn [ Dn ] ) { Un [ Dn ] = nr ; for ( var Hn = Dn - 1 ; Hn >= 0 && "WS" === Tn [ Hn ] ; Hn -- ) Un [ Hn ] = nr } } ( L , Un , Zn ) } , lr = function x ( Tn , Un , Dn , Hn , Gn ) { if ( ! ( Gn . hiLevel < Tn ) ) { if ( 1 === Tn && 1 === nr && ! Qn ) return Un . reverse ( ) , void ( Dn && Dn . reverse ( ) ) ; for ( var Vn , zn , Kn , Wn , Xn = Un . length , Yn = 0 ; Yn < Xn ; ) { if ( Hn [ Yn ] >= Tn ) { for ( Kn = Yn + 1 ; Kn < Xn && Hn [ Kn ] >= Tn ; ) Kn ++ ; for ( Wn = Yn , zn = Kn - 1 ; Wn < zn ; Wn ++ , zn -- ) Vn = Un [ Wn ] , Un [ Wn ] = Un [ zn ] , Un [ zn ] = Vn , Dn && ( Vn = Dn [ Wn ] , Dn [ Wn ] = Dn [ zn ] , Dn [ zn ] = Vn ) ; Yn = Kn } Yn ++ } } } , cr = function A ( Tn , Un , Qn ) { var Dn = Tn . split ( "" ) , Hn = { hiLevel : nr } ; return Qn || ( Qn = [ ] ) , sr ( Dn , Qn , Hn ) , function ( Tn , Un , Qn ) { if ( 0 !== Qn . hiLevel && Kn ) for ( var Dn , Hn = 0 ; Hn < Tn . length ; Hn ++ ) 1 === Un [ Hn ] && ( Dn = Zn . indexOf ( Tn [ Hn ] ) ) >= 0 && ( Tn [ Hn ] = Zn [ Dn + 1 ] ) } ( Dn , Qn , Hn ) , lr ( 2 , Dn , Un , Qn , Hn ) , lr ( 1 , Dn , Un , Qn , Hn ) , Dn . join ( "" ) } ; return this . _ _bidiEngine _ _ . doBidiReorder = function ( Tn , Un , Qn ) { if ( function ( Tn , Un ) { if ( Un ) for ( var Qn = 0 ; Qn < Tn . length ; Qn ++ ) Un [ Qn ] = Qn ; void 0 === Gn && ( Gn = ir ( Tn ) ) , void 0 === zn && ( zn = ir ( Tn ) ) } ( Tn , Un ) , Hn || ! Vn || zn ) if ( Hn && Vn && Gn ^ zn ) nr = Gn ? 1 : 0 , Tn = ar ( Tn , Un , Qn ) ; else if ( ! Hn && Vn && zn ) nr = Gn ? 1 : 0 , Tn = cr ( Tn , Un , Qn ) , Tn = ar ( Tn , Un ) ; else if ( ! Hn || Gn || Vn || zn ) { if ( Hn && ! Vn && Gn ^ zn ) Tn = ar ( Tn , Un ) , Gn ? ( nr = 0 , Tn = cr ( Tn , Un , Qn ) ) : ( nr = 1 , Tn = cr ( Tn , Un , Qn ) , Tn = ar ( Tn , Un ) ) ; else if ( Hn && Gn && ! Vn && zn ) nr = 1 , Tn = cr ( Tn , Un , Qn ) , Tn = ar ( Tn , Un ) ; else if ( ! Hn && ! Vn && Gn ^ zn ) { var Dn = Kn ; Gn ? ( nr = 1 , Tn = cr ( Tn , Un , Qn ) , nr = 0 , Kn = ! 1 , Tn = cr ( Tn , Un , Qn ) , Kn = Dn ) : ( nr = 0 , Tn = cr ( Tn , Un , Qn ) , Tn = ar ( Tn , Un ) , nr = 1 , Kn = ! 1 , Tn = cr ( Tn , Un , Qn ) , Kn = Dn , Tn = ar ( Tn , Un ) ) } } else nr = 0 , Tn = cr ( Tn , Un , Qn ) ; else nr = Gn ? 1 : 0 , Tn = cr ( Tn , Un , Qn ) ; return Tn } , this . _ _bidiEngine _ _ . setOptions = function ( Tn ) { Tn && (
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ license
* Copyright ( c ) 2012 chick307 < chick307 @ gmail . com >
*
* Licensed under the MIT License .
* http : //opensource.org/licenses/mit-license
* /
2020-09-19 14:20:30 +00:00
function ( Tn , Un ) { Tn . API . adler32cs = function ( ) { var Tn , Un , Qn , Dn , Hn , Gn = "function" == typeof ArrayBuffer && "function" == typeof Uint8Array , Vn = null , zn = function ( ) { if ( ! Gn ) return function ( ) { return ! 1 } ; try { var Tn = { } ; "function" == typeof Tn . Buffer && ( Vn = Tn . Buffer ) } catch ( Tn ) { } return function ( Tn ) { return Tn instanceof ArrayBuffer || null !== Vn && Tn instanceof Vn } } ( ) , Kn = null !== Vn ? function ( Tn ) { return new Vn ( Tn , "utf8" ) . toString ( "binary" ) } : function ( Tn ) { return unescape ( encodeURIComponent ( Tn ) ) } , Wn = function i ( Tn , Un ) { for ( var Qn = 65535 & Tn , Dn = Tn >>> 16 , i = 0 , Hn = Un . length ; i < Hn ; i ++ ) Dn = ( Dn + ( Qn = ( Qn + ( 255 & Un . charCodeAt ( i ) ) ) % 65521 ) ) % 65521 ; return ( Dn << 16 | Qn ) >>> 0 } , Xn = function a ( Tn , Un ) { for ( var Qn = 65535 & Tn , Dn = Tn >>> 16 , Hn = 0 , a = Un . length ; Hn < a ; Hn ++ ) Dn = ( Dn + ( Qn = ( Qn + Un [ Hn ] ) % 65521 ) ) % 65521 ; return ( Dn << 16 | Qn ) >>> 0 } , Yn = { } , Jn = Yn . Adler32 = ( ( Hn = ( Dn = function l ( Tn ) { if ( ! ( this instanceof Dn ) ) throw new TypeError ( "Constructor cannot called be as a function." ) ; if ( ! isFinite ( Tn = null === Tn ? 1 : + Tn ) ) throw new Error ( "First arguments needs to be a finite number." ) ; this . checksum = Tn >>> 0 } ) . prototype = { } ) . constructor = Dn , Dn . from = ( ( Tn = function u ( Tn ) { if ( ! ( this instanceof Dn ) ) throw new TypeError ( "Constructor cannot called be as a function." ) ; if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; this . checksum = Wn ( 1 , Tn . toString ( ) ) } ) . prototype = Hn , Tn ) , Dn . fromUtf8 = ( ( Un = function c ( Tn ) { if ( ! ( this instanceof Dn ) ) throw new TypeError ( "Constructor cannot called be as a function." ) ; if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; var Un = Kn ( Tn . toString ( ) ) ; this . checksum = Wn ( 1 , Un ) } ) . prototype = Hn , Un ) , Gn && ( Dn . fromBuffer = ( ( Qn = function h ( Tn ) { if ( ! ( this instanceof Dn ) ) throw new TypeError ( "Constructor cannot called be as a function." ) ; if ( ! zn ( Tn ) ) throw new Error ( "First argument needs to be ArrayBuffer." ) ; var Un = new Uint8Array ( Tn ) ; return this . checksum = Xn ( 1 , Un ) } ) . prototype = Hn , Qn ) ) , Hn . update = function ( Tn ) { if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; return Tn = Tn . toString ( ) , this . checksum = Wn ( this . checksum , Tn ) } , Hn . updateUtf8 = function ( Tn ) { if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; var Un = Kn ( Tn . toString ( ) ) ; return this . checksum = Wn ( this . checksum , Un ) } , Gn && ( Hn . updateBuffer = function ( Tn ) { if ( ! zn ( Tn ) ) throw new Error ( "First argument needs to be ArrayBuffer." ) ; var Un = new Uint8Array ( Tn ) ; return this . checksum = Xn ( this . checksum , Un ) } ) , Hn . clone = function ( ) { return new Jn ( this . checksum ) } , Dn ) ; return Yn . from = function ( Tn ) { if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; return Wn ( 1 , Tn . toString ( ) ) } , Yn . fromUtf8 = function ( Tn ) { if ( null === Tn ) throw new Error ( "First argument needs to be a string." ) ; var Un = Kn ( Tn . toString ( ) ) ; return Wn ( 1 , Un ) } , Gn && ( Yn . fromBuffer = function ( Tn ) { if ( ! zn ( Tn ) ) throw new Error ( "First argument need to be ArrayBuffer." ) ; var Un = new Uint8Array ( Tn ) ; return Xn ( 1 , Un ) } ) , Yn } ( ) } ( g ) , _export ( { target : "Array" , proto : ! 0 , forced : cA !== [ ] . lastIndexOf } , { lastIndexOf : cA } ) , _export ( { target : "String" , proto : ! 0 , forced : stringHtmlForced ( "anchor" ) } , { anchor : function anchor ( Tn ) { return createHtml ( this , "a" , "name" , Tn ) } } ) ;
2020-09-04 20:34:30 +00:00
/*! https://mths.be/cssesc v3.0.0 by @mathias */
2020-09-19 14:20:30 +00:00
var $m = { } . hasOwnProperty , Zm = /[ -,\.\/:-@\[-\^`\{-~]/ , e _ = /[ -,\.\/:-@\[\]\^`\{-~]/ , t _ = /(^|\\+)?(\\[A-F0-9]{1,6})\x20(?![a-fA-F0-9\x20])/g , n _ = function cssesc ( Tn , Un ) { "single" != ( Un = function merge ( Tn , Un ) { if ( ! Tn ) return Un ; var Qn = { } ; for ( var Dn in Un ) Qn [ Dn ] = $m . call ( Tn , Dn ) ? Tn [ Dn ] : Un [ Dn ] ; return Qn } ( Un , cssesc . options ) ) . quotes && "double" != Un . quotes && ( Un . quotes = "single" ) ; for ( var Qn = "double" == Un . quotes ? '"' : "'" , Dn = Un . isIdentifier , Hn = Tn . charAt ( 0 ) , Gn = "" , Vn = 0 , zn = Tn . length ; Vn < zn ; ) { var Kn = Tn . charAt ( Vn ++ ) , Wn = Kn . charCodeAt ( ) , Xn = void 0 ; if ( Wn < 32 || Wn > 126 ) { if ( Wn >= 55296 && Wn <= 56319 && Vn < zn ) { var Yn = Tn . charCodeAt ( Vn ++ ) ; 56320 == ( 64512 & Yn ) ? Wn = ( ( 1023 & Wn ) << 10 ) + ( 1023 & Yn ) + 65536 : Vn -- } Xn = "\\" + Wn . toString ( 16 ) . toUpperCase ( ) + " " } else Xn = Un . escapeEverything ? Zm . test ( Kn ) ? "\\" + Kn : "\\" + Wn . toString ( 16 ) . toUpperCase ( ) + " " : /[\t\n\f\r\x0B]/ . test ( Kn ) ? "\\" + Wn . toString ( 16 ) . toUpperCase ( ) + " " : "\\" == Kn || ! Dn && ( '"' == Kn && Qn == Kn || "'" == Kn && Qn == Kn ) || Dn && e _ . test ( Kn ) ? "\\" + Kn : Kn ; Gn += Xn } return Dn && ( /^-[-\d]/ . test ( Gn ) ? Gn = "\\-" + Gn . slice ( 1 ) : /\d/ . test ( Hn ) && ( Gn = "\\3" + Hn + " " + Gn . slice ( 1 ) ) ) , Gn = Gn . replace ( t _ , ( function ( Tn , Un , Qn ) { return Un && Un . length % 2 ? Tn : ( Un || "" ) + Qn } ) ) , ! Dn && Un . wrap ? Qn + Gn + Qn : Gn } ; n _ . options = { escapeEverything : ! 1 , isIdentifier : ! 1 , quotes : "single" , wrap : ! 1 } , n _ . version = "3.0.0" ; var r _ = n _ , i _ = /[a-z0-9_-]/i , o _ = /[\s\t]/ , a _ = function parse ( Tn ) { for ( var Un , Qn , Dn = ! 0 , Hn = 0 , Gn = "" , Vn = 0 , zn = [ ] ; ; ) { if ( Qn = Tn [ Vn ] , 0 === Hn ) { if ( ! Qn && Dn ) break ; if ( ! Qn && ! Dn ) throw new Error ( "Parse error" ) ; if ( '"' === Qn || "'" === Qn ) Un = Qn , Hn = 1 , Dn = ! 1 ; else if ( o _ . test ( Qn ) ) ; else { if ( ! i _ . test ( Qn ) ) throw new Error ( "Parse error" ) ; Hn = 3 , Dn = ! 1 , Vn -- } } else if ( 1 === Hn ) { if ( ! Qn ) throw new Error ( "Parse Error" ) ; "\\" === Qn ? Hn = 2 : Qn === Un ? ( zn . push ( Gn ) , Gn = "" , Hn = 4 ) : Gn += Qn } else if ( 2 === Hn ) { if ( Qn !== Un && "\\" !== Qn ) throw new Error ( "Parse error" ) ; Gn += Qn , Hn = 1 } else if ( 3 === Hn ) { if ( ! Qn ) { zn . push ( Gn ) ; break } if ( i _ . test ( Qn ) ) Gn += Qn ; else if ( "," === Qn ) zn . push ( Gn ) , Gn = "" , Hn = 0 ; else { if ( ! o _ . test ( Qn ) ) throw new Error ( "Parse error" ) ; Hn = 5 } } else if ( 5 === Hn ) { if ( ! Qn ) { zn . push ( Gn ) ; break } if ( i _ . test ( Qn ) ) Gn += " " + Qn , Hn = 3 ; else if ( "," === Qn ) zn . push ( Gn ) , Gn = "" , Hn = 0 ; else if ( ! o _ . test ( Qn ) ) throw new Error ( "Parse error" ) } else if ( 4 === Hn ) { if ( ! Qn ) break ; if ( "," === Qn ) Hn = 0 ; else if ( ! o _ . test ( Qn ) ) throw new Error ( "Parse error" ) } Vn ++ } return zn } , s _ = { a : 7 , c : 6 , h : 1 , l : 2 , m : 2 , r : 4 , q : 4 , s : 4 , t : 2 , v : 1 , z : 0 } , l _ = [ 5760 , 6158 , 8192 , 8193 , 8194 , 8195 , 8196 , 8197 , 8198 , 8199 , 8200 , 8201 , 8202 , 8239 , 8287 , 12288 , 65279 ] ; function isDigit ( Tn ) { return Tn >= 48 && Tn <= 57 } function State ( Tn ) { this . index = 0 , this . path = Tn , this . max = Tn . length , this . result = [ ] , this . param = 0 , this . err = "" , this . segmentStart = 0 , this . data = [ ] } function skipSpaces ( Tn ) { for ( ; Tn . index < Tn . max && ( 10 === ( Un = Tn . path . charCodeAt ( Tn . index ) ) || 13 === Un || 8232 === Un || 8233 === Un || 32 === Un || 9 === Un || 11 === Un || 12 === Un || 160 === Un || Un >= 5760 && l _ . indexOf ( Un ) >= 0 ) ; ) Tn . index ++ ; var Un } function scanFlag ( Tn ) { var Un = Tn . path . charCodeAt ( Tn . index ) ; return 48 === Un ? ( Tn . param = 0 , void Tn . index ++ ) : 49 === Un ? ( Tn . param = 1 , void Tn . index ++ ) : void ( Tn . err = "SvgPath: arc flag can be 0 or 1 only (at pos " + Tn . index + ")" ) } function scanParam ( Tn ) { var Un , Qn = Tn . index , Dn = Qn , Hn = Tn . max , Gn = ! 1 , Vn = ! 1 , zn = ! 1 , Kn = ! 1 ; if ( Dn >= Hn ) Tn . err = "SvgPath: missed param (at pos " + Dn + ")" ; else if ( 43 !== ( Un = Tn . path . charCodeAt ( Dn ) ) && 45 !== Un || ( Un = ++ Dn < Hn ? Tn . path . charCodeAt ( Dn ) : 0 ) , isDigit ( Un ) || 46 === Un ) { if ( 46 !== Un ) { if ( Gn = 48 === Un , Un = ++ Dn < Hn ? Tn . path . charCodeAt ( Dn ) : 0 , Gn && Dn < Hn && Un && isDigit ( Un ) ) return void ( Tn . err = "SvgPath: numbers started with `0` such as `09` are illegal (at pos " + Qn + ")" ) ; for ( ; Dn < Hn && isDigit ( Tn . path . charCodeAt ( Dn ) ) ; ) Dn ++ , Vn = ! 0 ; Un = Dn < Hn ? Tn . path . charCodeAt ( Dn ) : 0 } if ( 46 === Un ) { for ( Kn = ! 0 , Dn ++ ; isDigit ( Tn . path . charCodeAt ( Dn ) ) ; ) Dn ++ , zn = ! 0 ; Un = Dn < Hn ? Tn . path . charCodeAt ( Dn ) : 0 } if ( 101 === Un || 69 === Un ) { if ( Kn && ! Vn && ! zn ) return void ( Tn . err = "SvgPath: invalid float exponent (at pos " + Dn + ")" ) ; if ( 43 !== ( Un = ++ Dn < Hn ? Tn . path . charCodeAt ( Dn ) : 0 ) && 45 !== Un || Dn ++ , ! ( Dn < Hn && isDigit ( Tn . path . charCodeAt ( Dn ) ) ) ) return void ( Tn . err = "SvgPath: invalid float exponent (at pos " + Dn + ")" ) ; for ( ; Dn < Hn && isDigit ( Tn . path . charCodeAt ( Dn ) ) ; ) Dn ++ } Tn . index = Dn , Tn . param = parseFloat ( Tn . path . slice ( Qn , Dn ) ) + 0 } else Tn . err = "SvgPath: param should start with 0..9 or `.` (at pos " + Dn + ")" } function finalizeSegment ( Tn ) { var Un , Qn ; Qn = ( Un = Tn . path [ Tn . segmentStart ] ) . toLowerCase (
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ file jGraduate 0.4
*
* jQuery Plugin for a gradient picker
*
* @ module jGraduate
* @ copyright 2010 Jeff Schiller { @ link http : //blog.codedread.com/}, 2010 Alexis Deveria {@link http://a.deveria.com/}
*
* @ license Apache - 2.0
* @ example
* // The Paint object is described below.
* $ . jGraduate . Paint ( ) ; // constructs a 'none' color
* @ example $ . jGraduate . Paint ( { copy : o } ) ; // creates a copy of the paint o
* @ example $ . jGraduate . Paint ( { hex : '#rrggbb' } ) ; // creates a solid color paint with hex = "#rrggbb"
* @ example $ . jGraduate . Paint ( { linearGradient : o , a : 50 } ) ; // creates a linear gradient paint with opacity=0.5
* @ example $ . jGraduate . Paint ( { radialGradient : o , a : 7 } ) ; // creates a radial gradient paint with opacity=0.07
* @ example $ . jGraduate . Paint ( { hex : '#rrggbb' , linearGradient : o } ) ; // throws an exception?
* /
2020-09-19 14:20:30 +00:00
var _S = "http://www.w3.org/2000/svg" , vS = "http://www.w3.org/1999/xlink" ;
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* @ file jPicker ( Adapted from version 1.1 . 6 )
*
* jQuery Plugin for Photoshop style color picker
*
* @ module jPicker
* @ copyright ( c ) 2010 Christopher T . Tillman
* Digital Magic Productions , Inc . ( { @ link http : //www.digitalmagicpro.com/})
* FREE to use , alter , copy , sell , and especially ENHANCE
* @ license MIT
*
* Painstakingly ported from John Dyers ' excellent work on his own color picker based on the Prototype framework .
*
* John Dyers ' website : { @ link http : //johndyer.name}
* Color Picker page : { @ link http : //johndyer.name/photoshop-like-javascript-color-picker/}
* /
2020-09-19 14:20:30 +00:00
function toFixedNumeric ( Tn , Un ) { return void 0 === Un && ( Un = 0 ) , Math . round ( Tn * Math . pow ( 10 , Un ) ) / Math . pow ( 10 , Un ) } window . console || ( window . console = { log : function log ( Tn ) { } , dir : function dir ( Tn ) { } } ) ; var yS = function isNullish ( Tn ) { return null == Tn } ; function _ _variableDynamicImportRuntime0 _ _ ( Tn ) { switch ( Tn ) { case "./locale/lang.af.js" : return Promise . resolve ( ) . then ( ( function ( ) { return tk } ) ) ; case "./locale/lang.ar.js" : return Promise . resolve ( ) . then ( ( function ( ) { return nk } ) ) ; case "./locale/lang.az.js" : return Promise . resolve ( ) . then ( ( function ( ) { return rk } ) ) ; case "./locale/lang.be.js" : return Promise . resolve ( ) . then ( ( function ( ) { return ik } ) ) ; case "./locale/lang.bg.js" : return Promise . resolve ( ) . then ( ( function ( ) { return ok } ) ) ; case "./locale/lang.ca.js" : return Promise . resolve ( ) . then ( ( function ( ) { return ak } ) ) ; case "./locale/lang.cs.js" : return Promise . resolve ( ) . then ( ( function ( ) { return sk } ) ) ; case "./locale/lang.cy.js" : return Promise . resolve ( ) . then ( ( function ( ) { return lk } ) ) ; case "./locale/lang.da.js" : return Promise . resolve ( ) . then ( ( function ( ) { return ck } ) ) ; case "./locale/lang.de.js" : return Promise . resolve ( ) . then ( ( function ( ) { return uk } ) ) ; case "./locale/lang.el.js" : return Promise . resolve ( ) . then ( ( function ( ) { return dk } ) ) ; case "./locale/lang.en.js" : return Promise . resolve ( ) . then ( ( function ( ) { return hk } ) ) ; case "./locale/lang.es.js" : return Promise . resolve ( ) . then ( ( function ( ) { return pk } ) ) ; case "./locale/lang.et.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Ak } ) ) ; case "./locale/lang.fa.js" : return Promise . resolve ( ) . then ( ( function ( ) { return fk } ) ) ; case "./locale/lang.fi.js" : return Promise . resolve ( ) . then ( ( function ( ) { return gk } ) ) ; case "./locale/lang.fr.js" : return Promise . resolve ( ) . then ( ( function ( ) { return mk } ) ) ; case "./locale/lang.fy.js" : return Promise . resolve ( ) . then ( ( function ( ) { return _k } ) ) ; case "./locale/lang.ga.js" : return Promise . resolve ( ) . then ( ( function ( ) { return vk } ) ) ; case "./locale/lang.gl.js" : return Promise . resolve ( ) . then ( ( function ( ) { return yk } ) ) ; case "./locale/lang.he.js" : return Promise . resolve ( ) . then ( ( function ( ) { return wk } ) ) ; case "./locale/lang.hi.js" : return Promise . resolve ( ) . then ( ( function ( ) { return xk } ) ) ; case "./locale/lang.hr.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Sk } ) ) ; case "./locale/lang.hu.js" : return Promise . resolve ( ) . then ( ( function ( ) { return kk } ) ) ; case "./locale/lang.hy.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Ck } ) ) ; case "./locale/lang.id.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Bk } ) ) ; case "./locale/lang.is.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Ek } ) ) ; case "./locale/lang.it.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Nk } ) ) ; case "./locale/lang.ja.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Lk } ) ) ; case "./locale/lang.ko.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Tk } ) ) ; case "./locale/lang.lt.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Pk } ) ) ; case "./locale/lang.lv.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Fk } ) ) ; case "./locale/lang.mk.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Uk } ) ) ; case "./locale/lang.ms.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Ik } ) ) ; case "./locale/lang.mt.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Rk } ) ) ; case "./locale/lang.nl.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Mk } ) ) ; case "./locale/lang.no.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Qk } ) ) ; case "./locale/lang.pl.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Ok } ) ) ; case "./locale/lang.pt-BR.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Dk } ) ) ; case "./locale/lang.pt-PT.js" : return Promise . resolve ( ) . then ( ( function ( ) { return jk } ) ) ; case "./locale/lang.ro.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Hk } ) ) ; case "./locale/lang.ru.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Gk } ) ) ; case "./locale/lang.sk.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Vk } ) ) ; case "./locale/lang.sl.js" : return Promise . resolve ( ) . then ( ( function ( ) { return zk } ) ) ; case "./locale/lang.sq.js" : return Promise . resolve ( ) . then ( ( function ( ) { return Kk } ) ) ; case "./locale/lang.sr.js" : return Promise . resolve ( ) . then ( ( function ( ) { return qk } ) ) ; case "./locale/lang.sv.js" : return Promise . resolve ( ) . then ( ( function ( ) { retu
2020-09-04 20:34:30 +00:00
/ * *
2020-09-08 23:35:47 +00:00
* Localizing script for SVG - edit UI .
* @ module locale
* @ license MIT
*
* @ copyright 2010 Narendra Sisodya
* @ copyright 2010 Alexis Deveria
*
2020-09-19 14:20:30 +00:00
* / _ e x p o r t ( { t a r g e t : " S t r i n g " , p r o t o : ! 0 , f o r c e d : s t r i n g H t m l F o r c e d ( " b o l d " ) } , { b o l d : f u n c t i o n b o l d ( ) { r e t u r n c r e a t e H t m l ( t h i s , " b " , " " , " " ) } } ) ; v a r w S , b S = j Q u e r y , x S = f u n c t i o n s e t S t r i n g s ( T n , U n , Q n ) { v a r D n = b S ( " # s v g _ e d i t o r " ) . p a r e n t ( ) ; O b j e c t . e n t r i e s ( U n ) . f o r E a c h ( ( f u n c t i o n ( U n ) { v a r H n = _ s l i c e d T o A r r a y ( U n , 2 ) , G n = H n [ 0 ] , V n = H n [ 1 ] ; i f ( V n ) { Q n & & ( G n = " # " + G n ) ; v a r z n = D n . f i n d ( G n ) ; i f ( z n . l e n g t h ) { v a r K n = z n [ 0 ] ; s w i t c h ( T n ) { c a s e " a r i a - l a b e l " : K n . s e t A t t r i b u t e ( " a r i a - l a b e l " , V n ) ; b r e a k ; c a s e " c o n t e n t " : _ t o C o n s u m a b l e A r r a y ( K n . c h i l d N o d e s ) . s o m e ( ( f u n c t i o n ( T n ) { r e t u r n ! ( 3 ! = = T n . n o d e T y p e | | ! T n . t e x t C o n t e n t . t r i m ( ) ) & & ( T n . t e x t C o n t e n t = V n , ! 0 ) } ) ) ; b r e a k ; c a s e " t i t l e " : K n . t i t l e = V n } } e l s e c o n s o l e . l o g ( " M i s s i n g e l e m e n t f o r l o c a l i z a t i o n : " + G n ) } e l s e c o n s o l e . l o g ( G n ) } ) ) } , S S = f u n c t i o n r e a d L a n g ( T n ) { v a r U n = T n . t o o l s , Q n = T n . p r o p e r t i e s , D n = T n . c o n f i g , H n = T n . l a y e r s , G n = T n . c o m m o n , V n = T n . u i ; x S ( " c o n t e n t " , { c u r v e _ s e g m e n t s : Q n . c u r v e _ s e g m e n t s , f i t T o C o n t e n t : U n . f i t T o C o n t e n t , f i t _ t o _ a l l : U n . f i t _ t o _ a l l , f i t _ t o _ c a n v a s : U n . f i t _ t o _ c a n v a s , f i t _ t o _ l a y e r _ c o n t e n t : U n . f i t _ t o _ l a y e r _ c o n t e n t , f i t _ t o _ s e l : U n . f i t _ t o _ s e l , i c o n _ l a r g e : D n . i c o n _ l a r g e , i c o n _ m e d i u m : D n . i c o n _ m e d i u m , i c o n _ s m a l l : D n . i c o n _ s m a l l , i c o n _ x l a r g e : D n . i c o n _ x l a r g e , i m a g e _ o p t _ e m b e d : D n . i m a g e _ o p t _ e m b e d , i m a g e _ o p t _ r e f : D n . i m a g e _ o p t _ r e f , i n c l u d e d I m a g e s : D n . i n c l u d e d _ i m a g e s , l a r g e s t _ o b j e c t : U n . l a r g e s t _ o b j e c t , l a y e r s L a b e l : H n . l a y e r s , p a g e : U n . p a g e , r e l a t i v e T o L a b e l : U n . r e l a t i v e T o , s e l L a y e r L a b e l : H n . m o v e _ e l e m s _ t o , s e l e c t e d P r e d e f i n e d : D n . s e l e c t _ p r e d e f i n e d , s e l e c t e d _ o b j e c t s : U n . s e l e c t e d _ o b j e c t s , s m a l l e s t _ o b j e c t : U n . s m a l l e s t _ o b j e c t , s t r a i g h t _ s e g m e n t s : Q n . s t r a i g h t _ s e g m e n t s , s v g i n f o _ b g _ u r l : D n . e d i t o r _ i m g _ u r l + " : " , s v g i n f o _ b g _ n o t e : D n . e d i t o r _ b g _ n o t e , s v g i n f o _ c h a n g e _ b a c k g r o u n d : D n . b a c k g r o u n d , s v g i n f o _ d i m : D n . d o c _ d i m s , s v g i n f o _ e d i t o r _ p r e f s : D n . e d i t o r _ p r e f s , s v g i n f o _ h e i g h t : G n . h e i g h t , s v g i n f o _ i c o n s : D n . i c o n _ s i z e , s v g i n f o _ i m a g e _ p r o p s : D n . i m a g e _ p r o p s , s v g i n f o _ l a n g : D n . l a n g u a g e , s v g i n f o _ t i t l e : D n . d o c _ t i t l e , s v g i n f o _ w i d t h : G n . w i d t h , t o o l _ d o c p r o p s _ c a n c e l : G n . c a n c e l , t o o l _ d o c p r o p s _ s a v e : G n . o k , t o o l _ s o u r c e _ c a n c e l : G n . c a n c e l , t o o l _ s o u r c e _ s a v e : G n . o k , t o o l _ p r e f s _ c a n c e l : G n . c a n c e l , t o o l _ p r e f s _ s a v e : G n . o k , s i d e p a n e l _ h a n d l e : H n . l a y e r s . s p l i t ( " " ) . j o i n ( " " ) , t o o l _ c l e a r : U n . n e w _ d o c , t o o l _ d o c p r o p s : U n . d o c p r o p s , t o o l _ e x p o r t : U n . e x p o r t _ i m g , t o o l _ i m p o r t : U n . i m p o r t _ d o c , t o o l _ o p e n : U n . o p e n _ d o c , t o o l _ s a v e : U n . s a v e _ d o c , t o o l _ e d i t o r _ p r e f s : D n . e d i t o r _ p r e f s , t o o l _ e d i t o r _ h o m e p a g e : U n . e d i t o r _ h o m e p a g e , s v g i n f o _ u n i t s _ r u l e r s : D n . u n i t s _ a n d _ r u l e r s , s v g i n f o _ r u l e r s _ o n o f f : D n . s h o w _ r u l e r s , s v g i n f o _ u n i t : D n . b a s e _ u n i t , s v g i n f o _ g r i d _ s e t t i n g s : D n . g r i d , s v g i n f o _ s n a p _ o n o f f : D n . s n a p p i n g _ o n o f f , s v g i n f o _ s n a p _ s t e p : D n . s n a p p i n g _ s t e p s i z e , s v g i n f o _ g r i d _ c o l o r : D n . g r i d _ c o l o r } , ! 0 ) ; v a r z n = { } ; [ " c u t " , " c o p y " , " p a s t e " , " p a s t e _ i n _ p l a c e " , " d e l e t e " , " g r o u p " , " u n g r o u p " , " m o v e _ f r o n t " , " m o v e _ u p " , " m o v e _ d o w n " , " m o v e _ b a c k " ] . f o r E a c h ( ( f u n c t i o n ( T n ) { z n [ ' # c m e n u _ c a n v a s a [ h r e f = " # ' + T n + ' " ] ' ] = U n [ T n ] } ) ) , [ " d u p e " , " m e r g e _ d o w n " , " m e r g e _ a l l " ] . f o r E a c h ( ( f u n c t i o n ( T n ) { z n [ ' # c m e n u _ l a y e r s a [ h r e f = " # ' + T n + ' " ] ' ] = H n [ T n ] } ) ) , z n [ ' # c m e n u _ l a y e r s a [ h r e f = " # d e l e t e " ] ' ] = H n . d e l , x S ( " c o n t e n t " , z n ) ; v a r K n = { } ; r e t u r n O b j e c t . e n t r i e s ( { t o o l _ b l u r : Q n . b l u r , t o o l _ p o s i t i o n : U n . a l i g n _ t o _ p a g e , t o o l _ f o n t _ f a m i l y : Q n . f o n t _ f a m i l y , z o o m _ p a n e l : V n . z o o m _ l e v e l , s t r o k e _ l i n e j o i n : Q n . l i n e j o i n _ m i t e r , s t r o k e _ l i n e c a p : Q n . l i n e c a p _ b u t t , t o o l _ o p a c i t y : Q n . o p a c i t y } ) . f o r E a c h ( ( f u n c t i o n ( T n ) { v a r U n = _ s l i c e d T o A r r a y ( T n , 2 ) , Q n = U n [ 0 ] , D n = U n [ 1 ] ; K n [ " # " + Q n + " b u t t o n " ] = D n } ) ) , O b j e c t . e n t r i e s ( { g r o u p _ o p a c i t y : Q n . o p a c i t y , z o o m : V n . z o o m _ l e v e l } ) . f o r E a c h ( ( f u n c t i o n ( T n ) { v a r U n = _ s l i c e d T o A r r a y ( T n , 2 ) , Q n = U n [ 0 ] , D n = U n [ 1 ] ; K n [ " # " + Q n ] = D n } ) ) , x S ( " a r i a - l a b e l " , K n ) , x S ( " t i t l e " , { a l i g n _ r e l a t i v e _ t o : U n . a l i g n _ r e l a t i v e _ t o , c i r c l e _ c x : Q n . c i r c l e _ c x , c i r c l e _ c y : Q n . c i r c l e _ c y , c i r c l e _ r : Q n . c i r c l e _ r , c o r n e r R a d i u s L a b e l : Q n . c o r n e r _ r a d i u s , e l l i p s e _ c x : Q n . e l l i p s e _ c x , e l l i p s e _ c y : Q n . e l l i p s e _ c y , e l l i p s e _ r x : Q n . e l l i p s e _ r x , e l l i p s e _ r y : Q n . e l l i p s e _ r y , f i l l _ c o l o r : Q n . f i l l _ c o l o r , f o n t _ f a m i l y : Q n . f o n t _ f a m i l y , i d L a b e l : Q n . i d , i m a g e _ h e i g h t : Q n . i m a g e _ h e i g h t , i m a g e _ u r l : Q n . i m a g e _ u r l , i m a g e _ w i d t h : Q n . i m a g e _ w i d t h , l a y e r _ d e l e t e : H n . d e l , l a y e r _ d o w n : H n . m o v e _ d o w n , l a y e r _ n e w : H n . n e w , l a y e r _ r e n a m e : H n . r e n a m e , l a y e r _ m o r e o p t s : G n . m o r e _ o p t s , l a y e r _ u p : H n . m o v e _ u p , l i n e _ x 1 : Q n . l i n e _ x 1 , l i n e _ x 2 : Q n . l i n e _ x 2 , l i n e _ y 1 : Q n . l i n e _ y 1 , l i n e _ y 2 : Q n . l i n e _ y 2 , l i n e c a p _ b u t t : Q n . l i n e c a p _ b u t t , l i n e c a p _ r o u n d : Q n . l i n e c a p _ r o u n d , l i n e c a p _ s q u a r e : Q n . l i n e c a p _ s q u a r e , l i n e j o i n _ b e v e l : Q n . l i n e j o i n _ b e v e l , l i n e j o i n _ m i t e r : Q n . l
2020-09-04 20:34:30 +00:00
/ * !
2020-09-08 23:35:47 +00:00
* html2canvas 1.0 . 0 - rc . 7 < https : //html2canvas.hertzen.com>
* Copyright ( c ) 2020 Niklas von Hertzen < https : //hertzen.com>
* Released under MIT License
* /
2020-09-18 20:43:34 +00:00
Tn . exports = function ( ) {
2020-09-04 20:34:30 +00:00
/ * ! * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2020-09-08 23:35:47 +00:00
Copyright ( c ) Microsoft Corporation . All rights reserved .
Licensed under the Apache License , Version 2.0 ( the "License" ) ; you may not use
this file except in compliance with the License . You may obtain a copy of the
License at http : //www.apache.org/licenses/LICENSE-2.0
THIS CODE IS PROVIDED ON AN * AS IS * BASIS , WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND , EITHER EXPRESS OR IMPLIED , INCLUDING WITHOUT LIMITATION ANY IMPLIED
WARRANTIES OR CONDITIONS OF TITLE , FITNESS FOR A PARTICULAR PURPOSE ,
MERCHANTABLITY OR NON - INFRINGEMENT .
See the Apache Version 2.0 License for specific language governing permissions
and limitations under the License .
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * /
2020-09-19 14:20:30 +00:00
var Tn = function extendStatics ( Un , Qn ) { return ( Tn = Object . setPrototypeOf || { _ _proto _ _ : [ ] } instanceof Array && function ( Tn , Un ) { Tn . _ _proto _ _ = Un } || function ( Tn , Un ) { for ( var Qn in Un ) Un . hasOwnProperty ( Qn ) && ( Tn [ Qn ] = Un [ Qn ] ) } ) ( Un , Qn ) } ; function _ _extends ( Un , Qn ) { function _ _ ( ) { this . constructor = Un } Tn ( Un , Qn ) , Un . prototype = null === Qn ? Object . create ( Qn ) : ( _ _ . prototype = Qn . prototype , new _ _ ) } var Un = function _ _assign ( ) { return ( Un = Object . assign || function _ _assign ( Tn ) { for ( var Un , Qn = 1 , Dn = arguments . length ; Qn < Dn ; Qn ++ ) for ( var Hn in Un = arguments [ Qn ] ) Object . prototype . hasOwnProperty . call ( Un , Hn ) && ( Tn [ Hn ] = Un [ Hn ] ) ; return Tn } ) . apply ( this , arguments ) } ; function _ _awaiter ( Tn , Un , Qn , Dn ) { return new ( Qn || ( Qn = Promise ) ) ( ( function ( Hn , Gn ) { function fulfilled ( Tn ) { try { step ( Dn . next ( Tn ) ) } catch ( Tn ) { Gn ( Tn ) } } function rejected ( Tn ) { try { step ( Dn . throw ( Tn ) ) } catch ( Tn ) { Gn ( Tn ) } } function step ( Tn ) { Tn . done ? Hn ( Tn . value ) : new Qn ( ( function ( Un ) { Un ( Tn . value ) } ) ) . then ( fulfilled , rejected ) } step ( ( Dn = Dn . apply ( Tn , Un || [ ] ) ) . next ( ) ) } ) ) } function _ _generator ( Tn , Un ) { var Qn , Dn , Hn , Gn , Vn = { label : 0 , sent : function sent ( ) { if ( 1 & Hn [ 0 ] ) throw Hn [ 1 ] ; return Hn [ 1 ] } , trys : [ ] , ops : [ ] } ; return Gn = { next : verb ( 0 ) , throw : verb ( 1 ) , return : verb ( 2 ) } , "function" == typeof Symbol && ( Gn [ Symbol . iterator ] = function ( ) { return this } ) , Gn ; function verb ( Tn ) { return function ( Un ) { return step ( [ Tn , Un ] ) } } function step ( Gn ) { if ( Qn ) throw new TypeError ( "Generator is already executing." ) ; for ( ; Vn ; ) try { if ( Qn = 1 , Dn && ( Hn = 2 & Gn [ 0 ] ? Dn . return : Gn [ 0 ] ? Dn . throw || ( ( Hn = Dn . return ) && Hn . call ( Dn ) , 0 ) : Dn . next ) && ! ( Hn = Hn . call ( Dn , Gn [ 1 ] ) ) . done ) return Hn ; switch ( Dn = 0 , Hn && ( Gn = [ 2 & Gn [ 0 ] , Hn . value ] ) , Gn [ 0 ] ) { case 0 : case 1 : Hn = Gn ; break ; case 4 : return Vn . label ++ , { value : Gn [ 1 ] , done : ! 1 } ; case 5 : Vn . label ++ , Dn = Gn [ 1 ] , Gn = [ 0 ] ; continue ; case 7 : Gn = Vn . ops . pop ( ) , Vn . trys . pop ( ) ; continue ; default : if ( ! ( ( Hn = ( Hn = Vn . trys ) . length > 0 && Hn [ Hn . length - 1 ] ) || 6 !== Gn [ 0 ] && 2 !== Gn [ 0 ] ) ) { Vn = 0 ; continue } if ( 3 === Gn [ 0 ] && ( ! Hn || Gn [ 1 ] > Hn [ 0 ] && Gn [ 1 ] < Hn [ 3 ] ) ) { Vn . label = Gn [ 1 ] ; break } if ( 6 === Gn [ 0 ] && Vn . label < Hn [ 1 ] ) { Vn . label = Hn [ 1 ] , Hn = Gn ; break } if ( Hn && Vn . label < Hn [ 2 ] ) { Vn . label = Hn [ 2 ] , Vn . ops . push ( Gn ) ; break } Hn [ 2 ] && Vn . ops . pop ( ) , Vn . trys . pop ( ) ; continue } Gn = Un . call ( Tn , Vn ) } catch ( Tn ) { Gn = [ 6 , Tn ] , Dn = 0 } finally { Qn = Hn = 0 } if ( 5 & Gn [ 0 ] ) throw Gn [ 1 ] ; return { value : Gn [ 0 ] ? Gn [ 1 ] : void 0 , done : ! 0 } } } for ( var Qn = function ( ) { function Bounds ( Tn , Un , Qn , Dn ) { this . left = Tn , this . top = Un , this . width = Qn , this . height = Dn } return Bounds . prototype . add = function ( Tn , Un , Qn , Dn ) { return new Bounds ( this . left + Tn , this . top + Un , this . width + Qn , this . height + Dn ) } , Bounds . fromClientRect = function ( Tn ) { return new Bounds ( Tn . left , Tn . top , Tn . width , Tn . height ) } , Bounds } ( ) , Dn = function parseBounds ( Tn ) { return Qn . fromClientRect ( Tn . getBoundingClientRect ( ) ) } , Hn = function parseDocumentSize ( Tn ) { var Un = Tn . body , Dn = Tn . documentElement ; if ( ! Un || ! Dn ) throw new Error ( "Unable to get document size" ) ; var Hn = Math . max ( Math . max ( Un . scrollWidth , Dn . scrollWidth ) , Math . max ( Un . offsetWidth , Dn . offsetWidth ) , Math . max ( Un . clientWidth , Dn . clientWidth ) ) , Gn = Math . max ( Math . max ( Un . scrollHeight , Dn . scrollHeight ) , Math . max ( Un . offsetHeight , Dn . offsetHeight ) , Math . max ( Un . clientHeight , Dn . clientHeight ) ) ; return new Qn ( 0 , 0 , Hn , Gn ) } , Gn = function toCodePoints ( Tn ) { for ( var Un = [ ] , Qn = 0 , Dn = Tn . length ; Qn < Dn ; ) { var Hn = Tn . charCodeAt ( Qn ++ ) ; if ( Hn >= 55296 && Hn <= 56319 && Qn < Dn ) { var Gn = Tn . charCodeAt ( Qn ++ ) ; 56320 == ( 64512 & Gn ) ? Un . push ( ( ( 1023 & Hn ) << 10 ) + ( 1023 & Gn ) + 65536 ) : ( Un . push ( Hn ) , Qn -- ) } else Un . push ( Hn ) } return Un } , Vn = function fromCodePoint ( ) { for ( var Tn = [ ] , Un = 0 ; Un < arguments . length ; Un ++ ) Tn [ Un ] = arguments [ Un ] ; if ( String . fromCodePoint ) return String . fromCodePoint . apply ( String , Tn ) ; var Qn = Tn . length ; if ( ! Qn ) return "" ; for ( var Dn = [ ] , Hn = - 1 , Gn = "" ; ++ Hn < Qn ; ) { var Vn = Tn [ Hn ] ; Vn <= 65535 ? Dn . push ( Vn ) : ( Vn -= 65536 , Dn . push ( 55296 + ( Vn >> 10 ) , Vn % 1024 + 56320 ) ) , ( Hn + 1 === Qn || Dn . length > 16384 ) && ( Gn += String . fromCharCode . apply ( String , Dn ) , Dn . length = 0 ) } return Gn } , zn = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" , Kn = "undefined" == typeof Uint8Array ? [ ] : new Uint8Array ( 256 ) , Wn = 0 ; Wn < zn . length ; Wn ++ ) Kn [ zn . charCodeAt ( Wn ) ] = Wn ; var Xn , Yn = function decode ( Tn ) { var Un , Qn , Dn , Hn , Gn , Vn = . 75 * Tn . length , zn = Tn . length , Wn = 0 ; "=" === Tn [ Tn . length - 1 ] && ( Vn -- , "=" === Tn [ Tn . length - 2 ] && Vn -- ) ; var Xn = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array && void 0 !== Uint8Array . prototype . sli
2020-09-04 20:34:30 +00:00
/*! @license DOMPurify | (c) Cure53 and other contributors | Released under the Apache license 2.0 and Mozilla Public License 2.0 | github.com/cure53/DOMPurify/blob/2.0.8/LICENSE */
2020-09-19 14:20:30 +00:00
Tn . exports = function ( ) { function _toConsumableArray ( Tn ) { if ( Array . isArray ( Tn ) ) { for ( var Un = 0 , Qn = Array ( Tn . length ) ; Un < Tn . length ; Un ++ ) Qn [ Un ] = Tn [ Un ] ; return Qn } return Array . from ( Tn ) } var Tn = Object . hasOwnProperty , Un = Object . setPrototypeOf , Qn = Object . isFrozen , Dn = Object . keys , Hn = Object . freeze , Gn = Object . seal , Vn = "undefined" != typeof Reflect && Reflect , zn = Vn . apply , Kn = Vn . construct ; zn || ( zn = function apply ( Tn , Un , Qn ) { return Tn . apply ( Un , Qn ) } ) , Hn || ( Hn = function freeze ( Tn ) { return Tn } ) , Gn || ( Gn = function seal ( Tn ) { return Tn } ) , Kn || ( Kn = function construct ( Tn , Un ) { return new ( Function . prototype . bind . apply ( Tn , [ null ] . concat ( _toConsumableArray ( Un ) ) ) ) } ) ; var Wn = unapply ( Array . prototype . forEach ) , Xn = unapply ( Array . prototype . indexOf ) , Yn = unapply ( Array . prototype . join ) , Jn = unapply ( Array . prototype . pop ) , $n = unapply ( Array . prototype . push ) , Zn = unapply ( Array . prototype . slice ) , er = unapply ( String . prototype . toLowerCase ) , tr = unapply ( String . prototype . match ) , nr = unapply ( String . prototype . replace ) , rr = unapply ( String . prototype . indexOf ) , ir = unapply ( String . prototype . trim ) , or = unapply ( RegExp . prototype . test ) , ar = unconstruct ( RegExp ) , sr = unconstruct ( TypeError ) ; function unapply ( Tn ) { return function ( Un ) { for ( var Qn = arguments . length , Dn = Array ( Qn > 1 ? Qn - 1 : 0 ) , Hn = 1 ; Hn < Qn ; Hn ++ ) Dn [ Hn - 1 ] = arguments [ Hn ] ; return zn ( Tn , Un , Dn ) } } function unconstruct ( Tn ) { return function ( ) { for ( var Un = arguments . length , Qn = Array ( Un ) , Dn = 0 ; Dn < Un ; Dn ++ ) Qn [ Dn ] = arguments [ Dn ] ; return Kn ( Tn , Qn ) } } function addToSet ( Tn , Dn ) { Un && Un ( Tn , null ) ; for ( var Hn = Dn . length ; Hn -- ; ) { var Gn = Dn [ Hn ] ; if ( "string" == typeof Gn ) { var Vn = er ( Gn ) ; Vn !== Gn && ( Qn ( Dn ) || ( Dn [ Hn ] = Vn ) , Gn = Vn ) } Tn [ Gn ] = ! 0 } return Tn } function clone ( Un ) { var Qn = { } , Dn = void 0 ; for ( Dn in Un ) zn ( Tn , Un , [ Dn ] ) && ( Qn [ Dn ] = Un [ Dn ] ) ; return Qn } var lr = Hn ( [ "a" , "abbr" , "acronym" , "address" , "area" , "article" , "aside" , "audio" , "b" , "bdi" , "bdo" , "big" , "blink" , "blockquote" , "body" , "br" , "button" , "canvas" , "caption" , "center" , "cite" , "code" , "col" , "colgroup" , "content" , "data" , "datalist" , "dd" , "decorator" , "del" , "details" , "dfn" , "dir" , "div" , "dl" , "dt" , "element" , "em" , "fieldset" , "figcaption" , "figure" , "font" , "footer" , "form" , "h1" , "h2" , "h3" , "h4" , "h5" , "h6" , "head" , "header" , "hgroup" , "hr" , "html" , "i" , "img" , "input" , "ins" , "kbd" , "label" , "legend" , "li" , "main" , "map" , "mark" , "marquee" , "menu" , "menuitem" , "meter" , "nav" , "nobr" , "ol" , "optgroup" , "option" , "output" , "p" , "picture" , "pre" , "progress" , "q" , "rp" , "rt" , "ruby" , "s" , "samp" , "section" , "select" , "shadow" , "small" , "source" , "spacer" , "span" , "strike" , "strong" , "style" , "sub" , "summary" , "sup" , "table" , "tbody" , "td" , "template" , "textarea" , "tfoot" , "th" , "thead" , "time" , "tr" , "track" , "tt" , "u" , "ul" , "var" , "video" , "wbr" ] ) , cr = Hn ( [ "svg" , "a" , "altglyph" , "altglyphdef" , "altglyphitem" , "animatecolor" , "animatemotion" , "animatetransform" , "audio" , "canvas" , "circle" , "clippath" , "defs" , "desc" , "ellipse" , "filter" , "font" , "g" , "glyph" , "glyphref" , "hkern" , "image" , "line" , "lineargradient" , "marker" , "mask" , "metadata" , "mpath" , "path" , "pattern" , "polygon" , "polyline" , "radialgradient" , "rect" , "stop" , "style" , "switch" , "symbol" , "text" , "textpath" , "title" , "tref" , "tspan" , "video" , "view" , "vkern" ] ) , ur = Hn ( [ "feBlend" , "feColorMatrix" , "feComponentTransfer" , "feComposite" , "feConvolveMatrix" , "feDiffuseLighting" , "feDisplacementMap" , "feDistantLight" , "feFlood" , "feFuncA" , "feFuncB" , "feFuncG" , "feFuncR" , "feGaussianBlur" , "feMerge" , "feMergeNode" , "feMorphology" , "feOffset" , "fePointLight" , "feSpecularLighting" , "feSpotLight" , "feTile" , "feTurbulence" ] ) , dr = Hn ( [ "math" , "menclose" , "merror" , "mfenced" , "mfrac" , "mglyph" , "mi" , "mlabeledtr" , "mmultiscripts" , "mn" , "mo" , "mover" , "mpadded" , "mphantom" , "mroot" , "mrow" , "ms" , "mspace" , "msqrt" , "mstyle" , "msub" , "msup" , "msubsup" , "mtable" , "mtd" , "mtext" , "mtr" , "munder" , "munderover" ] ) , hr = Hn ( [ "#text" ] ) , pr = Hn ( [ "accept" , "action" , "align" , "alt" , "autocapitalize" , "autocomplete" , "autopictureinpicture" , "autoplay" , "background" , "bgcolor" , "border" , "capture" , "cellpadding" , "cellspacing" , "checked" , "cite" , "class" , "clear" , "color" , "cols" , "colspan" , "controls" , "controlslist" , "coords" , "crossorigin" , "datetime" , "decoding" , "default" , "dir" , "disabled" , "disablepictureinpicture" , "disableremoteplayback" , "download" , "draggable" , "enctype" , "enterkeyhint" , "face" , "for" , "headers" , "height" , "hidden" , "high" , "href" , "hreflang" , "id" , "inputmode" , " i
